./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-12.i --full-output --architecture 32bit


--------------------------------------------------------------------------------


Checking for ERROR reachability
Using default analysis
Version c00e63dc
Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-12.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 6426d30449276f41292d944281f990de88775c0c256461a4ce5af87d5d4d093f
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-c00e63d-m
[2025-02-06 03:11:48,599 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-02-06 03:11:48,634 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2025-02-06 03:11:48,638 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-02-06 03:11:48,638 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-02-06 03:11:48,651 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-02-06 03:11:48,651 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-02-06 03:11:48,651 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-02-06 03:11:48,652 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-02-06 03:11:48,652 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-02-06 03:11:48,652 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-02-06 03:11:48,652 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-02-06 03:11:48,652 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-02-06 03:11:48,652 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-02-06 03:11:48,652 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-02-06 03:11:48,652 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-02-06 03:11:48,652 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-02-06 03:11:48,653 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-02-06 03:11:48,653 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-02-06 03:11:48,653 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-02-06 03:11:48,653 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-02-06 03:11:48,653 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-02-06 03:11:48,653 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-02-06 03:11:48,653 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-02-06 03:11:48,653 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-02-06 03:11:48,653 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-02-06 03:11:48,653 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-02-06 03:11:48,654 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-02-06 03:11:48,654 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-02-06 03:11:48,654 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-02-06 03:11:48,654 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-02-06 03:11:48,654 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-02-06 03:11:48,654 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-02-06 03:11:48,655 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-02-06 03:11:48,655 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-02-06 03:11:48,655 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-02-06 03:11:48,655 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-02-06 03:11:48,655 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-02-06 03:11:48,655 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-02-06 03:11:48,655 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-02-06 03:11:48,655 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-02-06 03:11:48,655 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-02-06 03:11:48,655 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-02-06 03:11:48,655 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 -> 6426d30449276f41292d944281f990de88775c0c256461a4ce5af87d5d4d093f
[2025-02-06 03:11:48,831 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-02-06 03:11:48,836 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-02-06 03:11:48,838 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-02-06 03:11:48,838 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-02-06 03:11:48,838 INFO  L274        PluginConnector]: CDTParser initialized
[2025-02-06 03:11:48,839 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-12.i
[2025-02-06 03:11:49,963 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a3b2eb4b0/6cece5ab056448f9ba2e6a50f6cc40f9/FLAG8ec75a443
[2025-02-06 03:11:50,222 INFO  L384              CDTParser]: Found 1 translation units.
[2025-02-06 03:11:50,222 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-12.i
[2025-02-06 03:11:50,230 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a3b2eb4b0/6cece5ab056448f9ba2e6a50f6cc40f9/FLAG8ec75a443
[2025-02-06 03:11:50,240 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a3b2eb4b0/6cece5ab056448f9ba2e6a50f6cc40f9
[2025-02-06 03:11:50,242 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-02-06 03:11:50,243 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-02-06 03:11:50,244 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-02-06 03:11:50,244 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-02-06 03:11:50,247 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-02-06 03:11:50,247 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:11:50" (1/1) ...
[2025-02-06 03:11:50,248 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48d7f33e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:11:50, skipping insertion in model container
[2025-02-06 03:11:50,248 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:11:50" (1/1) ...
[2025-02-06 03:11:50,262 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-02-06 03:11:50,379 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/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-12.i[916,929]
[2025-02-06 03:11:50,430 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-06 03:11:50,443 INFO  L200         MainTranslator]: Completed pre-run
[2025-02-06 03:11:50,450 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/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-12.i[916,929]
[2025-02-06 03:11:50,491 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-06 03:11:50,505 INFO  L204         MainTranslator]: Completed translation
[2025-02-06 03:11:50,506 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:11:50 WrapperNode
[2025-02-06 03:11:50,506 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-02-06 03:11:50,506 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-02-06 03:11:50,507 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-02-06 03:11:50,507 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-02-06 03:11:50,511 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:11:50" (1/1) ...
[2025-02-06 03:11:50,519 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:11:50" (1/1) ...
[2025-02-06 03:11:50,547 INFO  L138                Inliner]: procedures = 26, calls = 153, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 444
[2025-02-06 03:11:50,547 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-02-06 03:11:50,549 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-02-06 03:11:50,549 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-02-06 03:11:50,549 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-02-06 03:11:50,555 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:11:50" (1/1) ...
[2025-02-06 03:11:50,555 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:11:50" (1/1) ...
[2025-02-06 03:11:50,558 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:11:50" (1/1) ...
[2025-02-06 03:11:50,570 INFO  L175           MemorySlicer]: Split 123 memory accesses to 4 slices as follows [2, 38, 12, 71]. 58 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 5, 2, 4]. The 14 writes are split as follows [0, 8, 2, 4].
[2025-02-06 03:11:50,570 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:11:50" (1/1) ...
[2025-02-06 03:11:50,570 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:11:50" (1/1) ...
[2025-02-06 03:11:50,587 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:11:50" (1/1) ...
[2025-02-06 03:11:50,589 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:11:50" (1/1) ...
[2025-02-06 03:11:50,590 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:11:50" (1/1) ...
[2025-02-06 03:11:50,591 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:11:50" (1/1) ...
[2025-02-06 03:11:50,593 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-02-06 03:11:50,593 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-02-06 03:11:50,594 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-02-06 03:11:50,594 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-02-06 03:11:50,594 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:11:50" (1/1) ...
[2025-02-06 03:11:50,598 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-02-06 03:11:50,606 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 03:11:50,619 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2025-02-06 03:11:50,629 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2025-02-06 03:11:50,644 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-02-06 03:11:50,644 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#0
[2025-02-06 03:11:50,644 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#1
[2025-02-06 03:11:50,644 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#2
[2025-02-06 03:11:50,644 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#3
[2025-02-06 03:11:50,644 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int#0
[2025-02-06 03:11:50,644 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int#1
[2025-02-06 03:11:50,644 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int#2
[2025-02-06 03:11:50,645 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int#3
[2025-02-06 03:11:50,645 INFO  L130     BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2025-02-06 03:11:50,645 INFO  L138     BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2025-02-06 03:11:50,645 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-02-06 03:11:50,645 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#1
[2025-02-06 03:11:50,645 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#2
[2025-02-06 03:11:50,645 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#3
[2025-02-06 03:11:50,645 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-02-06 03:11:50,645 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-02-06 03:11:50,712 INFO  L257             CfgBuilder]: Building ICFG
[2025-02-06 03:11:50,713 INFO  L287             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-02-06 03:11:50,999 INFO  L1309  $ProcedureCfgBuilder]: dead code at ProgramPoint L90: havoc property_#t~mem71#1;havoc property_#t~ite82#1;havoc property_#t~mem72#1;havoc property_#t~mem73#1;havoc property_#t~ite81#1;havoc property_#t~mem74#1;havoc property_#t~mem75#1;havoc property_#t~ite78#1;havoc property_#t~mem77#1;havoc property_#t~mem76#1;havoc property_#t~mem80#1;havoc property_#t~mem79#1;havoc property_#t~mem83#1;havoc property_#t~mem84#1;havoc property_#t~ite105#1;havoc property_#t~mem104#1;havoc property_#t~mem90#1;havoc property_#t~mem85#1;havoc property_#t~mem86#1;havoc property_#t~ite89#1;havoc property_#t~mem87#1;havoc property_#t~mem88#1;havoc property_#t~ite103#1;havoc property_#t~mem96#1;havoc property_#t~mem91#1;havoc property_#t~mem92#1;havoc property_#t~ite95#1;havoc property_#t~mem93#1;havoc property_#t~mem94#1;havoc property_#t~mem102#1;havoc property_#t~mem97#1;havoc property_#t~mem98#1;havoc property_#t~ite101#1;havoc property_#t~mem99#1;havoc property_#t~mem100#1;havoc property_#t~short106#1;havoc property_#t~mem109#1;havoc property_#t~mem107#1;havoc property_#t~mem108#1;havoc property_#t~mem110#1;havoc property_#t~ite126#1;havoc property_#t~mem111#1;havoc property_#t~mem114#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~ite123#1;havoc property_#t~mem120#1;havoc property_#t~mem118#1;havoc property_#t~mem115#1;havoc property_#t~mem116#1;havoc property_#t~short117#1;havoc property_#t~short119#1;havoc property_#t~mem122#1;havoc property_#t~mem121#1;havoc property_#t~mem125#1;havoc property_#t~mem124#1;havoc property_#t~short127#1;
[2025-02-06 03:11:51,042 INFO  L?                        ?]: Removed 131 outVars from TransFormulas that were not future-live.
[2025-02-06 03:11:51,042 INFO  L308             CfgBuilder]: Performing block encoding
[2025-02-06 03:11:51,053 INFO  L332             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-02-06 03:11:51,053 INFO  L337             CfgBuilder]: Removed 0 assume(true) statements.
[2025-02-06 03:11:51,053 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:11:51 BoogieIcfgContainer
[2025-02-06 03:11:51,053 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-02-06 03:11:51,055 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-02-06 03:11:51,055 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-02-06 03:11:51,058 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-02-06 03:11:51,059 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 03:11:50" (1/3) ...
[2025-02-06 03:11:51,059 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7310c994 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:11:51, skipping insertion in model container
[2025-02-06 03:11:51,059 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:11:50" (2/3) ...
[2025-02-06 03:11:51,060 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7310c994 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:11:51, skipping insertion in model container
[2025-02-06 03:11:51,060 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:11:51" (3/3) ...
[2025-02-06 03:11:51,061 INFO  L128   eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-12.i
[2025-02-06 03:11:51,071 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-02-06 03:11:51,073 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-12.i that has 2 procedures, 97 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-02-06 03:11:51,114 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-02-06 03:11:51,124 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;@7682d3ac, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-02-06 03:11:51,124 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-02-06 03:11:51,127 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 97 states, 78 states have (on average 1.3846153846153846) internal successors, (108), 79 states have internal predecessors, (108), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16)
[2025-02-06 03:11:51,136 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 118
[2025-02-06 03:11:51,137 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-06 03:11:51,137 INFO  L218           NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:11:51,138 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-06 03:11:51,142 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 03:11:51,142 INFO  L85        PathProgramCache]: Analyzing trace with hash 825168545, now seen corresponding path program 1 times
[2025-02-06 03:11:51,147 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 03:11:51,148 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139933070]
[2025-02-06 03:11:51,149 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 03:11:51,150 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 03:11:51,224 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes.
[2025-02-06 03:11:51,246 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements.
[2025-02-06 03:11:51,247 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 03:11:51,247 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 03:11:51,364 INFO  L134       CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked.
[2025-02-06 03:11:51,366 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 03:11:51,366 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139933070]
[2025-02-06 03:11:51,366 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139933070] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-06 03:11:51,367 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [471265688]
[2025-02-06 03:11:51,367 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 03:11:51,367 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-06 03:11:51,368 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 03:11:51,372 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-02-06 03:11:51,377 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2025-02-06 03:11:51,488 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes.
[2025-02-06 03:11:51,547 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements.
[2025-02-06 03:11:51,548 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 03:11:51,548 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 03:11:51,550 INFO  L256         TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 1 conjuncts are in the unsatisfiable core
[2025-02-06 03:11:51,556 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-06 03:11:51,579 INFO  L134       CoverageAnalysis]: Checked inductivity of 480 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked.
[2025-02-06 03:11:51,579 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-02-06 03:11:51,580 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [471265688] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-06 03:11:51,580 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-02-06 03:11:51,580 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2
[2025-02-06 03:11:51,582 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818136224]
[2025-02-06 03:11:51,583 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-06 03:11:51,585 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2025-02-06 03:11:51,585 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 03:11:51,598 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2025-02-06 03:11:51,598 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-02-06 03:11:51,600 INFO  L87              Difference]: Start difference. First operand  has 97 states, 78 states have (on average 1.3846153846153846) internal successors, (108), 79 states have internal predecessors, (108), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand  has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16)
[2025-02-06 03:11:51,622 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-06 03:11:51,623 INFO  L93              Difference]: Finished difference Result 182 states and 281 transitions.
[2025-02-06 03:11:51,623 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2025-02-06 03:11:51,625 INFO  L78                 Accepts]: Start accepts. Automaton has  has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 117
[2025-02-06 03:11:51,626 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-06 03:11:51,629 INFO  L225             Difference]: With dead ends: 182
[2025-02-06 03:11:51,630 INFO  L226             Difference]: Without dead ends: 88
[2025-02-06 03:11:51,632 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-02-06 03:11:51,635 INFO  L435           NwaCegarLoop]: 123 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, 123 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-02-06 03:11:51,636 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-06 03:11:51,646 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 88 states.
[2025-02-06 03:11:51,664 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88.
[2025-02-06 03:11:51,666 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 88 states, 70 states have (on average 1.3) internal successors, (91), 70 states have internal predecessors, (91), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16)
[2025-02-06 03:11:51,668 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 123 transitions.
[2025-02-06 03:11:51,671 INFO  L78                 Accepts]: Start accepts. Automaton has 88 states and 123 transitions. Word has length 117
[2025-02-06 03:11:51,671 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-06 03:11:51,671 INFO  L471      AbstractCegarLoop]: Abstraction has 88 states and 123 transitions.
[2025-02-06 03:11:51,672 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16)
[2025-02-06 03:11:51,672 INFO  L276                IsEmpty]: Start isEmpty. Operand 88 states and 123 transitions.
[2025-02-06 03:11:51,674 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 118
[2025-02-06 03:11:51,675 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-06 03:11:51,675 INFO  L218           NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:11:51,682 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2025-02-06 03:11:51,876 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0
[2025-02-06 03:11:51,876 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-06 03:11:51,877 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 03:11:51,877 INFO  L85        PathProgramCache]: Analyzing trace with hash 1491333777, now seen corresponding path program 1 times
[2025-02-06 03:11:51,877 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 03:11:51,877 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45271219]
[2025-02-06 03:11:51,877 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 03:11:51,878 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 03:11:51,893 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes.
[2025-02-06 03:11:51,918 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements.
[2025-02-06 03:11:51,918 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 03:11:51,918 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 03:11:52,302 INFO  L134       CoverageAnalysis]: Checked inductivity of 480 backedges. 12 proven. 33 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked.
[2025-02-06 03:11:52,303 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 03:11:52,304 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45271219]
[2025-02-06 03:11:52,304 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45271219] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-06 03:11:52,304 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [145557196]
[2025-02-06 03:11:52,304 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 03:11:52,304 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-06 03:11:52,304 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 03:11:52,306 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-02-06 03:11:52,308 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2025-02-06 03:11:52,391 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes.
[2025-02-06 03:11:52,439 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements.
[2025-02-06 03:11:52,439 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 03:11:52,439 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 03:11:52,441 INFO  L256         TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 3 conjuncts are in the unsatisfiable core
[2025-02-06 03:11:52,444 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-06 03:11:52,483 INFO  L134       CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked.
[2025-02-06 03:11:52,484 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-02-06 03:11:52,484 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [145557196] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-06 03:11:52,485 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-02-06 03:11:52,485 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7
[2025-02-06 03:11:52,485 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391201589]
[2025-02-06 03:11:52,485 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-06 03:11:52,486 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-06 03:11:52,486 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 03:11:52,487 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-06 03:11:52,487 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2025-02-06 03:11:52,487 INFO  L87              Difference]: Start difference. First operand 88 states and 123 transitions. Second operand  has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16)
[2025-02-06 03:11:52,516 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-06 03:11:52,517 INFO  L93              Difference]: Finished difference Result 173 states and 243 transitions.
[2025-02-06 03:11:52,517 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-06 03:11:52,518 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 117
[2025-02-06 03:11:52,518 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-06 03:11:52,519 INFO  L225             Difference]: With dead ends: 173
[2025-02-06 03:11:52,520 INFO  L226             Difference]: Without dead ends: 88
[2025-02-06 03:11:52,521 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2025-02-06 03:11:52,521 INFO  L435           NwaCegarLoop]: 120 mSDtfsCounter, 0 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-02-06 03:11:52,522 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 351 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-06 03:11:52,523 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 88 states.
[2025-02-06 03:11:52,530 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88.
[2025-02-06 03:11:52,532 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 88 states, 70 states have (on average 1.2857142857142858) internal successors, (90), 70 states have internal predecessors, (90), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16)
[2025-02-06 03:11:52,534 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 122 transitions.
[2025-02-06 03:11:52,536 INFO  L78                 Accepts]: Start accepts. Automaton has 88 states and 122 transitions. Word has length 117
[2025-02-06 03:11:52,537 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-06 03:11:52,537 INFO  L471      AbstractCegarLoop]: Abstraction has 88 states and 122 transitions.
[2025-02-06 03:11:52,537 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16)
[2025-02-06 03:11:52,537 INFO  L276                IsEmpty]: Start isEmpty. Operand 88 states and 122 transitions.
[2025-02-06 03:11:52,538 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 120
[2025-02-06 03:11:52,538 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-06 03:11:52,538 INFO  L218           NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:11:52,546 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0
[2025-02-06 03:11:52,738 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-06 03:11:52,739 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-06 03:11:52,741 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 03:11:52,741 INFO  L85        PathProgramCache]: Analyzing trace with hash 1309974883, now seen corresponding path program 1 times
[2025-02-06 03:11:52,741 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 03:11:52,741 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026897100]
[2025-02-06 03:11:52,741 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 03:11:52,742 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 03:11:52,757 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes.
[2025-02-06 03:11:52,777 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements.
[2025-02-06 03:11:52,779 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 03:11:52,779 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 03:11:52,944 INFO  L134       CoverageAnalysis]: Checked inductivity of 480 backedges. 12 proven. 33 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked.
[2025-02-06 03:11:52,944 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 03:11:52,944 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026897100]
[2025-02-06 03:11:52,944 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026897100] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-06 03:11:52,944 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [167755876]
[2025-02-06 03:11:52,944 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 03:11:52,944 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-06 03:11:52,944 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 03:11:52,947 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-02-06 03:11:52,949 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2025-02-06 03:11:53,026 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes.
[2025-02-06 03:11:53,062 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements.
[2025-02-06 03:11:53,062 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 03:11:53,062 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 03:11:53,064 INFO  L256         TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 4 conjuncts are in the unsatisfiable core
[2025-02-06 03:11:53,067 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-06 03:11:53,092 INFO  L134       CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked.
[2025-02-06 03:11:53,092 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-02-06 03:11:53,092 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [167755876] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-06 03:11:53,092 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-02-06 03:11:53,092 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8
[2025-02-06 03:11:53,093 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619630860]
[2025-02-06 03:11:53,093 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-06 03:11:53,093 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-06 03:11:53,093 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 03:11:53,093 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-06 03:11:53,093 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56
[2025-02-06 03:11:53,094 INFO  L87              Difference]: Start difference. First operand 88 states and 122 transitions. Second operand  has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16)
[2025-02-06 03:11:53,129 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-06 03:11:53,133 INFO  L93              Difference]: Finished difference Result 176 states and 245 transitions.
[2025-02-06 03:11:53,134 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-06 03:11:53,134 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 119
[2025-02-06 03:11:53,134 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-06 03:11:53,135 INFO  L225             Difference]: With dead ends: 176
[2025-02-06 03:11:53,135 INFO  L226             Difference]: Without dead ends: 91
[2025-02-06 03:11:53,135 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56
[2025-02-06 03:11:53,136 INFO  L435           NwaCegarLoop]: 119 mSDtfsCounter, 0 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-02-06 03:11:53,136 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 461 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-06 03:11:53,136 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 91 states.
[2025-02-06 03:11:53,144 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91.
[2025-02-06 03:11:53,146 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 91 states, 73 states have (on average 1.273972602739726) internal successors, (93), 73 states have internal predecessors, (93), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16)
[2025-02-06 03:11:53,147 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 125 transitions.
[2025-02-06 03:11:53,149 INFO  L78                 Accepts]: Start accepts. Automaton has 91 states and 125 transitions. Word has length 119
[2025-02-06 03:11:53,150 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-06 03:11:53,150 INFO  L471      AbstractCegarLoop]: Abstraction has 91 states and 125 transitions.
[2025-02-06 03:11:53,150 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16)
[2025-02-06 03:11:53,150 INFO  L276                IsEmpty]: Start isEmpty. Operand 91 states and 125 transitions.
[2025-02-06 03:11:53,151 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 122
[2025-02-06 03:11:53,153 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-06 03:11:53,153 INFO  L218           NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:11:53,162 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2025-02-06 03:11:53,353 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-06 03:11:53,354 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-06 03:11:53,354 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 03:11:53,355 INFO  L85        PathProgramCache]: Analyzing trace with hash -79662761, now seen corresponding path program 1 times
[2025-02-06 03:11:53,355 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 03:11:53,355 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155991691]
[2025-02-06 03:11:53,355 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 03:11:53,355 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 03:11:53,377 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes.
[2025-02-06 03:11:53,453 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements.
[2025-02-06 03:11:53,453 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 03:11:53,453 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 03:11:54,516 INFO  L134       CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked.
[2025-02-06 03:11:54,516 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 03:11:54,516 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155991691]
[2025-02-06 03:11:54,516 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155991691] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-06 03:11:54,516 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-06 03:11:54,517 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-02-06 03:11:54,517 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229032668]
[2025-02-06 03:11:54,517 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-06 03:11:54,517 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-02-06 03:11:54,517 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 03:11:54,517 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-02-06 03:11:54,517 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2025-02-06 03:11:54,518 INFO  L87              Difference]: Start difference. First operand 91 states and 125 transitions. Second operand  has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16)
[2025-02-06 03:11:54,692 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-06 03:11:54,692 INFO  L93              Difference]: Finished difference Result 133 states and 177 transitions.
[2025-02-06 03:11:54,692 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-02-06 03:11:54,692 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 121
[2025-02-06 03:11:54,693 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-06 03:11:54,693 INFO  L225             Difference]: With dead ends: 133
[2025-02-06 03:11:54,693 INFO  L226             Difference]: Without dead ends: 131
[2025-02-06 03:11:54,694 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132
[2025-02-06 03:11:54,694 INFO  L435           NwaCegarLoop]: 115 mSDtfsCounter, 36 mSDsluCounter, 652 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 767 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-02-06 03:11:54,694 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 767 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-02-06 03:11:54,695 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 131 states.
[2025-02-06 03:11:54,702 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 116.
[2025-02-06 03:11:54,704 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 116 states, 98 states have (on average 1.2755102040816326) internal successors, (125), 98 states have internal predecessors, (125), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16)
[2025-02-06 03:11:54,705 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 157 transitions.
[2025-02-06 03:11:54,705 INFO  L78                 Accepts]: Start accepts. Automaton has 116 states and 157 transitions. Word has length 121
[2025-02-06 03:11:54,706 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-06 03:11:54,706 INFO  L471      AbstractCegarLoop]: Abstraction has 116 states and 157 transitions.
[2025-02-06 03:11:54,706 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16)
[2025-02-06 03:11:54,706 INFO  L276                IsEmpty]: Start isEmpty. Operand 116 states and 157 transitions.
[2025-02-06 03:11:54,707 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 123
[2025-02-06 03:11:54,707 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-06 03:11:54,707 INFO  L218           NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:11:54,707 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-02-06 03:11:54,708 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-06 03:11:54,708 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 03:11:54,708 INFO  L85        PathProgramCache]: Analyzing trace with hash 939240366, now seen corresponding path program 1 times
[2025-02-06 03:11:54,708 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 03:11:54,708 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753672536]
[2025-02-06 03:11:54,708 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 03:11:54,708 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 03:11:54,723 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes.
[2025-02-06 03:11:54,792 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements.
[2025-02-06 03:11:54,793 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 03:11:54,793 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 03:11:56,201 INFO  L134       CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked.
[2025-02-06 03:11:56,203 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 03:11:56,203 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753672536]
[2025-02-06 03:11:56,203 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753672536] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-06 03:11:56,203 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [60538354]
[2025-02-06 03:11:56,203 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 03:11:56,203 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-06 03:11:56,203 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 03:11:56,206 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-02-06 03:11:56,211 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2025-02-06 03:11:56,284 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes.
[2025-02-06 03:11:56,328 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements.
[2025-02-06 03:11:56,328 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 03:11:56,328 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 03:11:56,330 INFO  L256         TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 55 conjuncts are in the unsatisfiable core
[2025-02-06 03:11:56,335 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-06 03:11:56,391 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25
[2025-02-06 03:11:56,713 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 28
[2025-02-06 03:11:57,133 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-02-06 03:11:57,134 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 39
[2025-02-06 03:11:57,662 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-02-06 03:11:57,662 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 39
[2025-02-06 03:11:57,771 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-02-06 03:11:57,771 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 34
[2025-02-06 03:11:57,870 INFO  L134       CoverageAnalysis]: Checked inductivity of 480 backedges. 32 proven. 184 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked.
[2025-02-06 03:11:57,870 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-02-06 03:11:58,756 INFO  L134       CoverageAnalysis]: Checked inductivity of 480 backedges. 6 proven. 156 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked.
[2025-02-06 03:11:58,756 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [60538354] provided 0 perfect and 2 imperfect interpolant sequences
[2025-02-06 03:11:58,756 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-02-06 03:11:58,757 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 24, 23] total 58
[2025-02-06 03:11:58,757 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103541683]
[2025-02-06 03:11:58,757 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-02-06 03:11:58,757 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 58 states
[2025-02-06 03:11:58,757 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 03:11:58,758 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants.
[2025-02-06 03:11:58,759 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=463, Invalid=2843, Unknown=0, NotChecked=0, Total=3306
[2025-02-06 03:11:58,760 INFO  L87              Difference]: Start difference. First operand 116 states and 157 transitions. Second operand  has 58 states, 46 states have (on average 3.3260869565217392) internal successors, (153), 48 states have internal predecessors, (153), 15 states have call successors, (48), 6 states have call predecessors, (48), 11 states have return successors, (48), 12 states have call predecessors, (48), 15 states have call successors, (48)
[2025-02-06 03:12:01,369 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-06 03:12:01,369 INFO  L93              Difference]: Finished difference Result 263 states and 333 transitions.
[2025-02-06 03:12:01,370 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. 
[2025-02-06 03:12:01,370 INFO  L78                 Accepts]: Start accepts. Automaton has  has 58 states, 46 states have (on average 3.3260869565217392) internal successors, (153), 48 states have internal predecessors, (153), 15 states have call successors, (48), 6 states have call predecessors, (48), 11 states have return successors, (48), 12 states have call predecessors, (48), 15 states have call successors, (48) Word has length 122
[2025-02-06 03:12:01,371 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-06 03:12:01,372 INFO  L225             Difference]: With dead ends: 263
[2025-02-06 03:12:01,372 INFO  L226             Difference]: Without dead ends: 261
[2025-02-06 03:12:01,376 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 214 SyntacticMatches, 2 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3579 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1770, Invalid=10440, Unknown=0, NotChecked=0, Total=12210
[2025-02-06 03:12:01,377 INFO  L435           NwaCegarLoop]: 118 mSDtfsCounter, 1513 mSDsluCounter, 2267 mSDsCounter, 0 mSdLazyCounter, 1637 mSolverCounterSat, 334 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1516 SdHoareTripleChecker+Valid, 2385 SdHoareTripleChecker+Invalid, 1971 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 334 IncrementalHoareTripleChecker+Valid, 1637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time
[2025-02-06 03:12:01,377 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1516 Valid, 2385 Invalid, 1971 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [334 Valid, 1637 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2025-02-06 03:12:01,377 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 261 states.
[2025-02-06 03:12:01,387 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 132.
[2025-02-06 03:12:01,387 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 132 states, 110 states have (on average 1.2454545454545454) internal successors, (137), 110 states have internal predecessors, (137), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16)
[2025-02-06 03:12:01,388 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 169 transitions.
[2025-02-06 03:12:01,388 INFO  L78                 Accepts]: Start accepts. Automaton has 132 states and 169 transitions. Word has length 122
[2025-02-06 03:12:01,388 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-06 03:12:01,389 INFO  L471      AbstractCegarLoop]: Abstraction has 132 states and 169 transitions.
[2025-02-06 03:12:01,389 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 58 states, 46 states have (on average 3.3260869565217392) internal successors, (153), 48 states have internal predecessors, (153), 15 states have call successors, (48), 6 states have call predecessors, (48), 11 states have return successors, (48), 12 states have call predecessors, (48), 15 states have call successors, (48)
[2025-02-06 03:12:01,389 INFO  L276                IsEmpty]: Start isEmpty. Operand 132 states and 169 transitions.
[2025-02-06 03:12:01,390 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 124
[2025-02-06 03:12:01,390 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-06 03:12:01,390 INFO  L218           NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:12:01,397 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0
[2025-02-06 03:12:01,590 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-06 03:12:01,591 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-06 03:12:01,591 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 03:12:01,592 INFO  L85        PathProgramCache]: Analyzing trace with hash -1530609216, now seen corresponding path program 1 times
[2025-02-06 03:12:01,592 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 03:12:01,592 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430202685]
[2025-02-06 03:12:01,592 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 03:12:01,592 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 03:12:01,608 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes.
[2025-02-06 03:12:01,707 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements.
[2025-02-06 03:12:01,707 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 03:12:01,707 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 03:12:02,869 INFO  L134       CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked.
[2025-02-06 03:12:02,869 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 03:12:02,869 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430202685]
[2025-02-06 03:12:02,870 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430202685] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-06 03:12:02,870 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [739966851]
[2025-02-06 03:12:02,870 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 03:12:02,870 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-06 03:12:02,870 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 03:12:02,872 INFO  L229       MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-02-06 03:12:02,874 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2025-02-06 03:12:02,950 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes.
[2025-02-06 03:12:02,991 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements.
[2025-02-06 03:12:02,991 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 03:12:02,991 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 03:12:02,993 INFO  L256         TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 59 conjuncts are in the unsatisfiable core
[2025-02-06 03:12:02,997 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-06 03:12:03,000 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 9 treesize of output 3
[2025-02-06 03:12:03,134 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 29 treesize of output 13
[2025-02-06 03:12:03,396 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-02-06 03:12:03,396 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 27
[2025-02-06 03:12:03,693 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-02-06 03:12:03,693 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 36
[2025-02-06 03:12:03,872 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-02-06 03:12:03,872 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 34
[2025-02-06 03:12:03,955 INFO  L134       CoverageAnalysis]: Checked inductivity of 480 backedges. 72 proven. 144 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked.
[2025-02-06 03:12:03,955 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-02-06 03:12:04,759 INFO  L134       CoverageAnalysis]: Checked inductivity of 480 backedges. 6 proven. 156 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked.
[2025-02-06 03:12:04,760 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [739966851] provided 0 perfect and 2 imperfect interpolant sequences
[2025-02-06 03:12:04,760 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-02-06 03:12:04,760 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 26, 26] total 58
[2025-02-06 03:12:04,760 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688846101]
[2025-02-06 03:12:04,760 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-02-06 03:12:04,761 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 58 states
[2025-02-06 03:12:04,761 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 03:12:04,761 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants.
[2025-02-06 03:12:04,762 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=450, Invalid=2856, Unknown=0, NotChecked=0, Total=3306
[2025-02-06 03:12:04,762 INFO  L87              Difference]: Start difference. First operand 132 states and 169 transitions. Second operand  has 58 states, 46 states have (on average 3.239130434782609) internal successors, (149), 51 states have internal predecessors, (149), 15 states have call successors, (48), 5 states have call predecessors, (48), 10 states have return successors, (48), 10 states have call predecessors, (48), 15 states have call successors, (48)
[2025-02-06 03:12:07,052 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-06 03:12:07,053 INFO  L93              Difference]: Finished difference Result 213 states and 264 transitions.
[2025-02-06 03:12:07,053 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. 
[2025-02-06 03:12:07,054 INFO  L78                 Accepts]: Start accepts. Automaton has  has 58 states, 46 states have (on average 3.239130434782609) internal successors, (149), 51 states have internal predecessors, (149), 15 states have call successors, (48), 5 states have call predecessors, (48), 10 states have return successors, (48), 10 states have call predecessors, (48), 15 states have call successors, (48) Word has length 123
[2025-02-06 03:12:07,054 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-06 03:12:07,055 INFO  L225             Difference]: With dead ends: 213
[2025-02-06 03:12:07,055 INFO  L226             Difference]: Without dead ends: 211
[2025-02-06 03:12:07,057 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 216 SyntacticMatches, 2 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2780 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1557, Invalid=8343, Unknown=0, NotChecked=0, Total=9900
[2025-02-06 03:12:07,058 INFO  L435           NwaCegarLoop]: 92 mSDtfsCounter, 1222 mSDsluCounter, 1961 mSDsCounter, 0 mSdLazyCounter, 1822 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1224 SdHoareTripleChecker+Valid, 2053 SdHoareTripleChecker+Invalid, 1943 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 1822 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time
[2025-02-06 03:12:07,059 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1224 Valid, 2053 Invalid, 1943 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 1822 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2025-02-06 03:12:07,060 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 211 states.
[2025-02-06 03:12:07,074 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 134.
[2025-02-06 03:12:07,074 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 134 states, 112 states have (on average 1.25) internal successors, (140), 112 states have internal predecessors, (140), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16)
[2025-02-06 03:12:07,074 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 172 transitions.
[2025-02-06 03:12:07,074 INFO  L78                 Accepts]: Start accepts. Automaton has 134 states and 172 transitions. Word has length 123
[2025-02-06 03:12:07,075 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-06 03:12:07,075 INFO  L471      AbstractCegarLoop]: Abstraction has 134 states and 172 transitions.
[2025-02-06 03:12:07,075 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 58 states, 46 states have (on average 3.239130434782609) internal successors, (149), 51 states have internal predecessors, (149), 15 states have call successors, (48), 5 states have call predecessors, (48), 10 states have return successors, (48), 10 states have call predecessors, (48), 15 states have call successors, (48)
[2025-02-06 03:12:07,075 INFO  L276                IsEmpty]: Start isEmpty. Operand 134 states and 172 transitions.
[2025-02-06 03:12:07,076 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 125
[2025-02-06 03:12:07,076 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-06 03:12:07,076 INFO  L218           NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:12:07,085 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-02-06 03:12:07,276 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-06 03:12:07,277 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-06 03:12:07,277 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 03:12:07,277 INFO  L85        PathProgramCache]: Analyzing trace with hash -1807300440, now seen corresponding path program 1 times
[2025-02-06 03:12:07,277 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 03:12:07,277 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411518484]
[2025-02-06 03:12:07,277 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 03:12:07,278 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 03:12:07,299 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes.
[2025-02-06 03:12:07,318 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements.
[2025-02-06 03:12:07,318 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 03:12:07,318 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 03:12:07,512 INFO  L134       CoverageAnalysis]: Checked inductivity of 480 backedges. 15 proven. 30 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked.
[2025-02-06 03:12:07,513 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 03:12:07,513 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411518484]
[2025-02-06 03:12:07,513 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411518484] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-06 03:12:07,513 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1556551561]
[2025-02-06 03:12:07,513 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 03:12:07,513 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-06 03:12:07,513 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 03:12:07,518 INFO  L229       MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-02-06 03:12:07,519 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process
[2025-02-06 03:12:07,616 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes.
[2025-02-06 03:12:07,649 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements.
[2025-02-06 03:12:07,650 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 03:12:07,650 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 03:12:07,652 INFO  L256         TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 13 conjuncts are in the unsatisfiable core
[2025-02-06 03:12:07,655 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-06 03:12:07,775 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 23
[2025-02-06 03:12:07,780 INFO  L134       CoverageAnalysis]: Checked inductivity of 480 backedges. 225 proven. 30 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked.
[2025-02-06 03:12:07,780 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-02-06 03:12:07,976 INFO  L134       CoverageAnalysis]: Checked inductivity of 480 backedges. 15 proven. 30 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked.
[2025-02-06 03:12:07,977 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1556551561] provided 0 perfect and 2 imperfect interpolant sequences
[2025-02-06 03:12:07,977 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-02-06 03:12:07,977 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12
[2025-02-06 03:12:07,977 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196387343]
[2025-02-06 03:12:07,977 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-02-06 03:12:07,978 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2025-02-06 03:12:07,978 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 03:12:07,978 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2025-02-06 03:12:07,979 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132
[2025-02-06 03:12:07,979 INFO  L87              Difference]: Start difference. First operand 134 states and 172 transitions. Second operand  has 12 states, 9 states have (on average 7.444444444444445) internal successors, (67), 12 states have internal predecessors, (67), 6 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (33), 3 states have call predecessors, (33), 6 states have call successors, (33)
[2025-02-06 03:12:08,238 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-06 03:12:08,238 INFO  L93              Difference]: Finished difference Result 273 states and 348 transitions.
[2025-02-06 03:12:08,239 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2025-02-06 03:12:08,239 INFO  L78                 Accepts]: Start accepts. Automaton has  has 12 states, 9 states have (on average 7.444444444444445) internal successors, (67), 12 states have internal predecessors, (67), 6 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (33), 3 states have call predecessors, (33), 6 states have call successors, (33) Word has length 124
[2025-02-06 03:12:08,239 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-06 03:12:08,240 INFO  L225             Difference]: With dead ends: 273
[2025-02-06 03:12:08,240 INFO  L226             Difference]: Without dead ends: 142
[2025-02-06 03:12:08,241 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 244 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462
[2025-02-06 03:12:08,242 INFO  L435           NwaCegarLoop]: 82 mSDtfsCounter, 150 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-02-06 03:12:08,242 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 423 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-02-06 03:12:08,243 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 142 states.
[2025-02-06 03:12:08,256 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 138.
[2025-02-06 03:12:08,257 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 138 states, 115 states have (on average 1.2347826086956522) internal successors, (142), 115 states have internal predecessors, (142), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16)
[2025-02-06 03:12:08,259 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 174 transitions.
[2025-02-06 03:12:08,259 INFO  L78                 Accepts]: Start accepts. Automaton has 138 states and 174 transitions. Word has length 124
[2025-02-06 03:12:08,259 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-06 03:12:08,259 INFO  L471      AbstractCegarLoop]: Abstraction has 138 states and 174 transitions.
[2025-02-06 03:12:08,260 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 12 states, 9 states have (on average 7.444444444444445) internal successors, (67), 12 states have internal predecessors, (67), 6 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (33), 3 states have call predecessors, (33), 6 states have call successors, (33)
[2025-02-06 03:12:08,260 INFO  L276                IsEmpty]: Start isEmpty. Operand 138 states and 174 transitions.
[2025-02-06 03:12:08,264 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 125
[2025-02-06 03:12:08,264 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-06 03:12:08,264 INFO  L218           NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:12:08,272 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-02-06 03:12:08,464 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,SelfDestructingSolverStorable6
[2025-02-06 03:12:08,465 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-06 03:12:08,465 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 03:12:08,465 INFO  L85        PathProgramCache]: Analyzing trace with hash 1805566955, now seen corresponding path program 1 times
[2025-02-06 03:12:08,465 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 03:12:08,465 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333250546]
[2025-02-06 03:12:08,465 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 03:12:08,465 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 03:12:08,481 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes.
[2025-02-06 03:12:08,486 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements.
[2025-02-06 03:12:08,486 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 03:12:08,486 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 03:12:08,545 INFO  L134       CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked.
[2025-02-06 03:12:08,545 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 03:12:08,545 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333250546]
[2025-02-06 03:12:08,545 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333250546] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-06 03:12:08,545 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-06 03:12:08,545 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-06 03:12:08,545 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972785637]
[2025-02-06 03:12:08,545 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-06 03:12:08,547 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-06 03:12:08,547 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 03:12:08,547 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-06 03:12:08,548 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-02-06 03:12:08,548 INFO  L87              Difference]: Start difference. First operand 138 states and 174 transitions. Second operand  has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16)
[2025-02-06 03:12:08,609 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-06 03:12:08,609 INFO  L93              Difference]: Finished difference Result 355 states and 439 transitions.
[2025-02-06 03:12:08,609 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-06 03:12:08,609 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 124
[2025-02-06 03:12:08,610 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-06 03:12:08,611 INFO  L225             Difference]: With dead ends: 355
[2025-02-06 03:12:08,611 INFO  L226             Difference]: Without dead ends: 220
[2025-02-06 03:12:08,611 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2025-02-06 03:12:08,611 INFO  L435           NwaCegarLoop]: 139 mSDtfsCounter, 53 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-02-06 03:12:08,611 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 506 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-06 03:12:08,612 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 220 states.
[2025-02-06 03:12:08,625 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 159.
[2025-02-06 03:12:08,626 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 159 states, 136 states have (on average 1.2205882352941178) internal successors, (166), 136 states have internal predecessors, (166), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16)
[2025-02-06 03:12:08,627 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 198 transitions.
[2025-02-06 03:12:08,628 INFO  L78                 Accepts]: Start accepts. Automaton has 159 states and 198 transitions. Word has length 124
[2025-02-06 03:12:08,628 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-06 03:12:08,628 INFO  L471      AbstractCegarLoop]: Abstraction has 159 states and 198 transitions.
[2025-02-06 03:12:08,628 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16)
[2025-02-06 03:12:08,628 INFO  L276                IsEmpty]: Start isEmpty. Operand 159 states and 198 transitions.
[2025-02-06 03:12:08,630 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 126
[2025-02-06 03:12:08,630 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-06 03:12:08,630 INFO  L218           NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:12:08,630 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-02-06 03:12:08,630 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-06 03:12:08,630 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 03:12:08,630 INFO  L85        PathProgramCache]: Analyzing trace with hash -821114822, now seen corresponding path program 1 times
[2025-02-06 03:12:08,631 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 03:12:08,631 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645237743]
[2025-02-06 03:12:08,631 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 03:12:08,631 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 03:12:08,642 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes.
[2025-02-06 03:12:08,669 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements.
[2025-02-06 03:12:08,669 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 03:12:08,669 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 03:12:08,932 INFO  L134       CoverageAnalysis]: Checked inductivity of 480 backedges. 15 proven. 30 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked.
[2025-02-06 03:12:08,933 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 03:12:08,933 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645237743]
[2025-02-06 03:12:08,933 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645237743] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-06 03:12:08,933 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [649333919]
[2025-02-06 03:12:08,933 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 03:12:08,934 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-06 03:12:08,934 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 03:12:08,935 INFO  L229       MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-02-06 03:12:08,941 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process
[2025-02-06 03:12:09,009 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes.
[2025-02-06 03:12:09,043 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements.
[2025-02-06 03:12:09,043 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 03:12:09,043 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 03:12:09,045 INFO  L256         TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 13 conjuncts are in the unsatisfiable core
[2025-02-06 03:12:09,047 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-06 03:12:09,181 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-02-06 03:12:09,181 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 31
[2025-02-06 03:12:09,236 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-02-06 03:12:09,236 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 26
[2025-02-06 03:12:09,239 INFO  L134       CoverageAnalysis]: Checked inductivity of 480 backedges. 225 proven. 30 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked.
[2025-02-06 03:12:09,239 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-02-06 03:12:09,405 INFO  L134       CoverageAnalysis]: Checked inductivity of 480 backedges. 15 proven. 30 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked.
[2025-02-06 03:12:09,405 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [649333919] provided 0 perfect and 2 imperfect interpolant sequences
[2025-02-06 03:12:09,405 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-02-06 03:12:09,405 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 13
[2025-02-06 03:12:09,406 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648689322]
[2025-02-06 03:12:09,406 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-02-06 03:12:09,406 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 13 states
[2025-02-06 03:12:09,406 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 03:12:09,406 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2025-02-06 03:12:09,406 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156
[2025-02-06 03:12:09,407 INFO  L87              Difference]: Start difference. First operand 159 states and 198 transitions. Second operand  has 13 states, 10 states have (on average 8.1) internal successors, (81), 13 states have internal predecessors, (81), 6 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (33), 3 states have call predecessors, (33), 6 states have call successors, (33)
[2025-02-06 03:12:09,744 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-06 03:12:09,744 INFO  L93              Difference]: Finished difference Result 367 states and 455 transitions.
[2025-02-06 03:12:09,747 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 
[2025-02-06 03:12:09,748 INFO  L78                 Accepts]: Start accepts. Automaton has  has 13 states, 10 states have (on average 8.1) internal successors, (81), 13 states have internal predecessors, (81), 6 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (33), 3 states have call predecessors, (33), 6 states have call successors, (33) Word has length 125
[2025-02-06 03:12:09,748 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-06 03:12:09,749 INFO  L225             Difference]: With dead ends: 367
[2025-02-06 03:12:09,749 INFO  L226             Difference]: Without dead ends: 211
[2025-02-06 03:12:09,749 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 247 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=146, Invalid=454, Unknown=0, NotChecked=0, Total=600
[2025-02-06 03:12:09,750 INFO  L435           NwaCegarLoop]: 84 mSDtfsCounter, 391 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-02-06 03:12:09,750 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [391 Valid, 494 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-02-06 03:12:09,750 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 211 states.
[2025-02-06 03:12:09,763 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 159.
[2025-02-06 03:12:09,764 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 159 states, 136 states have (on average 1.213235294117647) internal successors, (165), 136 states have internal predecessors, (165), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16)
[2025-02-06 03:12:09,764 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 197 transitions.
[2025-02-06 03:12:09,765 INFO  L78                 Accepts]: Start accepts. Automaton has 159 states and 197 transitions. Word has length 125
[2025-02-06 03:12:09,765 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-06 03:12:09,765 INFO  L471      AbstractCegarLoop]: Abstraction has 159 states and 197 transitions.
[2025-02-06 03:12:09,766 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 13 states, 10 states have (on average 8.1) internal successors, (81), 13 states have internal predecessors, (81), 6 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (33), 3 states have call predecessors, (33), 6 states have call successors, (33)
[2025-02-06 03:12:09,766 INFO  L276                IsEmpty]: Start isEmpty. Operand 159 states and 197 transitions.
[2025-02-06 03:12:09,766 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 127
[2025-02-06 03:12:09,766 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-06 03:12:09,766 INFO  L218           NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:12:09,775 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0
[2025-02-06 03:12:09,971 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-06 03:12:09,971 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-06 03:12:09,971 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 03:12:09,971 INFO  L85        PathProgramCache]: Analyzing trace with hash 2035570058, now seen corresponding path program 1 times
[2025-02-06 03:12:09,971 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 03:12:09,971 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815886462]
[2025-02-06 03:12:09,971 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 03:12:09,971 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 03:12:09,984 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes.
[2025-02-06 03:12:10,015 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements.
[2025-02-06 03:12:10,016 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 03:12:10,016 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unknown
[2025-02-06 03:12:10,019 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [14348659]
[2025-02-06 03:12:10,020 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 03:12:10,020 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-06 03:12:10,020 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 03:12:10,024 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-02-06 03:12:10,026 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-02-06 03:12:10,120 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes.
[2025-02-06 03:12:10,164 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements.
[2025-02-06 03:12:10,165 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 03:12:10,165 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 03:12:10,169 INFO  L256         TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 18 conjuncts are in the unsatisfiable core
[2025-02-06 03:12:10,174 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-06 03:12:10,331 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11
[2025-02-06 03:12:10,364 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11
[2025-02-06 03:12:10,396 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11
[2025-02-06 03:12:10,448 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-02-06 03:12:10,448 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7
[2025-02-06 03:12:10,453 INFO  L134       CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked.
[2025-02-06 03:12:10,453 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-02-06 03:12:10,453 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 03:12:10,453 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815886462]
[2025-02-06 03:12:10,454 WARN  L311   FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2025-02-06 03:12:10,454 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [14348659]
[2025-02-06 03:12:10,454 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [14348659] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-06 03:12:10,454 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-06 03:12:10,455 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-06 03:12:10,455 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063541281]
[2025-02-06 03:12:10,455 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-06 03:12:10,455 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-06 03:12:10,455 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 03:12:10,456 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-06 03:12:10,456 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-02-06 03:12:10,456 INFO  L87              Difference]: Start difference. First operand 159 states and 197 transitions. Second operand  has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16)
[2025-02-06 03:12:10,553 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-06 03:12:10,553 INFO  L93              Difference]: Finished difference Result 417 states and 513 transitions.
[2025-02-06 03:12:10,553 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-06 03:12:10,553 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 126
[2025-02-06 03:12:10,554 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-06 03:12:10,556 INFO  L225             Difference]: With dead ends: 417
[2025-02-06 03:12:10,556 INFO  L226             Difference]: Without dead ends: 261
[2025-02-06 03:12:10,556 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 122 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-02-06 03:12:10,557 INFO  L435           NwaCegarLoop]: 97 mSDtfsCounter, 51 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-02-06 03:12:10,557 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 279 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-02-06 03:12:10,557 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 261 states.
[2025-02-06 03:12:10,577 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 249.
[2025-02-06 03:12:10,577 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 249 states, 204 states have (on average 1.1715686274509804) internal successors, (239), 204 states have internal predecessors, (239), 32 states have call successors, (32), 12 states have call predecessors, (32), 12 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32)
[2025-02-06 03:12:10,578 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 303 transitions.
[2025-02-06 03:12:10,579 INFO  L78                 Accepts]: Start accepts. Automaton has 249 states and 303 transitions. Word has length 126
[2025-02-06 03:12:10,579 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-06 03:12:10,579 INFO  L471      AbstractCegarLoop]: Abstraction has 249 states and 303 transitions.
[2025-02-06 03:12:10,579 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16)
[2025-02-06 03:12:10,579 INFO  L276                IsEmpty]: Start isEmpty. Operand 249 states and 303 transitions.
[2025-02-06 03:12:10,580 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 128
[2025-02-06 03:12:10,580 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-06 03:12:10,580 INFO  L218           NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:12:10,587 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-02-06 03:12:10,784 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-06 03:12:10,784 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-06 03:12:10,785 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 03:12:10,785 INFO  L85        PathProgramCache]: Analyzing trace with hash -1208991588, now seen corresponding path program 1 times
[2025-02-06 03:12:10,785 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 03:12:10,785 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123875115]
[2025-02-06 03:12:10,785 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 03:12:10,785 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 03:12:10,795 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes.
[2025-02-06 03:12:10,824 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements.
[2025-02-06 03:12:10,824 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 03:12:10,824 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unknown
[2025-02-06 03:12:10,826 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [282347185]
[2025-02-06 03:12:10,826 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 03:12:10,826 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-06 03:12:10,826 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 03:12:10,828 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-02-06 03:12:10,830 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-02-06 03:12:10,904 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes.
[2025-02-06 03:12:10,945 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements.
[2025-02-06 03:12:10,946 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 03:12:10,946 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 03:12:10,947 INFO  L256         TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 19 conjuncts are in the unsatisfiable core
[2025-02-06 03:12:10,950 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-06 03:12:11,030 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13
[2025-02-06 03:12:11,045 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13
[2025-02-06 03:12:11,063 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13
[2025-02-06 03:12:11,106 INFO  L134       CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked.
[2025-02-06 03:12:11,106 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-02-06 03:12:11,106 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 03:12:11,106 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123875115]
[2025-02-06 03:12:11,106 WARN  L311   FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2025-02-06 03:12:11,106 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [282347185]
[2025-02-06 03:12:11,107 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [282347185] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-06 03:12:11,107 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-06 03:12:11,107 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-06 03:12:11,107 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909322657]
[2025-02-06 03:12:11,107 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-06 03:12:11,107 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-06 03:12:11,107 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 03:12:11,107 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-06 03:12:11,107 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-06 03:12:11,107 INFO  L87              Difference]: Start difference. First operand 249 states and 303 transitions. Second operand  has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16)
[2025-02-06 03:12:11,196 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-06 03:12:11,197 INFO  L93              Difference]: Finished difference Result 493 states and 603 transitions.
[2025-02-06 03:12:11,197 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-06 03:12:11,197 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 127
[2025-02-06 03:12:11,198 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-06 03:12:11,199 INFO  L225             Difference]: With dead ends: 493
[2025-02-06 03:12:11,199 INFO  L226             Difference]: Without dead ends: 247
[2025-02-06 03:12:11,199 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 124 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-02-06 03:12:11,200 INFO  L435           NwaCegarLoop]: 97 mSDtfsCounter, 22 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-02-06 03:12:11,200 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 277 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-02-06 03:12:11,200 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 247 states.
[2025-02-06 03:12:11,215 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 240.
[2025-02-06 03:12:11,215 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 240 states, 195 states have (on average 1.1641025641025642) internal successors, (227), 195 states have internal predecessors, (227), 32 states have call successors, (32), 12 states have call predecessors, (32), 12 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32)
[2025-02-06 03:12:11,216 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 291 transitions.
[2025-02-06 03:12:11,216 INFO  L78                 Accepts]: Start accepts. Automaton has 240 states and 291 transitions. Word has length 127
[2025-02-06 03:12:11,217 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-06 03:12:11,217 INFO  L471      AbstractCegarLoop]: Abstraction has 240 states and 291 transitions.
[2025-02-06 03:12:11,217 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16)
[2025-02-06 03:12:11,217 INFO  L276                IsEmpty]: Start isEmpty. Operand 240 states and 291 transitions.
[2025-02-06 03:12:11,218 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 130
[2025-02-06 03:12:11,218 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-06 03:12:11,218 INFO  L218           NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:12:11,225 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-02-06 03:12:11,418 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-06 03:12:11,418 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-06 03:12:11,419 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 03:12:11,419 INFO  L85        PathProgramCache]: Analyzing trace with hash 893535468, now seen corresponding path program 1 times
[2025-02-06 03:12:11,419 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 03:12:11,419 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51061284]
[2025-02-06 03:12:11,419 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 03:12:11,419 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 03:12:11,428 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes.
[2025-02-06 03:12:11,456 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements.
[2025-02-06 03:12:11,457 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 03:12:11,457 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 03:12:12,018 INFO  L134       CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked.
[2025-02-06 03:12:12,018 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 03:12:12,018 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51061284]
[2025-02-06 03:12:12,018 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51061284] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-06 03:12:12,018 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-06 03:12:12,019 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17
[2025-02-06 03:12:12,019 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306469741]
[2025-02-06 03:12:12,019 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-06 03:12:12,019 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 17 states
[2025-02-06 03:12:12,019 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 03:12:12,019 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants.
[2025-02-06 03:12:12,019 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272
[2025-02-06 03:12:12,020 INFO  L87              Difference]: Start difference. First operand 240 states and 291 transitions. Second operand  has 17 states, 15 states have (on average 3.466666666666667) internal successors, (52), 17 states have internal predecessors, (52), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16)
[2025-02-06 03:12:12,611 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-06 03:12:12,612 INFO  L93              Difference]: Finished difference Result 526 states and 643 transitions.
[2025-02-06 03:12:12,612 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. 
[2025-02-06 03:12:12,612 INFO  L78                 Accepts]: Start accepts. Automaton has  has 17 states, 15 states have (on average 3.466666666666667) internal successors, (52), 17 states have internal predecessors, (52), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16) Word has length 129
[2025-02-06 03:12:12,613 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-06 03:12:12,614 INFO  L225             Difference]: With dead ends: 526
[2025-02-06 03:12:12,614 INFO  L226             Difference]: Without dead ends: 370
[2025-02-06 03:12:12,615 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=489, Unknown=0, NotChecked=0, Total=552
[2025-02-06 03:12:12,615 INFO  L435           NwaCegarLoop]: 150 mSDtfsCounter, 89 mSDsluCounter, 1616 mSDsCounter, 0 mSdLazyCounter, 912 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 1766 SdHoareTripleChecker+Invalid, 914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 912 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-02-06 03:12:12,615 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 1766 Invalid, 914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 912 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-02-06 03:12:12,616 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 370 states.
[2025-02-06 03:12:12,638 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 361.
[2025-02-06 03:12:12,638 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 361 states, 298 states have (on average 1.1778523489932886) internal successors, (351), 299 states have internal predecessors, (351), 44 states have call successors, (44), 18 states have call predecessors, (44), 18 states have return successors, (44), 43 states have call predecessors, (44), 44 states have call successors, (44)
[2025-02-06 03:12:12,639 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 439 transitions.
[2025-02-06 03:12:12,639 INFO  L78                 Accepts]: Start accepts. Automaton has 361 states and 439 transitions. Word has length 129
[2025-02-06 03:12:12,640 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-06 03:12:12,640 INFO  L471      AbstractCegarLoop]: Abstraction has 361 states and 439 transitions.
[2025-02-06 03:12:12,640 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 17 states, 15 states have (on average 3.466666666666667) internal successors, (52), 17 states have internal predecessors, (52), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16)
[2025-02-06 03:12:12,640 INFO  L276                IsEmpty]: Start isEmpty. Operand 361 states and 439 transitions.
[2025-02-06 03:12:12,640 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 130
[2025-02-06 03:12:12,641 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-06 03:12:12,641 INFO  L218           NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:12:12,641 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2025-02-06 03:12:12,641 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-06 03:12:12,641 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 03:12:12,641 INFO  L85        PathProgramCache]: Analyzing trace with hash 697021963, now seen corresponding path program 1 times
[2025-02-06 03:12:12,641 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 03:12:12,641 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861559975]
[2025-02-06 03:12:12,641 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 03:12:12,642 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 03:12:12,653 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes.
[2025-02-06 03:12:12,675 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements.
[2025-02-06 03:12:12,675 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 03:12:12,675 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 03:12:12,966 INFO  L134       CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked.
[2025-02-06 03:12:12,966 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 03:12:12,966 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861559975]
[2025-02-06 03:12:12,966 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861559975] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-06 03:12:12,966 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-06 03:12:12,966 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-02-06 03:12:12,966 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628059760]
[2025-02-06 03:12:12,966 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-06 03:12:12,967 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-02-06 03:12:12,967 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 03:12:12,967 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-02-06 03:12:12,967 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2025-02-06 03:12:12,968 INFO  L87              Difference]: Start difference. First operand 361 states and 439 transitions. Second operand  has 7 states, 6 states have (on average 8.666666666666666) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16)
[2025-02-06 03:12:13,179 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-06 03:12:13,180 INFO  L93              Difference]: Finished difference Result 814 states and 992 transitions.
[2025-02-06 03:12:13,180 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-02-06 03:12:13,180 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 6 states have (on average 8.666666666666666) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 129
[2025-02-06 03:12:13,180 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-06 03:12:13,183 INFO  L225             Difference]: With dead ends: 814
[2025-02-06 03:12:13,183 INFO  L226             Difference]: Without dead ends: 537
[2025-02-06 03:12:13,185 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2025-02-06 03:12:13,186 INFO  L435           NwaCegarLoop]: 160 mSDtfsCounter, 63 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 736 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-02-06 03:12:13,187 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 736 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-02-06 03:12:13,187 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 537 states.
[2025-02-06 03:12:13,245 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 533.
[2025-02-06 03:12:13,246 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 533 states, 438 states have (on average 1.1757990867579908) internal successors, (515), 441 states have internal predecessors, (515), 64 states have call successors, (64), 30 states have call predecessors, (64), 30 states have return successors, (64), 61 states have call predecessors, (64), 64 states have call successors, (64)
[2025-02-06 03:12:13,251 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 643 transitions.
[2025-02-06 03:12:13,252 INFO  L78                 Accepts]: Start accepts. Automaton has 533 states and 643 transitions. Word has length 129
[2025-02-06 03:12:13,252 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-06 03:12:13,252 INFO  L471      AbstractCegarLoop]: Abstraction has 533 states and 643 transitions.
[2025-02-06 03:12:13,252 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 6 states have (on average 8.666666666666666) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16)
[2025-02-06 03:12:13,252 INFO  L276                IsEmpty]: Start isEmpty. Operand 533 states and 643 transitions.
[2025-02-06 03:12:13,253 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 130
[2025-02-06 03:12:13,253 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-06 03:12:13,253 INFO  L218           NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:12:13,253 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2025-02-06 03:12:13,253 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-06 03:12:13,253 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 03:12:13,253 INFO  L85        PathProgramCache]: Analyzing trace with hash -1425239952, now seen corresponding path program 1 times
[2025-02-06 03:12:13,253 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 03:12:13,253 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116087195]
[2025-02-06 03:12:13,253 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 03:12:13,253 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 03:12:13,266 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes.
[2025-02-06 03:12:13,297 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements.
[2025-02-06 03:12:13,297 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 03:12:13,297 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 03:12:13,811 INFO  L134       CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked.
[2025-02-06 03:12:13,811 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 03:12:13,811 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116087195]
[2025-02-06 03:12:13,811 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116087195] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-06 03:12:13,812 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-06 03:12:13,812 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2025-02-06 03:12:13,812 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919179932]
[2025-02-06 03:12:13,812 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-06 03:12:13,812 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2025-02-06 03:12:13,812 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 03:12:13,812 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2025-02-06 03:12:13,813 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110
[2025-02-06 03:12:13,813 INFO  L87              Difference]: Start difference. First operand 533 states and 643 transitions. Second operand  has 11 states, 8 states have (on average 6.5) internal successors, (52), 11 states have internal predecessors, (52), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 4 states have call successors, (16)
[2025-02-06 03:12:14,369 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-06 03:12:14,369 INFO  L93              Difference]: Finished difference Result 1381 states and 1669 transitions.
[2025-02-06 03:12:14,369 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2025-02-06 03:12:14,370 INFO  L78                 Accepts]: Start accepts. Automaton has  has 11 states, 8 states have (on average 6.5) internal successors, (52), 11 states have internal predecessors, (52), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 4 states have call successors, (16) Word has length 129
[2025-02-06 03:12:14,370 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-06 03:12:14,373 INFO  L225             Difference]: With dead ends: 1381
[2025-02-06 03:12:14,373 INFO  L226             Difference]: Without dead ends: 932
[2025-02-06 03:12:14,374 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156
[2025-02-06 03:12:14,375 INFO  L435           NwaCegarLoop]: 156 mSDtfsCounter, 85 mSDsluCounter, 999 mSDsCounter, 0 mSdLazyCounter, 613 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 1155 SdHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-02-06 03:12:14,375 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 1155 Invalid, 614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 613 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-02-06 03:12:14,375 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 932 states.
[2025-02-06 03:12:14,417 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 932 to 597.
[2025-02-06 03:12:14,419 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 597 states, 502 states have (on average 1.1932270916334662) internal successors, (599), 505 states have internal predecessors, (599), 64 states have call successors, (64), 30 states have call predecessors, (64), 30 states have return successors, (64), 61 states have call predecessors, (64), 64 states have call successors, (64)
[2025-02-06 03:12:14,424 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 727 transitions.
[2025-02-06 03:12:14,425 INFO  L78                 Accepts]: Start accepts. Automaton has 597 states and 727 transitions. Word has length 129
[2025-02-06 03:12:14,425 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-06 03:12:14,426 INFO  L471      AbstractCegarLoop]: Abstraction has 597 states and 727 transitions.
[2025-02-06 03:12:14,426 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 8 states have (on average 6.5) internal successors, (52), 11 states have internal predecessors, (52), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 4 states have call successors, (16)
[2025-02-06 03:12:14,426 INFO  L276                IsEmpty]: Start isEmpty. Operand 597 states and 727 transitions.
[2025-02-06 03:12:14,427 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 130
[2025-02-06 03:12:14,427 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-06 03:12:14,427 INFO  L218           NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:12:14,427 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2025-02-06 03:12:14,430 INFO  L396      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-06 03:12:14,430 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 03:12:14,430 INFO  L85        PathProgramCache]: Analyzing trace with hash 826104682, now seen corresponding path program 1 times
[2025-02-06 03:12:14,430 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 03:12:14,430 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68390128]
[2025-02-06 03:12:14,430 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 03:12:14,430 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 03:12:14,440 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes.
[2025-02-06 03:12:14,456 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements.
[2025-02-06 03:12:14,456 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 03:12:14,456 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 03:12:14,850 INFO  L134       CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked.
[2025-02-06 03:12:14,850 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 03:12:14,850 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68390128]
[2025-02-06 03:12:14,850 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68390128] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-06 03:12:14,850 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-06 03:12:14,851 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-02-06 03:12:14,851 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893816644]
[2025-02-06 03:12:14,851 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-06 03:12:14,851 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-02-06 03:12:14,851 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 03:12:14,851 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-02-06 03:12:14,851 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56
[2025-02-06 03:12:14,852 INFO  L87              Difference]: Start difference. First operand 597 states and 727 transitions. Second operand  has 8 states, 6 states have (on average 8.666666666666666) internal successors, (52), 8 states have internal predecessors, (52), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16)
[2025-02-06 03:12:15,287 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-06 03:12:15,288 INFO  L93              Difference]: Finished difference Result 1442 states and 1740 transitions.
[2025-02-06 03:12:15,289 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-02-06 03:12:15,289 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 6 states have (on average 8.666666666666666) internal successors, (52), 8 states have internal predecessors, (52), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16) Word has length 129
[2025-02-06 03:12:15,289 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-06 03:12:15,292 INFO  L225             Difference]: With dead ends: 1442
[2025-02-06 03:12:15,292 INFO  L226             Difference]: Without dead ends: 929
[2025-02-06 03:12:15,293 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2025-02-06 03:12:15,293 INFO  L435           NwaCegarLoop]: 152 mSDtfsCounter, 79 mSDsluCounter, 677 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 829 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-02-06 03:12:15,293 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 829 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-02-06 03:12:15,294 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 929 states.
[2025-02-06 03:12:15,342 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 625.
[2025-02-06 03:12:15,343 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 625 states, 530 states have (on average 1.179245283018868) internal successors, (625), 533 states have internal predecessors, (625), 64 states have call successors, (64), 30 states have call predecessors, (64), 30 states have return successors, (64), 61 states have call predecessors, (64), 64 states have call successors, (64)
[2025-02-06 03:12:15,344 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 753 transitions.
[2025-02-06 03:12:15,345 INFO  L78                 Accepts]: Start accepts. Automaton has 625 states and 753 transitions. Word has length 129
[2025-02-06 03:12:15,345 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-06 03:12:15,345 INFO  L471      AbstractCegarLoop]: Abstraction has 625 states and 753 transitions.
[2025-02-06 03:12:15,346 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 6 states have (on average 8.666666666666666) internal successors, (52), 8 states have internal predecessors, (52), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16)
[2025-02-06 03:12:15,346 INFO  L276                IsEmpty]: Start isEmpty. Operand 625 states and 753 transitions.
[2025-02-06 03:12:15,348 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 130
[2025-02-06 03:12:15,348 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-06 03:12:15,348 INFO  L218           NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:12:15,348 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2025-02-06 03:12:15,348 INFO  L396      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-06 03:12:15,349 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 03:12:15,349 INFO  L85        PathProgramCache]: Analyzing trace with hash 826528715, now seen corresponding path program 1 times
[2025-02-06 03:12:15,349 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 03:12:15,349 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885475583]
[2025-02-06 03:12:15,349 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 03:12:15,349 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 03:12:15,359 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes.
[2025-02-06 03:12:15,376 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements.
[2025-02-06 03:12:15,377 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 03:12:15,377 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 03:12:15,472 INFO  L134       CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked.
[2025-02-06 03:12:15,472 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 03:12:15,472 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885475583]
[2025-02-06 03:12:15,472 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885475583] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-06 03:12:15,472 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-06 03:12:15,472 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-06 03:12:15,472 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960572296]
[2025-02-06 03:12:15,472 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-06 03:12:15,473 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-06 03:12:15,473 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 03:12:15,473 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-06 03:12:15,473 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-02-06 03:12:15,474 INFO  L87              Difference]: Start difference. First operand 625 states and 753 transitions. Second operand  has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16)
[2025-02-06 03:12:15,657 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-06 03:12:15,657 INFO  L93              Difference]: Finished difference Result 1297 states and 1560 transitions.
[2025-02-06 03:12:15,659 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-06 03:12:15,659 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 129
[2025-02-06 03:12:15,659 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-06 03:12:15,661 INFO  L225             Difference]: With dead ends: 1297
[2025-02-06 03:12:15,661 INFO  L226             Difference]: Without dead ends: 756
[2025-02-06 03:12:15,662 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2025-02-06 03:12:15,663 INFO  L435           NwaCegarLoop]: 156 mSDtfsCounter, 89 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-02-06 03:12:15,664 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 515 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-02-06 03:12:15,665 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 756 states.
[2025-02-06 03:12:15,719 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 594.
[2025-02-06 03:12:15,720 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 594 states, 499 states have (on average 1.1783567134268538) internal successors, (588), 502 states have internal predecessors, (588), 64 states have call successors, (64), 30 states have call predecessors, (64), 30 states have return successors, (64), 61 states have call predecessors, (64), 64 states have call successors, (64)
[2025-02-06 03:12:15,722 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 716 transitions.
[2025-02-06 03:12:15,722 INFO  L78                 Accepts]: Start accepts. Automaton has 594 states and 716 transitions. Word has length 129
[2025-02-06 03:12:15,723 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-06 03:12:15,723 INFO  L471      AbstractCegarLoop]: Abstraction has 594 states and 716 transitions.
[2025-02-06 03:12:15,723 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16)
[2025-02-06 03:12:15,723 INFO  L276                IsEmpty]: Start isEmpty. Operand 594 states and 716 transitions.
[2025-02-06 03:12:15,724 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 130
[2025-02-06 03:12:15,724 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-06 03:12:15,724 INFO  L218           NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:12:15,724 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2025-02-06 03:12:15,724 INFO  L396      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-06 03:12:15,725 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 03:12:15,725 INFO  L85        PathProgramCache]: Analyzing trace with hash 1590696304, now seen corresponding path program 1 times
[2025-02-06 03:12:15,725 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 03:12:15,725 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560291762]
[2025-02-06 03:12:15,725 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 03:12:15,726 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 03:12:15,738 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes.
[2025-02-06 03:12:15,771 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements.
[2025-02-06 03:12:15,771 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 03:12:15,771 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 03:12:16,400 INFO  L134       CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked.
[2025-02-06 03:12:16,400 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 03:12:16,400 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560291762]
[2025-02-06 03:12:16,400 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560291762] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-06 03:12:16,400 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-06 03:12:16,401 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2025-02-06 03:12:16,401 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507216194]
[2025-02-06 03:12:16,401 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-06 03:12:16,401 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2025-02-06 03:12:16,401 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 03:12:16,401 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2025-02-06 03:12:16,401 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110
[2025-02-06 03:12:16,401 INFO  L87              Difference]: Start difference. First operand 594 states and 716 transitions. Second operand  has 11 states, 8 states have (on average 6.5) internal successors, (52), 11 states have internal predecessors, (52), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 4 states have call successors, (16)
[2025-02-06 03:12:16,978 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-06 03:12:16,978 INFO  L93              Difference]: Finished difference Result 1243 states and 1496 transitions.
[2025-02-06 03:12:16,978 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2025-02-06 03:12:16,978 INFO  L78                 Accepts]: Start accepts. Automaton has  has 11 states, 8 states have (on average 6.5) internal successors, (52), 11 states have internal predecessors, (52), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 4 states have call successors, (16) Word has length 129
[2025-02-06 03:12:16,979 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-06 03:12:16,981 INFO  L225             Difference]: With dead ends: 1243
[2025-02-06 03:12:16,981 INFO  L226             Difference]: Without dead ends: 733
[2025-02-06 03:12:16,982 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182
[2025-02-06 03:12:16,982 INFO  L435           NwaCegarLoop]: 134 mSDtfsCounter, 79 mSDsluCounter, 814 mSDsCounter, 0 mSdLazyCounter, 588 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 948 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-02-06 03:12:16,983 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 948 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 588 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-02-06 03:12:16,984 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 733 states.
[2025-02-06 03:12:17,041 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 729.
[2025-02-06 03:12:17,042 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 729 states, 597 states have (on average 1.1658291457286432) internal successors, (696), 602 states have internal predecessors, (696), 88 states have call successors, (88), 43 states have call predecessors, (88), 43 states have return successors, (88), 83 states have call predecessors, (88), 88 states have call successors, (88)
[2025-02-06 03:12:17,044 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 729 states and 872 transitions.
[2025-02-06 03:12:17,044 INFO  L78                 Accepts]: Start accepts. Automaton has 729 states and 872 transitions. Word has length 129
[2025-02-06 03:12:17,045 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-06 03:12:17,045 INFO  L471      AbstractCegarLoop]: Abstraction has 729 states and 872 transitions.
[2025-02-06 03:12:17,045 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 8 states have (on average 6.5) internal successors, (52), 11 states have internal predecessors, (52), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 4 states have call successors, (16)
[2025-02-06 03:12:17,046 INFO  L276                IsEmpty]: Start isEmpty. Operand 729 states and 872 transitions.
[2025-02-06 03:12:17,046 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 130
[2025-02-06 03:12:17,047 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-06 03:12:17,047 INFO  L218           NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:12:17,047 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2025-02-06 03:12:17,047 INFO  L396      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-06 03:12:17,047 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 03:12:17,047 INFO  L85        PathProgramCache]: Analyzing trace with hash -728079116, now seen corresponding path program 1 times
[2025-02-06 03:12:17,048 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 03:12:17,048 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046826764]
[2025-02-06 03:12:17,048 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 03:12:17,048 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 03:12:17,058 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes.
[2025-02-06 03:12:17,088 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements.
[2025-02-06 03:12:17,089 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 03:12:17,089 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 03:12:18,235 INFO  L134       CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked.
[2025-02-06 03:12:18,236 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 03:12:18,236 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046826764]
[2025-02-06 03:12:18,236 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046826764] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-06 03:12:18,236 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-06 03:12:18,236 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21
[2025-02-06 03:12:18,236 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116507781]
[2025-02-06 03:12:18,236 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-06 03:12:18,236 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 21 states
[2025-02-06 03:12:18,236 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 03:12:18,237 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants.
[2025-02-06 03:12:18,237 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=378, Unknown=0, NotChecked=0, Total=420
[2025-02-06 03:12:18,237 INFO  L87              Difference]: Start difference. First operand 729 states and 872 transitions. Second operand  has 21 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 21 states have internal predecessors, (52), 5 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 5 states have call successors, (16)
[2025-02-06 03:12:20,242 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-06 03:12:20,242 INFO  L93              Difference]: Finished difference Result 1555 states and 1853 transitions.
[2025-02-06 03:12:20,243 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. 
[2025-02-06 03:12:20,243 INFO  L78                 Accepts]: Start accepts. Automaton has  has 21 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 21 states have internal predecessors, (52), 5 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 5 states have call successors, (16) Word has length 129
[2025-02-06 03:12:20,243 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-06 03:12:20,246 INFO  L225             Difference]: With dead ends: 1555
[2025-02-06 03:12:20,247 INFO  L226             Difference]: Without dead ends: 959
[2025-02-06 03:12:20,248 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=139, Invalid=1267, Unknown=0, NotChecked=0, Total=1406
[2025-02-06 03:12:20,248 INFO  L435           NwaCegarLoop]: 172 mSDtfsCounter, 165 mSDsluCounter, 2159 mSDsCounter, 0 mSdLazyCounter, 1787 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 2331 SdHoareTripleChecker+Invalid, 1818 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1787 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time
[2025-02-06 03:12:20,248 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 2331 Invalid, 1818 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1787 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time]
[2025-02-06 03:12:20,249 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 959 states.
[2025-02-06 03:12:20,316 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 766.
[2025-02-06 03:12:20,317 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 766 states, 634 states have (on average 1.167192429022082) internal successors, (740), 639 states have internal predecessors, (740), 88 states have call successors, (88), 43 states have call predecessors, (88), 43 states have return successors, (88), 83 states have call predecessors, (88), 88 states have call successors, (88)
[2025-02-06 03:12:20,318 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 766 states to 766 states and 916 transitions.
[2025-02-06 03:12:20,319 INFO  L78                 Accepts]: Start accepts. Automaton has 766 states and 916 transitions. Word has length 129
[2025-02-06 03:12:20,319 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-06 03:12:20,319 INFO  L471      AbstractCegarLoop]: Abstraction has 766 states and 916 transitions.
[2025-02-06 03:12:20,319 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 21 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 21 states have internal predecessors, (52), 5 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 5 states have call successors, (16)
[2025-02-06 03:12:20,320 INFO  L276                IsEmpty]: Start isEmpty. Operand 766 states and 916 transitions.
[2025-02-06 03:12:20,320 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 130
[2025-02-06 03:12:20,320 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-06 03:12:20,321 INFO  L218           NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:12:20,321 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2025-02-06 03:12:20,321 INFO  L396      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-06 03:12:20,321 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 03:12:20,321 INFO  L85        PathProgramCache]: Analyzing trace with hash -924592621, now seen corresponding path program 1 times
[2025-02-06 03:12:20,321 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 03:12:20,321 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111484245]
[2025-02-06 03:12:20,321 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 03:12:20,321 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 03:12:20,330 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes.
[2025-02-06 03:12:20,342 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements.
[2025-02-06 03:12:20,342 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 03:12:20,342 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 03:12:20,646 INFO  L134       CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked.
[2025-02-06 03:12:20,646 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 03:12:20,646 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111484245]
[2025-02-06 03:12:20,646 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111484245] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-06 03:12:20,646 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-06 03:12:20,646 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-02-06 03:12:20,647 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523076470]
[2025-02-06 03:12:20,647 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-06 03:12:20,647 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-02-06 03:12:20,647 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 03:12:20,647 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-02-06 03:12:20,649 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2025-02-06 03:12:20,649 INFO  L87              Difference]: Start difference. First operand 766 states and 916 transitions. Second operand  has 7 states, 6 states have (on average 8.666666666666666) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16)
[2025-02-06 03:12:20,915 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-06 03:12:20,915 INFO  L93              Difference]: Finished difference Result 1474 states and 1764 transitions.
[2025-02-06 03:12:20,915 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-02-06 03:12:20,915 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 6 states have (on average 8.666666666666666) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 129
[2025-02-06 03:12:20,916 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-06 03:12:20,918 INFO  L225             Difference]: With dead ends: 1474
[2025-02-06 03:12:20,918 INFO  L226             Difference]: Without dead ends: 841
[2025-02-06 03:12:20,919 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2025-02-06 03:12:20,920 INFO  L435           NwaCegarLoop]: 161 mSDtfsCounter, 62 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 738 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-02-06 03:12:20,920 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 738 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-02-06 03:12:20,921 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 841 states.
[2025-02-06 03:12:20,984 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 841 to 766.
[2025-02-06 03:12:20,985 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 766 states, 634 states have (on average 1.1545741324921135) internal successors, (732), 639 states have internal predecessors, (732), 88 states have call successors, (88), 43 states have call predecessors, (88), 43 states have return successors, (88), 83 states have call predecessors, (88), 88 states have call successors, (88)
[2025-02-06 03:12:20,986 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 766 states to 766 states and 908 transitions.
[2025-02-06 03:12:20,987 INFO  L78                 Accepts]: Start accepts. Automaton has 766 states and 908 transitions. Word has length 129
[2025-02-06 03:12:20,987 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-06 03:12:20,987 INFO  L471      AbstractCegarLoop]: Abstraction has 766 states and 908 transitions.
[2025-02-06 03:12:20,988 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 6 states have (on average 8.666666666666666) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16)
[2025-02-06 03:12:20,988 INFO  L276                IsEmpty]: Start isEmpty. Operand 766 states and 908 transitions.
[2025-02-06 03:12:20,988 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 130
[2025-02-06 03:12:20,988 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-06 03:12:20,989 INFO  L218           NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:12:20,989 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2025-02-06 03:12:20,989 INFO  L396      AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-06 03:12:20,989 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 03:12:20,989 INFO  L85        PathProgramCache]: Analyzing trace with hash -795085869, now seen corresponding path program 1 times
[2025-02-06 03:12:20,989 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 03:12:20,989 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937115708]
[2025-02-06 03:12:20,989 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 03:12:20,989 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 03:12:20,999 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes.
[2025-02-06 03:12:21,009 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements.
[2025-02-06 03:12:21,009 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 03:12:21,009 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 03:12:21,093 INFO  L134       CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked.
[2025-02-06 03:12:21,093 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 03:12:21,093 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937115708]
[2025-02-06 03:12:21,093 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937115708] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-06 03:12:21,093 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-06 03:12:21,093 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-06 03:12:21,094 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746653543]
[2025-02-06 03:12:21,094 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-06 03:12:21,094 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-06 03:12:21,094 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 03:12:21,094 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-06 03:12:21,094 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-02-06 03:12:21,095 INFO  L87              Difference]: Start difference. First operand 766 states and 908 transitions. Second operand  has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16)
[2025-02-06 03:12:21,296 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-06 03:12:21,296 INFO  L93              Difference]: Finished difference Result 1362 states and 1619 transitions.
[2025-02-06 03:12:21,296 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-06 03:12:21,297 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 129
[2025-02-06 03:12:21,297 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-06 03:12:21,299 INFO  L225             Difference]: With dead ends: 1362
[2025-02-06 03:12:21,299 INFO  L226             Difference]: Without dead ends: 729
[2025-02-06 03:12:21,300 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2025-02-06 03:12:21,300 INFO  L435           NwaCegarLoop]: 160 mSDtfsCounter, 86 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-02-06 03:12:21,300 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 525 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-02-06 03:12:21,302 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 729 states.
[2025-02-06 03:12:21,363 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 727.
[2025-02-06 03:12:21,364 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 727 states, 595 states have (on average 1.1512605042016806) internal successors, (685), 600 states have internal predecessors, (685), 88 states have call successors, (88), 43 states have call predecessors, (88), 43 states have return successors, (88), 83 states have call predecessors, (88), 88 states have call successors, (88)
[2025-02-06 03:12:21,366 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 861 transitions.
[2025-02-06 03:12:21,366 INFO  L78                 Accepts]: Start accepts. Automaton has 727 states and 861 transitions. Word has length 129
[2025-02-06 03:12:21,367 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-06 03:12:21,367 INFO  L471      AbstractCegarLoop]: Abstraction has 727 states and 861 transitions.
[2025-02-06 03:12:21,367 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16)
[2025-02-06 03:12:21,367 INFO  L276                IsEmpty]: Start isEmpty. Operand 727 states and 861 transitions.
[2025-02-06 03:12:21,368 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 130
[2025-02-06 03:12:21,368 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-06 03:12:21,368 INFO  L218           NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:12:21,368 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2025-02-06 03:12:21,369 INFO  L396      AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-06 03:12:21,369 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 03:12:21,369 INFO  L85        PathProgramCache]: Analyzing trace with hash -1394220145, now seen corresponding path program 1 times
[2025-02-06 03:12:21,369 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 03:12:21,369 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750594471]
[2025-02-06 03:12:21,369 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 03:12:21,369 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 03:12:21,378 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes.
[2025-02-06 03:12:21,392 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements.
[2025-02-06 03:12:21,392 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 03:12:21,392 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 03:12:21,537 INFO  L134       CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked.
[2025-02-06 03:12:21,538 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 03:12:21,538 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750594471]
[2025-02-06 03:12:21,538 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750594471] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-06 03:12:21,538 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-06 03:12:21,538 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-02-06 03:12:21,538 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602107134]
[2025-02-06 03:12:21,538 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-06 03:12:21,538 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-02-06 03:12:21,539 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 03:12:21,539 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-02-06 03:12:21,539 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-02-06 03:12:21,539 INFO  L87              Difference]: Start difference. First operand 727 states and 861 transitions. Second operand  has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16)
[2025-02-06 03:12:21,660 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-06 03:12:21,660 INFO  L93              Difference]: Finished difference Result 1110 states and 1318 transitions.
[2025-02-06 03:12:21,661 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-02-06 03:12:21,661 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 129
[2025-02-06 03:12:21,661 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-06 03:12:21,663 INFO  L225             Difference]: With dead ends: 1110
[2025-02-06 03:12:21,663 INFO  L226             Difference]: Without dead ends: 516
[2025-02-06 03:12:21,664 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-02-06 03:12:21,664 INFO  L435           NwaCegarLoop]: 116 mSDtfsCounter, 0 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-02-06 03:12:21,664 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 481 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-02-06 03:12:21,665 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 516 states.
[2025-02-06 03:12:21,708 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 516.
[2025-02-06 03:12:21,709 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 516 states, 418 states have (on average 1.138755980861244) internal successors, (476), 421 states have internal predecessors, (476), 66 states have call successors, (66), 31 states have call predecessors, (66), 31 states have return successors, (66), 63 states have call predecessors, (66), 66 states have call successors, (66)
[2025-02-06 03:12:21,710 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 608 transitions.
[2025-02-06 03:12:21,710 INFO  L78                 Accepts]: Start accepts. Automaton has 516 states and 608 transitions. Word has length 129
[2025-02-06 03:12:21,711 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-06 03:12:21,711 INFO  L471      AbstractCegarLoop]: Abstraction has 516 states and 608 transitions.
[2025-02-06 03:12:21,711 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16)
[2025-02-06 03:12:21,711 INFO  L276                IsEmpty]: Start isEmpty. Operand 516 states and 608 transitions.
[2025-02-06 03:12:21,712 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 130
[2025-02-06 03:12:21,712 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-06 03:12:21,712 INFO  L218           NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:12:21,712 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2025-02-06 03:12:21,712 INFO  L396      AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-06 03:12:21,712 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 03:12:21,712 INFO  L85        PathProgramCache]: Analyzing trace with hash 857548522, now seen corresponding path program 1 times
[2025-02-06 03:12:21,712 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 03:12:21,712 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076058091]
[2025-02-06 03:12:21,713 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 03:12:21,713 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 03:12:21,721 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes.
[2025-02-06 03:12:21,736 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements.
[2025-02-06 03:12:21,736 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 03:12:21,736 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 03:12:22,155 INFO  L134       CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked.
[2025-02-06 03:12:22,156 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 03:12:22,156 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076058091]
[2025-02-06 03:12:22,156 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076058091] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-06 03:12:22,156 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-06 03:12:22,156 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-02-06 03:12:22,156 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544855205]
[2025-02-06 03:12:22,156 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-06 03:12:22,156 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-02-06 03:12:22,156 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 03:12:22,157 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-02-06 03:12:22,157 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56
[2025-02-06 03:12:22,157 INFO  L87              Difference]: Start difference. First operand 516 states and 608 transitions. Second operand  has 8 states, 6 states have (on average 8.666666666666666) internal successors, (52), 8 states have internal predecessors, (52), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16)
[2025-02-06 03:12:22,486 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-06 03:12:22,487 INFO  L93              Difference]: Finished difference Result 894 states and 1053 transitions.
[2025-02-06 03:12:22,489 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-02-06 03:12:22,490 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 6 states have (on average 8.666666666666666) internal successors, (52), 8 states have internal predecessors, (52), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16) Word has length 129
[2025-02-06 03:12:22,490 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-06 03:12:22,492 INFO  L225             Difference]: With dead ends: 894
[2025-02-06 03:12:22,492 INFO  L226             Difference]: Without dead ends: 511
[2025-02-06 03:12:22,492 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2025-02-06 03:12:22,493 INFO  L435           NwaCegarLoop]: 143 mSDtfsCounter, 81 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 698 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-02-06 03:12:22,498 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 698 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-02-06 03:12:22,498 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 511 states.
[2025-02-06 03:12:22,563 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 508.
[2025-02-06 03:12:22,564 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 508 states, 409 states have (on average 1.1271393643031784) internal successors, (461), 412 states have internal predecessors, (461), 66 states have call successors, (66), 32 states have call predecessors, (66), 32 states have return successors, (66), 63 states have call predecessors, (66), 66 states have call successors, (66)
[2025-02-06 03:12:22,565 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 593 transitions.
[2025-02-06 03:12:22,566 INFO  L78                 Accepts]: Start accepts. Automaton has 508 states and 593 transitions. Word has length 129
[2025-02-06 03:12:22,566 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-06 03:12:22,566 INFO  L471      AbstractCegarLoop]: Abstraction has 508 states and 593 transitions.
[2025-02-06 03:12:22,566 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 6 states have (on average 8.666666666666666) internal successors, (52), 8 states have internal predecessors, (52), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16)
[2025-02-06 03:12:22,566 INFO  L276                IsEmpty]: Start isEmpty. Operand 508 states and 593 transitions.
[2025-02-06 03:12:22,567 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 130
[2025-02-06 03:12:22,567 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-06 03:12:22,567 INFO  L218           NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:12:22,567 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2025-02-06 03:12:22,567 INFO  L396      AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-06 03:12:22,568 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 03:12:22,568 INFO  L85        PathProgramCache]: Analyzing trace with hash 986631241, now seen corresponding path program 1 times
[2025-02-06 03:12:22,568 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 03:12:22,568 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565360363]
[2025-02-06 03:12:22,568 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 03:12:22,568 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 03:12:22,581 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes.
[2025-02-06 03:12:22,618 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements.
[2025-02-06 03:12:22,618 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 03:12:22,618 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 03:12:22,826 INFO  L134       CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked.
[2025-02-06 03:12:22,826 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 03:12:22,827 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565360363]
[2025-02-06 03:12:22,827 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565360363] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-06 03:12:22,827 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-06 03:12:22,827 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-02-06 03:12:22,827 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991005652]
[2025-02-06 03:12:22,827 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-06 03:12:22,827 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-02-06 03:12:22,827 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 03:12:22,828 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-02-06 03:12:22,828 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-02-06 03:12:22,828 INFO  L87              Difference]: Start difference. First operand 508 states and 593 transitions. Second operand  has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16)
[2025-02-06 03:12:23,052 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-06 03:12:23,052 INFO  L93              Difference]: Finished difference Result 946 states and 1107 transitions.
[2025-02-06 03:12:23,053 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-02-06 03:12:23,053 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 129
[2025-02-06 03:12:23,053 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-06 03:12:23,055 INFO  L225             Difference]: With dead ends: 946
[2025-02-06 03:12:23,055 INFO  L226             Difference]: Without dead ends: 575
[2025-02-06 03:12:23,056 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2025-02-06 03:12:23,056 INFO  L435           NwaCegarLoop]: 132 mSDtfsCounter, 65 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-02-06 03:12:23,056 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 508 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-02-06 03:12:23,057 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 575 states.
[2025-02-06 03:12:23,117 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 508.
[2025-02-06 03:12:23,118 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 508 states, 409 states have (on average 1.1222493887530562) internal successors, (459), 412 states have internal predecessors, (459), 66 states have call successors, (66), 32 states have call predecessors, (66), 32 states have return successors, (66), 63 states have call predecessors, (66), 66 states have call successors, (66)
[2025-02-06 03:12:23,119 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 591 transitions.
[2025-02-06 03:12:23,120 INFO  L78                 Accepts]: Start accepts. Automaton has 508 states and 591 transitions. Word has length 129
[2025-02-06 03:12:23,120 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-06 03:12:23,120 INFO  L471      AbstractCegarLoop]: Abstraction has 508 states and 591 transitions.
[2025-02-06 03:12:23,120 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16)
[2025-02-06 03:12:23,120 INFO  L276                IsEmpty]: Start isEmpty. Operand 508 states and 591 transitions.
[2025-02-06 03:12:23,121 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 130
[2025-02-06 03:12:23,121 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-06 03:12:23,121 INFO  L218           NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:12:23,121 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2025-02-06 03:12:23,121 INFO  L396      AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-06 03:12:23,122 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 03:12:23,122 INFO  L85        PathProgramCache]: Analyzing trace with hash 790117736, now seen corresponding path program 1 times
[2025-02-06 03:12:23,122 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 03:12:23,122 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474572720]
[2025-02-06 03:12:23,122 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 03:12:23,122 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 03:12:23,130 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes.
[2025-02-06 03:12:23,149 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements.
[2025-02-06 03:12:23,150 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 03:12:23,150 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 03:12:23,806 INFO  L134       CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked.
[2025-02-06 03:12:23,806 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 03:12:23,806 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474572720]
[2025-02-06 03:12:23,806 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474572720] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-06 03:12:23,806 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-06 03:12:23,806 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17
[2025-02-06 03:12:23,806 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825541830]
[2025-02-06 03:12:23,806 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-06 03:12:23,807 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 17 states
[2025-02-06 03:12:23,807 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 03:12:23,807 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants.
[2025-02-06 03:12:23,807 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272
[2025-02-06 03:12:23,807 INFO  L87              Difference]: Start difference. First operand 508 states and 591 transitions. Second operand  has 17 states, 15 states have (on average 3.466666666666667) internal successors, (52), 17 states have internal predecessors, (52), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16)
[2025-02-06 03:12:24,490 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-06 03:12:24,491 INFO  L93              Difference]: Finished difference Result 1008 states and 1178 transitions.
[2025-02-06 03:12:24,491 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. 
[2025-02-06 03:12:24,492 INFO  L78                 Accepts]: Start accepts. Automaton has  has 17 states, 15 states have (on average 3.466666666666667) internal successors, (52), 17 states have internal predecessors, (52), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16) Word has length 129
[2025-02-06 03:12:24,492 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-06 03:12:24,494 INFO  L225             Difference]: With dead ends: 1008
[2025-02-06 03:12:24,494 INFO  L226             Difference]: Without dead ends: 637
[2025-02-06 03:12:24,495 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=489, Unknown=0, NotChecked=0, Total=552
[2025-02-06 03:12:24,495 INFO  L435           NwaCegarLoop]: 168 mSDtfsCounter, 79 mSDsluCounter, 1875 mSDsCounter, 0 mSdLazyCounter, 931 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 2043 SdHoareTripleChecker+Invalid, 932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 931 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-02-06 03:12:24,495 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 2043 Invalid, 932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 931 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-02-06 03:12:24,496 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 637 states.
[2025-02-06 03:12:24,566 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 540.
[2025-02-06 03:12:24,567 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 540 states, 441 states have (on average 1.129251700680272) internal successors, (498), 444 states have internal predecessors, (498), 66 states have call successors, (66), 32 states have call predecessors, (66), 32 states have return successors, (66), 63 states have call predecessors, (66), 66 states have call successors, (66)
[2025-02-06 03:12:24,568 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 630 transitions.
[2025-02-06 03:12:24,569 INFO  L78                 Accepts]: Start accepts. Automaton has 540 states and 630 transitions. Word has length 129
[2025-02-06 03:12:24,569 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-06 03:12:24,569 INFO  L471      AbstractCegarLoop]: Abstraction has 540 states and 630 transitions.
[2025-02-06 03:12:24,569 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 17 states, 15 states have (on average 3.466666666666667) internal successors, (52), 17 states have internal predecessors, (52), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16)
[2025-02-06 03:12:24,569 INFO  L276                IsEmpty]: Start isEmpty. Operand 540 states and 630 transitions.
[2025-02-06 03:12:24,570 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 130
[2025-02-06 03:12:24,570 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-06 03:12:24,570 INFO  L218           NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:12:24,570 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2025-02-06 03:12:24,570 INFO  L396      AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-06 03:12:24,570 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 03:12:24,570 INFO  L85        PathProgramCache]: Analyzing trace with hash -1332144179, now seen corresponding path program 1 times
[2025-02-06 03:12:24,571 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 03:12:24,571 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341081588]
[2025-02-06 03:12:24,571 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 03:12:24,571 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 03:12:24,579 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes.
[2025-02-06 03:12:24,590 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements.
[2025-02-06 03:12:24,590 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 03:12:24,591 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 03:12:24,744 INFO  L134       CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked.
[2025-02-06 03:12:24,744 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 03:12:24,744 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341081588]
[2025-02-06 03:12:24,744 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341081588] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-06 03:12:24,744 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-06 03:12:24,744 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-02-06 03:12:24,744 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411641438]
[2025-02-06 03:12:24,744 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-06 03:12:24,745 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-02-06 03:12:24,745 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 03:12:24,745 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-02-06 03:12:24,745 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-02-06 03:12:24,745 INFO  L87              Difference]: Start difference. First operand 540 states and 630 transitions. Second operand  has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16)
[2025-02-06 03:12:24,979 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-06 03:12:24,979 INFO  L93              Difference]: Finished difference Result 1016 states and 1187 transitions.
[2025-02-06 03:12:24,980 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-02-06 03:12:24,981 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 129
[2025-02-06 03:12:24,981 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-06 03:12:24,983 INFO  L225             Difference]: With dead ends: 1016
[2025-02-06 03:12:24,983 INFO  L226             Difference]: Without dead ends: 613
[2025-02-06 03:12:24,983 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2025-02-06 03:12:24,984 INFO  L435           NwaCegarLoop]: 132 mSDtfsCounter, 64 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-02-06 03:12:24,984 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 508 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-02-06 03:12:24,984 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 613 states.
[2025-02-06 03:12:25,042 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 540.
[2025-02-06 03:12:25,043 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 540 states, 441 states have (on average 1.124716553287982) internal successors, (496), 444 states have internal predecessors, (496), 66 states have call successors, (66), 32 states have call predecessors, (66), 32 states have return successors, (66), 63 states have call predecessors, (66), 66 states have call successors, (66)
[2025-02-06 03:12:25,044 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 628 transitions.
[2025-02-06 03:12:25,044 INFO  L78                 Accepts]: Start accepts. Automaton has 540 states and 628 transitions. Word has length 129
[2025-02-06 03:12:25,045 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-06 03:12:25,045 INFO  L471      AbstractCegarLoop]: Abstraction has 540 states and 628 transitions.
[2025-02-06 03:12:25,045 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16)
[2025-02-06 03:12:25,045 INFO  L276                IsEmpty]: Start isEmpty. Operand 540 states and 628 transitions.
[2025-02-06 03:12:25,045 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 130
[2025-02-06 03:12:25,046 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-06 03:12:25,046 INFO  L218           NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:12:25,046 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2025-02-06 03:12:25,046 INFO  L396      AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-06 03:12:25,046 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 03:12:25,046 INFO  L85        PathProgramCache]: Analyzing trace with hash -1528657684, now seen corresponding path program 1 times
[2025-02-06 03:12:25,046 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 03:12:25,048 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140320475]
[2025-02-06 03:12:25,048 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 03:12:25,048 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 03:12:25,059 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes.
[2025-02-06 03:12:25,071 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements.
[2025-02-06 03:12:25,072 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 03:12:25,072 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 03:12:25,636 INFO  L134       CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked.
[2025-02-06 03:12:25,637 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 03:12:25,637 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140320475]
[2025-02-06 03:12:25,637 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140320475] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-06 03:12:25,637 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-06 03:12:25,637 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2025-02-06 03:12:25,637 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133236518]
[2025-02-06 03:12:25,637 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-06 03:12:25,637 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2025-02-06 03:12:25,638 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 03:12:25,638 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2025-02-06 03:12:25,638 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90
[2025-02-06 03:12:25,639 INFO  L87              Difference]: Start difference. First operand 540 states and 628 transitions. Second operand  has 10 states, 8 states have (on average 6.5) internal successors, (52), 10 states have internal predecessors, (52), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16)
[2025-02-06 03:12:26,068 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-06 03:12:26,069 INFO  L93              Difference]: Finished difference Result 1016 states and 1183 transitions.
[2025-02-06 03:12:26,069 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2025-02-06 03:12:26,069 INFO  L78                 Accepts]: Start accepts. Automaton has  has 10 states, 8 states have (on average 6.5) internal successors, (52), 10 states have internal predecessors, (52), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16) Word has length 129
[2025-02-06 03:12:26,069 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-06 03:12:26,072 INFO  L225             Difference]: With dead ends: 1016
[2025-02-06 03:12:26,072 INFO  L226             Difference]: Without dead ends: 613
[2025-02-06 03:12:26,073 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132
[2025-02-06 03:12:26,073 INFO  L435           NwaCegarLoop]: 180 mSDtfsCounter, 70 mSDsluCounter, 1027 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 1207 SdHoareTripleChecker+Invalid, 506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-02-06 03:12:26,073 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 1207 Invalid, 506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-02-06 03:12:26,074 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 613 states.
[2025-02-06 03:12:26,138 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 540.
[2025-02-06 03:12:26,139 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 540 states, 441 states have (on average 1.1201814058956916) internal successors, (494), 444 states have internal predecessors, (494), 66 states have call successors, (66), 32 states have call predecessors, (66), 32 states have return successors, (66), 63 states have call predecessors, (66), 66 states have call successors, (66)
[2025-02-06 03:12:26,143 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 626 transitions.
[2025-02-06 03:12:26,143 INFO  L78                 Accepts]: Start accepts. Automaton has 540 states and 626 transitions. Word has length 129
[2025-02-06 03:12:26,144 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-06 03:12:26,144 INFO  L471      AbstractCegarLoop]: Abstraction has 540 states and 626 transitions.
[2025-02-06 03:12:26,144 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 8 states have (on average 6.5) internal successors, (52), 10 states have internal predecessors, (52), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16)
[2025-02-06 03:12:26,144 INFO  L276                IsEmpty]: Start isEmpty. Operand 540 states and 626 transitions.
[2025-02-06 03:12:26,144 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 130
[2025-02-06 03:12:26,144 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-06 03:12:26,144 INFO  L218           NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:12:26,144 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2025-02-06 03:12:26,144 INFO  L396      AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-06 03:12:26,145 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 03:12:26,145 INFO  L85        PathProgramCache]: Analyzing trace with hash 1554285325, now seen corresponding path program 1 times
[2025-02-06 03:12:26,145 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 03:12:26,145 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261592590]
[2025-02-06 03:12:26,145 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 03:12:26,145 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 03:12:26,158 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes.
[2025-02-06 03:12:26,174 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements.
[2025-02-06 03:12:26,174 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 03:12:26,174 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 03:12:26,543 INFO  L134       CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked.
[2025-02-06 03:12:26,543 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 03:12:26,543 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261592590]
[2025-02-06 03:12:26,543 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261592590] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-06 03:12:26,543 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-06 03:12:26,543 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2025-02-06 03:12:26,544 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188278930]
[2025-02-06 03:12:26,544 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-06 03:12:26,544 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2025-02-06 03:12:26,544 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 03:12:26,545 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2025-02-06 03:12:26,545 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2025-02-06 03:12:26,545 INFO  L87              Difference]: Start difference. First operand 540 states and 626 transitions. Second operand  has 9 states, 7 states have (on average 7.428571428571429) internal successors, (52), 9 states have internal predecessors, (52), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16)
[2025-02-06 03:12:26,812 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-06 03:12:26,812 INFO  L93              Difference]: Finished difference Result 1041 states and 1209 transitions.
[2025-02-06 03:12:26,812 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2025-02-06 03:12:26,813 INFO  L78                 Accepts]: Start accepts. Automaton has  has 9 states, 7 states have (on average 7.428571428571429) internal successors, (52), 9 states have internal predecessors, (52), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16) Word has length 129
[2025-02-06 03:12:26,813 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-06 03:12:26,815 INFO  L225             Difference]: With dead ends: 1041
[2025-02-06 03:12:26,815 INFO  L226             Difference]: Without dead ends: 636
[2025-02-06 03:12:26,815 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2025-02-06 03:12:26,816 INFO  L435           NwaCegarLoop]: 156 mSDtfsCounter, 76 mSDsluCounter, 707 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 863 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-02-06 03:12:26,816 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 863 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-02-06 03:12:26,816 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 636 states.
[2025-02-06 03:12:26,863 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 563.
[2025-02-06 03:12:26,864 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 563 states, 464 states have (on average 1.1206896551724137) internal successors, (520), 467 states have internal predecessors, (520), 66 states have call successors, (66), 32 states have call predecessors, (66), 32 states have return successors, (66), 63 states have call predecessors, (66), 66 states have call successors, (66)
[2025-02-06 03:12:26,865 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 652 transitions.
[2025-02-06 03:12:26,866 INFO  L78                 Accepts]: Start accepts. Automaton has 563 states and 652 transitions. Word has length 129
[2025-02-06 03:12:26,866 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-06 03:12:26,866 INFO  L471      AbstractCegarLoop]: Abstraction has 563 states and 652 transitions.
[2025-02-06 03:12:26,866 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 7 states have (on average 7.428571428571429) internal successors, (52), 9 states have internal predecessors, (52), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16)
[2025-02-06 03:12:26,866 INFO  L276                IsEmpty]: Start isEmpty. Operand 563 states and 652 transitions.
[2025-02-06 03:12:26,867 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 130
[2025-02-06 03:12:26,867 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-06 03:12:26,867 INFO  L218           NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:12:26,867 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26
[2025-02-06 03:12:26,867 INFO  L396      AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-06 03:12:26,867 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 03:12:26,867 INFO  L85        PathProgramCache]: Analyzing trace with hash 1487278572, now seen corresponding path program 1 times
[2025-02-06 03:12:26,867 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 03:12:26,867 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838730855]
[2025-02-06 03:12:26,867 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 03:12:26,868 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 03:12:26,876 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes.
[2025-02-06 03:12:26,889 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements.
[2025-02-06 03:12:26,890 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 03:12:26,890 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 03:12:27,237 INFO  L134       CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked.
[2025-02-06 03:12:27,237 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 03:12:27,238 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838730855]
[2025-02-06 03:12:27,238 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838730855] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-06 03:12:27,238 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-06 03:12:27,238 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2025-02-06 03:12:27,238 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358657709]
[2025-02-06 03:12:27,238 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-06 03:12:27,238 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2025-02-06 03:12:27,238 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 03:12:27,239 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2025-02-06 03:12:27,239 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90
[2025-02-06 03:12:27,239 INFO  L87              Difference]: Start difference. First operand 563 states and 652 transitions. Second operand  has 10 states, 8 states have (on average 6.5) internal successors, (52), 10 states have internal predecessors, (52), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16)
[2025-02-06 03:12:27,697 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-06 03:12:27,698 INFO  L93              Difference]: Finished difference Result 1058 states and 1227 transitions.
[2025-02-06 03:12:27,698 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2025-02-06 03:12:27,699 INFO  L78                 Accepts]: Start accepts. Automaton has  has 10 states, 8 states have (on average 6.5) internal successors, (52), 10 states have internal predecessors, (52), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16) Word has length 129
[2025-02-06 03:12:27,699 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-06 03:12:27,701 INFO  L225             Difference]: With dead ends: 1058
[2025-02-06 03:12:27,702 INFO  L226             Difference]: Without dead ends: 632
[2025-02-06 03:12:27,702 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132
[2025-02-06 03:12:27,708 INFO  L435           NwaCegarLoop]: 144 mSDtfsCounter, 74 mSDsluCounter, 730 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 874 SdHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-02-06 03:12:27,708 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 874 Invalid, 473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-02-06 03:12:27,709 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 632 states.
[2025-02-06 03:12:27,770 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 559.
[2025-02-06 03:12:27,771 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 559 states, 460 states have (on average 1.117391304347826) internal successors, (514), 463 states have internal predecessors, (514), 66 states have call successors, (66), 32 states have call predecessors, (66), 32 states have return successors, (66), 63 states have call predecessors, (66), 66 states have call successors, (66)
[2025-02-06 03:12:27,771 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 646 transitions.
[2025-02-06 03:12:27,772 INFO  L78                 Accepts]: Start accepts. Automaton has 559 states and 646 transitions. Word has length 129
[2025-02-06 03:12:27,772 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-06 03:12:27,773 INFO  L471      AbstractCegarLoop]: Abstraction has 559 states and 646 transitions.
[2025-02-06 03:12:27,773 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 8 states have (on average 6.5) internal successors, (52), 10 states have internal predecessors, (52), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16)
[2025-02-06 03:12:27,773 INFO  L276                IsEmpty]: Start isEmpty. Operand 559 states and 646 transitions.
[2025-02-06 03:12:27,774 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 130
[2025-02-06 03:12:27,774 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-06 03:12:27,774 INFO  L218           NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:12:27,774 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27
[2025-02-06 03:12:27,774 INFO  L396      AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-06 03:12:27,774 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 03:12:27,774 INFO  L85        PathProgramCache]: Analyzing trace with hash -831496848, now seen corresponding path program 1 times
[2025-02-06 03:12:27,774 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 03:12:27,774 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280532464]
[2025-02-06 03:12:27,775 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 03:12:27,775 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 03:12:27,793 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes.
[2025-02-06 03:12:27,808 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements.
[2025-02-06 03:12:27,809 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 03:12:27,810 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 03:12:28,385 INFO  L134       CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked.
[2025-02-06 03:12:28,385 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 03:12:28,385 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280532464]
[2025-02-06 03:12:28,385 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280532464] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-06 03:12:28,385 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-06 03:12:28,385 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17
[2025-02-06 03:12:28,385 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707719883]
[2025-02-06 03:12:28,386 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-06 03:12:28,386 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 17 states
[2025-02-06 03:12:28,386 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 03:12:28,386 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants.
[2025-02-06 03:12:28,386 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272
[2025-02-06 03:12:28,386 INFO  L87              Difference]: Start difference. First operand 559 states and 646 transitions. Second operand  has 17 states, 15 states have (on average 3.466666666666667) internal successors, (52), 17 states have internal predecessors, (52), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16)
[2025-02-06 03:12:28,983 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-06 03:12:28,983 INFO  L93              Difference]: Finished difference Result 1066 states and 1231 transitions.
[2025-02-06 03:12:28,984 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. 
[2025-02-06 03:12:28,984 INFO  L78                 Accepts]: Start accepts. Automaton has  has 17 states, 15 states have (on average 3.466666666666667) internal successors, (52), 17 states have internal predecessors, (52), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16) Word has length 129
[2025-02-06 03:12:28,984 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-06 03:12:28,986 INFO  L225             Difference]: With dead ends: 1066
[2025-02-06 03:12:28,986 INFO  L226             Difference]: Without dead ends: 644
[2025-02-06 03:12:28,987 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=489, Unknown=0, NotChecked=0, Total=552
[2025-02-06 03:12:28,987 INFO  L435           NwaCegarLoop]: 170 mSDtfsCounter, 70 mSDsluCounter, 1961 mSDsCounter, 0 mSdLazyCounter, 937 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 2131 SdHoareTripleChecker+Invalid, 938 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 937 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-02-06 03:12:28,987 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 2131 Invalid, 938 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 937 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-02-06 03:12:28,988 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 644 states.
[2025-02-06 03:12:29,037 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 551.
[2025-02-06 03:12:29,038 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 551 states, 452 states have (on average 1.1150442477876106) internal successors, (504), 455 states have internal predecessors, (504), 66 states have call successors, (66), 32 states have call predecessors, (66), 32 states have return successors, (66), 63 states have call predecessors, (66), 66 states have call successors, (66)
[2025-02-06 03:12:29,038 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 636 transitions.
[2025-02-06 03:12:29,039 INFO  L78                 Accepts]: Start accepts. Automaton has 551 states and 636 transitions. Word has length 129
[2025-02-06 03:12:29,039 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-06 03:12:29,040 INFO  L471      AbstractCegarLoop]: Abstraction has 551 states and 636 transitions.
[2025-02-06 03:12:29,040 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 17 states, 15 states have (on average 3.466666666666667) internal successors, (52), 17 states have internal predecessors, (52), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16)
[2025-02-06 03:12:29,040 INFO  L276                IsEmpty]: Start isEmpty. Operand 551 states and 636 transitions.
[2025-02-06 03:12:29,040 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 132
[2025-02-06 03:12:29,040 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-06 03:12:29,041 INFO  L218           NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:12:29,041 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28
[2025-02-06 03:12:29,041 INFO  L396      AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-06 03:12:29,041 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 03:12:29,041 INFO  L85        PathProgramCache]: Analyzing trace with hash 1746639435, now seen corresponding path program 1 times
[2025-02-06 03:12:29,041 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 03:12:29,041 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681128543]
[2025-02-06 03:12:29,041 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 03:12:29,042 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 03:12:29,051 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes.
[2025-02-06 03:12:29,055 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements.
[2025-02-06 03:12:29,056 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 03:12:29,056 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 03:12:29,103 INFO  L134       CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked.
[2025-02-06 03:12:29,104 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 03:12:29,104 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681128543]
[2025-02-06 03:12:29,104 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681128543] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-06 03:12:29,104 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-06 03:12:29,104 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-06 03:12:29,104 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693381453]
[2025-02-06 03:12:29,104 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-06 03:12:29,104 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-06 03:12:29,105 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 03:12:29,105 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-06 03:12:29,105 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-02-06 03:12:29,105 INFO  L87              Difference]: Start difference. First operand 551 states and 636 transitions. Second operand  has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16)
[2025-02-06 03:12:29,193 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-06 03:12:29,193 INFO  L93              Difference]: Finished difference Result 967 states and 1118 transitions.
[2025-02-06 03:12:29,194 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-06 03:12:29,194 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 131
[2025-02-06 03:12:29,194 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-06 03:12:29,196 INFO  L225             Difference]: With dead ends: 967
[2025-02-06 03:12:29,196 INFO  L226             Difference]: Without dead ends: 530
[2025-02-06 03:12:29,197 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2025-02-06 03:12:29,197 INFO  L435           NwaCegarLoop]: 136 mSDtfsCounter, 66 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-02-06 03:12:29,197 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 465 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-06 03:12:29,198 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 530 states.
[2025-02-06 03:12:29,247 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 528.
[2025-02-06 03:12:29,247 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 528 states, 429 states have (on average 1.0932400932400932) internal successors, (469), 432 states have internal predecessors, (469), 66 states have call successors, (66), 32 states have call predecessors, (66), 32 states have return successors, (66), 63 states have call predecessors, (66), 66 states have call successors, (66)
[2025-02-06 03:12:29,248 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 601 transitions.
[2025-02-06 03:12:29,249 INFO  L78                 Accepts]: Start accepts. Automaton has 528 states and 601 transitions. Word has length 131
[2025-02-06 03:12:29,249 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-06 03:12:29,249 INFO  L471      AbstractCegarLoop]: Abstraction has 528 states and 601 transitions.
[2025-02-06 03:12:29,249 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16)
[2025-02-06 03:12:29,249 INFO  L276                IsEmpty]: Start isEmpty. Operand 528 states and 601 transitions.
[2025-02-06 03:12:29,250 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 137
[2025-02-06 03:12:29,250 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-06 03:12:29,250 INFO  L218           NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:12:29,250 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29
[2025-02-06 03:12:29,251 INFO  L396      AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-06 03:12:29,251 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 03:12:29,251 INFO  L85        PathProgramCache]: Analyzing trace with hash 621306219, now seen corresponding path program 1 times
[2025-02-06 03:12:29,251 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 03:12:29,251 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764598055]
[2025-02-06 03:12:29,251 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 03:12:29,251 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 03:12:29,262 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes.
[2025-02-06 03:12:29,306 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements.
[2025-02-06 03:12:29,307 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 03:12:29,307 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 03:12:29,644 INFO  L134       CoverageAnalysis]: Checked inductivity of 480 backedges. 78 proven. 6 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked.
[2025-02-06 03:12:29,645 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 03:12:29,645 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764598055]
[2025-02-06 03:12:29,645 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764598055] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-06 03:12:29,645 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [481357898]
[2025-02-06 03:12:29,645 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 03:12:29,645 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-06 03:12:29,645 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 03:12:29,647 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-02-06 03:12:29,652 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-02-06 03:12:29,751 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes.
[2025-02-06 03:12:29,947 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements.
[2025-02-06 03:12:29,948 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 03:12:29,948 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 03:12:29,950 INFO  L256         TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 30 conjuncts are in the unsatisfiable core
[2025-02-06 03:12:29,953 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-06 03:12:29,955 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 9 treesize of output 3
[2025-02-06 03:12:29,984 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 31 treesize of output 15
[2025-02-06 03:12:30,125 INFO  L134       CoverageAnalysis]: Checked inductivity of 480 backedges. 149 proven. 6 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked.
[2025-02-06 03:12:30,125 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-02-06 03:12:30,432 INFO  L134       CoverageAnalysis]: Checked inductivity of 480 backedges. 78 proven. 9 refuted. 0 times theorem prover too weak. 393 trivial. 0 not checked.
[2025-02-06 03:12:30,432 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [481357898] provided 0 perfect and 2 imperfect interpolant sequences
[2025-02-06 03:12:30,432 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-02-06 03:12:30,432 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 28
[2025-02-06 03:12:30,432 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875209148]
[2025-02-06 03:12:30,432 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-02-06 03:12:30,432 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 28 states
[2025-02-06 03:12:30,432 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 03:12:30,433 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants.
[2025-02-06 03:12:30,433 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=621, Unknown=0, NotChecked=0, Total=756
[2025-02-06 03:12:30,433 INFO  L87              Difference]: Start difference. First operand 528 states and 601 transitions. Second operand  has 28 states, 22 states have (on average 4.863636363636363) internal successors, (107), 26 states have internal predecessors, (107), 11 states have call successors, (35), 3 states have call predecessors, (35), 6 states have return successors, (35), 7 states have call predecessors, (35), 11 states have call successors, (35)
[2025-02-06 03:12:31,122 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-06 03:12:31,122 INFO  L93              Difference]: Finished difference Result 925 states and 1046 transitions.
[2025-02-06 03:12:31,123 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. 
[2025-02-06 03:12:31,123 INFO  L78                 Accepts]: Start accepts. Automaton has  has 28 states, 22 states have (on average 4.863636363636363) internal successors, (107), 26 states have internal predecessors, (107), 11 states have call successors, (35), 3 states have call predecessors, (35), 6 states have return successors, (35), 7 states have call predecessors, (35), 11 states have call successors, (35) Word has length 136
[2025-02-06 03:12:31,123 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-06 03:12:31,125 INFO  L225             Difference]: With dead ends: 925
[2025-02-06 03:12:31,125 INFO  L226             Difference]: Without dead ends: 534
[2025-02-06 03:12:31,126 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 258 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 419 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=359, Invalid=1447, Unknown=0, NotChecked=0, Total=1806
[2025-02-06 03:12:31,126 INFO  L435           NwaCegarLoop]: 66 mSDtfsCounter, 459 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 742 mSolverCounterSat, 178 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 460 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 920 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 178 IncrementalHoareTripleChecker+Valid, 742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-02-06 03:12:31,126 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [460 Valid, 570 Invalid, 920 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [178 Valid, 742 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-02-06 03:12:31,127 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 534 states.
[2025-02-06 03:12:31,180 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 512.
[2025-02-06 03:12:31,180 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 512 states, 409 states have (on average 1.0880195599022005) internal successors, (445), 412 states have internal predecessors, (445), 66 states have call successors, (66), 36 states have call predecessors, (66), 36 states have return successors, (66), 63 states have call predecessors, (66), 66 states have call successors, (66)
[2025-02-06 03:12:31,181 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 577 transitions.
[2025-02-06 03:12:31,182 INFO  L78                 Accepts]: Start accepts. Automaton has 512 states and 577 transitions. Word has length 136
[2025-02-06 03:12:31,182 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-06 03:12:31,182 INFO  L471      AbstractCegarLoop]: Abstraction has 512 states and 577 transitions.
[2025-02-06 03:12:31,182 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 28 states, 22 states have (on average 4.863636363636363) internal successors, (107), 26 states have internal predecessors, (107), 11 states have call successors, (35), 3 states have call predecessors, (35), 6 states have return successors, (35), 7 states have call predecessors, (35), 11 states have call successors, (35)
[2025-02-06 03:12:31,183 INFO  L276                IsEmpty]: Start isEmpty. Operand 512 states and 577 transitions.
[2025-02-06 03:12:31,183 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 137
[2025-02-06 03:12:31,183 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-06 03:12:31,183 INFO  L218           NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:12:31,194 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0
[2025-02-06 03:12:31,384 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-06 03:12:31,384 INFO  L396      AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-06 03:12:31,385 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 03:12:31,385 INFO  L85        PathProgramCache]: Analyzing trace with hash -930829589, now seen corresponding path program 1 times
[2025-02-06 03:12:31,385 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 03:12:31,385 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433689442]
[2025-02-06 03:12:31,385 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 03:12:31,385 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 03:12:31,394 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes.
[2025-02-06 03:12:31,428 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements.
[2025-02-06 03:12:31,429 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 03:12:31,429 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unknown
[2025-02-06 03:12:31,430 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [360718108]
[2025-02-06 03:12:31,430 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 03:12:31,430 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-06 03:12:31,430 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 03:12:31,435 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-02-06 03:12:31,436 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-02-06 03:12:31,538 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes.
[2025-02-06 03:12:31,704 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements.
[2025-02-06 03:12:31,704 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 03:12:31,704 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 03:12:31,707 INFO  L256         TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 34 conjuncts are in the unsatisfiable core
[2025-02-06 03:12:31,709 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-06 03:12:31,782 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13
[2025-02-06 03:12:31,797 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13
[2025-02-06 03:12:31,812 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13
[2025-02-06 03:12:31,865 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-02-06 03:12:31,865 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 29
[2025-02-06 03:12:31,945 INFO  L134       CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked.
[2025-02-06 03:12:31,946 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-02-06 03:12:31,946 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 03:12:31,946 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433689442]
[2025-02-06 03:12:31,946 WARN  L311   FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2025-02-06 03:12:31,946 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [360718108]
[2025-02-06 03:12:31,946 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [360718108] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-06 03:12:31,947 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-06 03:12:31,947 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-02-06 03:12:31,947 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108786581]
[2025-02-06 03:12:31,947 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-06 03:12:31,947 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-02-06 03:12:31,947 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 03:12:31,947 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-02-06 03:12:31,948 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2025-02-06 03:12:31,948 INFO  L87              Difference]: Start difference. First operand 512 states and 577 transitions. Second operand  has 8 states, 8 states have (on average 7.375) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16)
[2025-02-06 03:12:32,244 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-06 03:12:32,245 INFO  L93              Difference]: Finished difference Result 974 states and 1099 transitions.
[2025-02-06 03:12:32,245 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-02-06 03:12:32,245 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 7.375) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 136
[2025-02-06 03:12:32,245 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-06 03:12:32,248 INFO  L225             Difference]: With dead ends: 974
[2025-02-06 03:12:32,248 INFO  L226             Difference]: Without dead ends: 607
[2025-02-06 03:12:32,248 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2025-02-06 03:12:32,249 INFO  L435           NwaCegarLoop]: 142 mSDtfsCounter, 98 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-02-06 03:12:32,249 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 377 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-02-06 03:12:32,252 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 607 states.
[2025-02-06 03:12:32,325 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 520.
[2025-02-06 03:12:32,326 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 520 states, 417 states have (on average 1.091127098321343) internal successors, (455), 420 states have internal predecessors, (455), 66 states have call successors, (66), 36 states have call predecessors, (66), 36 states have return successors, (66), 63 states have call predecessors, (66), 66 states have call successors, (66)
[2025-02-06 03:12:32,327 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 587 transitions.
[2025-02-06 03:12:32,328 INFO  L78                 Accepts]: Start accepts. Automaton has 520 states and 587 transitions. Word has length 136
[2025-02-06 03:12:32,328 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-06 03:12:32,329 INFO  L471      AbstractCegarLoop]: Abstraction has 520 states and 587 transitions.
[2025-02-06 03:12:32,329 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 7.375) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16)
[2025-02-06 03:12:32,329 INFO  L276                IsEmpty]: Start isEmpty. Operand 520 states and 587 transitions.
[2025-02-06 03:12:32,329 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 137
[2025-02-06 03:12:32,329 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-06 03:12:32,329 INFO  L218           NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:12:32,337 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0
[2025-02-06 03:12:32,530 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31
[2025-02-06 03:12:32,530 INFO  L396      AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-06 03:12:32,531 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 03:12:32,531 INFO  L85        PathProgramCache]: Analyzing trace with hash -1588046677, now seen corresponding path program 1 times
[2025-02-06 03:12:32,531 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 03:12:32,531 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526350258]
[2025-02-06 03:12:32,531 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 03:12:32,531 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 03:12:32,541 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes.
[2025-02-06 03:12:32,582 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements.
[2025-02-06 03:12:32,583 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 03:12:32,583 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 03:12:33,068 INFO  L134       CoverageAnalysis]: Checked inductivity of 480 backedges. 72 proven. 12 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked.
[2025-02-06 03:12:33,069 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 03:12:33,069 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526350258]
[2025-02-06 03:12:33,069 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526350258] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-06 03:12:33,069 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [121316322]
[2025-02-06 03:12:33,069 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 03:12:33,069 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-06 03:12:33,069 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 03:12:33,071 INFO  L229       MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-02-06 03:12:33,072 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process
[2025-02-06 03:12:33,182 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes.
[2025-02-06 03:12:33,280 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements.
[2025-02-06 03:12:33,280 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 03:12:33,280 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 03:12:33,282 INFO  L256         TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 30 conjuncts are in the unsatisfiable core
[2025-02-06 03:12:33,286 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-06 03:12:33,323 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13
[2025-02-06 03:12:33,344 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 29 treesize of output 13
[2025-02-06 03:12:33,456 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-02-06 03:12:33,456 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 27
[2025-02-06 03:12:33,541 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-02-06 03:12:33,542 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 19
[2025-02-06 03:12:33,564 INFO  L134       CoverageAnalysis]: Checked inductivity of 480 backedges. 231 proven. 12 refuted. 0 times theorem prover too weak. 237 trivial. 0 not checked.
[2025-02-06 03:12:33,564 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-02-06 03:12:33,912 INFO  L134       CoverageAnalysis]: Checked inductivity of 480 backedges. 72 proven. 15 refuted. 0 times theorem prover too weak. 393 trivial. 0 not checked.
[2025-02-06 03:12:33,912 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [121316322] provided 0 perfect and 2 imperfect interpolant sequences
[2025-02-06 03:12:33,912 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-02-06 03:12:33,913 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 29
[2025-02-06 03:12:33,913 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903449138]
[2025-02-06 03:12:33,913 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-02-06 03:12:33,913 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 29 states
[2025-02-06 03:12:33,913 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 03:12:33,913 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants.
[2025-02-06 03:12:33,913 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=676, Unknown=0, NotChecked=0, Total=812
[2025-02-06 03:12:33,914 INFO  L87              Difference]: Start difference. First operand 520 states and 587 transitions. Second operand  has 29 states, 22 states have (on average 6.7272727272727275) internal successors, (148), 29 states have internal predecessors, (148), 13 states have call successors, (37), 3 states have call predecessors, (37), 7 states have return successors, (37), 7 states have call predecessors, (37), 13 states have call successors, (37)
[2025-02-06 03:12:34,618 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-06 03:12:34,619 INFO  L93              Difference]: Finished difference Result 885 states and 996 transitions.
[2025-02-06 03:12:34,619 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. 
[2025-02-06 03:12:34,619 INFO  L78                 Accepts]: Start accepts. Automaton has  has 29 states, 22 states have (on average 6.7272727272727275) internal successors, (148), 29 states have internal predecessors, (148), 13 states have call successors, (37), 3 states have call predecessors, (37), 7 states have return successors, (37), 7 states have call predecessors, (37), 13 states have call successors, (37) Word has length 136
[2025-02-06 03:12:34,619 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-06 03:12:34,621 INFO  L225             Difference]: With dead ends: 885
[2025-02-06 03:12:34,621 INFO  L226             Difference]: Without dead ends: 518
[2025-02-06 03:12:34,622 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 258 SyntacticMatches, 3 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 486 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=396, Invalid=1674, Unknown=0, NotChecked=0, Total=2070
[2025-02-06 03:12:34,622 INFO  L435           NwaCegarLoop]: 64 mSDtfsCounter, 314 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 799 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 923 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 799 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-02-06 03:12:34,622 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 608 Invalid, 923 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 799 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-02-06 03:12:34,623 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 518 states.
[2025-02-06 03:12:34,670 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 406.
[2025-02-06 03:12:34,670 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 406 states, 323 states have (on average 1.0866873065015479) internal successors, (351), 325 states have internal predecessors, (351), 52 states have call successors, (52), 30 states have call predecessors, (52), 30 states have return successors, (52), 50 states have call predecessors, (52), 52 states have call successors, (52)
[2025-02-06 03:12:34,670 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 455 transitions.
[2025-02-06 03:12:34,671 INFO  L78                 Accepts]: Start accepts. Automaton has 406 states and 455 transitions. Word has length 136
[2025-02-06 03:12:34,671 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-06 03:12:34,671 INFO  L471      AbstractCegarLoop]: Abstraction has 406 states and 455 transitions.
[2025-02-06 03:12:34,671 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 29 states, 22 states have (on average 6.7272727272727275) internal successors, (148), 29 states have internal predecessors, (148), 13 states have call successors, (37), 3 states have call predecessors, (37), 7 states have return successors, (37), 7 states have call predecessors, (37), 13 states have call successors, (37)
[2025-02-06 03:12:34,672 INFO  L276                IsEmpty]: Start isEmpty. Operand 406 states and 455 transitions.
[2025-02-06 03:12:34,672 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 137
[2025-02-06 03:12:34,672 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-06 03:12:34,672 INFO  L218           NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:12:34,681 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0
[2025-02-06 03:12:34,872 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-06 03:12:34,873 INFO  L396      AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-06 03:12:34,873 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 03:12:34,873 INFO  L85        PathProgramCache]: Analyzing trace with hash 1154784811, now seen corresponding path program 1 times
[2025-02-06 03:12:34,873 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 03:12:34,873 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125853473]
[2025-02-06 03:12:34,873 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 03:12:34,873 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 03:12:34,883 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes.
[2025-02-06 03:12:34,943 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements.
[2025-02-06 03:12:34,943 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 03:12:34,943 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unknown
[2025-02-06 03:12:34,944 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [179608333]
[2025-02-06 03:12:34,944 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 03:12:34,944 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-06 03:12:34,944 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 03:12:34,946 INFO  L229       MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-02-06 03:12:34,948 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process
[2025-02-06 03:12:35,058 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes.
[2025-02-06 03:12:35,261 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements.
[2025-02-06 03:12:35,261 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 03:12:35,261 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 03:12:35,263 INFO  L256         TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 34 conjuncts are in the unsatisfiable core
[2025-02-06 03:12:35,267 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-06 03:12:35,268 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3
[2025-02-06 03:12:35,271 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 19 treesize of output 1
[2025-02-06 03:12:35,273 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 19 treesize of output 1
[2025-02-06 03:12:35,276 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 19 treesize of output 1
[2025-02-06 03:12:35,380 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-02-06 03:12:35,380 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 26
[2025-02-06 03:12:35,395 INFO  L134       CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked.
[2025-02-06 03:12:35,395 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-02-06 03:12:35,395 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 03:12:35,396 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125853473]
[2025-02-06 03:12:35,396 WARN  L311   FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2025-02-06 03:12:35,396 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [179608333]
[2025-02-06 03:12:35,396 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [179608333] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-06 03:12:35,396 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-06 03:12:35,396 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-06 03:12:35,396 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474293586]
[2025-02-06 03:12:35,396 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-06 03:12:35,396 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-06 03:12:35,396 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 03:12:35,397 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-06 03:12:35,397 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-02-06 03:12:35,397 INFO  L87              Difference]: Start difference. First operand 406 states and 455 transitions. Second operand  has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16)
[2025-02-06 03:12:35,679 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-06 03:12:35,680 INFO  L93              Difference]: Finished difference Result 990 states and 1104 transitions.
[2025-02-06 03:12:35,680 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-06 03:12:35,680 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 136
[2025-02-06 03:12:35,680 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-06 03:12:35,682 INFO  L225             Difference]: With dead ends: 990
[2025-02-06 03:12:35,683 INFO  L226             Difference]: Without dead ends: 632
[2025-02-06 03:12:35,683 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2025-02-06 03:12:35,683 INFO  L435           NwaCegarLoop]: 167 mSDtfsCounter, 56 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-02-06 03:12:35,683 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 524 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-02-06 03:12:35,684 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 632 states.
[2025-02-06 03:12:35,736 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 452.
[2025-02-06 03:12:35,737 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 452 states, 369 states have (on average 1.067750677506775) internal successors, (394), 371 states have internal predecessors, (394), 52 states have call successors, (52), 30 states have call predecessors, (52), 30 states have return successors, (52), 50 states have call predecessors, (52), 52 states have call successors, (52)
[2025-02-06 03:12:35,737 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 498 transitions.
[2025-02-06 03:12:35,738 INFO  L78                 Accepts]: Start accepts. Automaton has 452 states and 498 transitions. Word has length 136
[2025-02-06 03:12:35,738 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-06 03:12:35,738 INFO  L471      AbstractCegarLoop]: Abstraction has 452 states and 498 transitions.
[2025-02-06 03:12:35,738 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16)
[2025-02-06 03:12:35,739 INFO  L276                IsEmpty]: Start isEmpty. Operand 452 states and 498 transitions.
[2025-02-06 03:12:35,739 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 138
[2025-02-06 03:12:35,739 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-06 03:12:35,739 INFO  L218           NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:12:35,745 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0
[2025-02-06 03:12:35,944 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-06 03:12:35,944 INFO  L396      AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-06 03:12:35,944 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 03:12:35,944 INFO  L85        PathProgramCache]: Analyzing trace with hash 80077613, now seen corresponding path program 1 times
[2025-02-06 03:12:35,944 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 03:12:35,944 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622374004]
[2025-02-06 03:12:35,945 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 03:12:35,945 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 03:12:35,955 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes.
[2025-02-06 03:12:35,998 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements.
[2025-02-06 03:12:35,999 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 03:12:35,999 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unknown
[2025-02-06 03:12:36,000 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1262211173]
[2025-02-06 03:12:36,000 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 03:12:36,000 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-06 03:12:36,000 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 03:12:36,002 INFO  L229       MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-02-06 03:12:36,004 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process
[2025-02-06 03:12:36,113 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes.
[2025-02-06 03:12:36,188 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements.
[2025-02-06 03:12:36,188 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 03:12:36,188 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 03:12:36,190 INFO  L256         TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 41 conjuncts are in the unsatisfiable core
[2025-02-06 03:12:36,193 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-06 03:12:36,347 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-02-06 03:12:36,347 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 25
[2025-02-06 03:12:36,379 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-02-06 03:12:36,380 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 16
[2025-02-06 03:12:36,397 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13
[2025-02-06 03:12:36,447 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-02-06 03:12:36,447 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 29
[2025-02-06 03:12:36,517 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-02-06 03:12:36,518 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 83 treesize of output 35
[2025-02-06 03:12:36,579 INFO  L134       CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 192 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked.
[2025-02-06 03:12:36,579 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-02-06 03:12:37,098 INFO  L134       CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked.
[2025-02-06 03:12:37,098 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 03:12:37,098 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622374004]
[2025-02-06 03:12:37,099 WARN  L311   FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2025-02-06 03:12:37,099 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1262211173]
[2025-02-06 03:12:37,099 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1262211173] provided 1 perfect and 1 imperfect interpolant sequences
[2025-02-06 03:12:37,099 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-02-06 03:12:37,099 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 14
[2025-02-06 03:12:37,099 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874455366]
[2025-02-06 03:12:37,099 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-06 03:12:37,099 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-02-06 03:12:37,099 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 03:12:37,099 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-02-06 03:12:37,099 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182
[2025-02-06 03:12:37,099 INFO  L87              Difference]: Start difference. First operand 452 states and 498 transitions. Second operand  has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16)
[2025-02-06 03:12:37,800 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-06 03:12:37,800 INFO  L93              Difference]: Finished difference Result 864 states and 951 transitions.
[2025-02-06 03:12:37,800 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-02-06 03:12:37,801 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 137
[2025-02-06 03:12:37,801 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-06 03:12:37,803 INFO  L225             Difference]: With dead ends: 864
[2025-02-06 03:12:37,803 INFO  L226             Difference]: Without dead ends: 579
[2025-02-06 03:12:37,803 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240
[2025-02-06 03:12:37,803 INFO  L435           NwaCegarLoop]: 115 mSDtfsCounter, 219 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-02-06 03:12:37,803 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 486 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-02-06 03:12:37,804 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 579 states.
[2025-02-06 03:12:37,860 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 472.
[2025-02-06 03:12:37,860 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 472 states, 389 states have (on average 1.0668380462724936) internal successors, (415), 391 states have internal predecessors, (415), 52 states have call successors, (52), 30 states have call predecessors, (52), 30 states have return successors, (52), 50 states have call predecessors, (52), 52 states have call successors, (52)
[2025-02-06 03:12:37,861 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 519 transitions.
[2025-02-06 03:12:37,862 INFO  L78                 Accepts]: Start accepts. Automaton has 472 states and 519 transitions. Word has length 137
[2025-02-06 03:12:37,862 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-06 03:12:37,862 INFO  L471      AbstractCegarLoop]: Abstraction has 472 states and 519 transitions.
[2025-02-06 03:12:37,862 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16)
[2025-02-06 03:12:37,862 INFO  L276                IsEmpty]: Start isEmpty. Operand 472 states and 519 transitions.
[2025-02-06 03:12:37,863 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 138
[2025-02-06 03:12:37,863 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-06 03:12:37,863 INFO  L218           NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:12:37,871 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0
[2025-02-06 03:12:38,066 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34
[2025-02-06 03:12:38,066 INFO  L396      AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-06 03:12:38,067 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 03:12:38,067 INFO  L85        PathProgramCache]: Analyzing trace with hash 1984536489, now seen corresponding path program 1 times
[2025-02-06 03:12:38,067 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 03:12:38,067 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986793393]
[2025-02-06 03:12:38,067 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 03:12:38,067 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 03:12:38,077 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes.
[2025-02-06 03:12:38,111 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements.
[2025-02-06 03:12:38,111 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 03:12:38,111 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unknown
[2025-02-06 03:12:38,113 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [255969409]
[2025-02-06 03:12:38,113 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 03:12:38,113 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-06 03:12:38,113 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 03:12:38,114 INFO  L229       MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-02-06 03:12:38,116 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process
[2025-02-06 03:12:38,230 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes.
[2025-02-06 03:12:38,307 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements.
[2025-02-06 03:12:38,307 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 03:12:38,307 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 03:12:38,312 INFO  L256         TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 34 conjuncts are in the unsatisfiable core
[2025-02-06 03:12:38,315 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-06 03:12:38,317 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 9 treesize of output 3
[2025-02-06 03:12:38,319 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 19 treesize of output 1
[2025-02-06 03:12:38,321 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 19 treesize of output 1
[2025-02-06 03:12:38,323 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 19 treesize of output 1
[2025-02-06 03:12:38,437 INFO  L134       CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked.
[2025-02-06 03:12:38,438 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-02-06 03:12:38,438 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 03:12:38,438 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986793393]
[2025-02-06 03:12:38,438 WARN  L311   FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2025-02-06 03:12:38,438 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [255969409]
[2025-02-06 03:12:38,438 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [255969409] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-06 03:12:38,438 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-06 03:12:38,438 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-06 03:12:38,438 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110549555]
[2025-02-06 03:12:38,438 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-06 03:12:38,439 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-06 03:12:38,439 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 03:12:38,439 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-06 03:12:38,439 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-06 03:12:38,439 INFO  L87              Difference]: Start difference. First operand 472 states and 519 transitions. Second operand  has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16)
[2025-02-06 03:12:38,719 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-06 03:12:38,719 INFO  L93              Difference]: Finished difference Result 1033 states and 1130 transitions.
[2025-02-06 03:12:38,720 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-06 03:12:38,720 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 137
[2025-02-06 03:12:38,720 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-06 03:12:38,722 INFO  L225             Difference]: With dead ends: 1033
[2025-02-06 03:12:38,722 INFO  L226             Difference]: Without dead ends: 564
[2025-02-06 03:12:38,722 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 133 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-02-06 03:12:38,723 INFO  L435           NwaCegarLoop]: 98 mSDtfsCounter, 45 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-02-06 03:12:38,723 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 269 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-02-06 03:12:38,723 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 564 states.
[2025-02-06 03:12:38,769 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 357.
[2025-02-06 03:12:38,770 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 357 states, 304 states have (on average 1.0625) internal successors, (323), 304 states have internal predecessors, (323), 32 states have call successors, (32), 20 states have call predecessors, (32), 20 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32)
[2025-02-06 03:12:38,770 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 387 transitions.
[2025-02-06 03:12:38,771 INFO  L78                 Accepts]: Start accepts. Automaton has 357 states and 387 transitions. Word has length 137
[2025-02-06 03:12:38,771 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-06 03:12:38,771 INFO  L471      AbstractCegarLoop]: Abstraction has 357 states and 387 transitions.
[2025-02-06 03:12:38,771 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16)
[2025-02-06 03:12:38,771 INFO  L276                IsEmpty]: Start isEmpty. Operand 357 states and 387 transitions.
[2025-02-06 03:12:38,771 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 139
[2025-02-06 03:12:38,771 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-06 03:12:38,772 INFO  L218           NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:12:38,779 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0
[2025-02-06 03:12:38,976 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35
[2025-02-06 03:12:38,976 INFO  L396      AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-06 03:12:38,976 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 03:12:38,977 INFO  L85        PathProgramCache]: Analyzing trace with hash -637466220, now seen corresponding path program 1 times
[2025-02-06 03:12:38,977 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 03:12:38,977 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552970361]
[2025-02-06 03:12:38,977 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 03:12:38,977 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 03:12:38,986 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes.
[2025-02-06 03:12:39,041 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements.
[2025-02-06 03:12:39,042 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 03:12:39,042 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unknown
[2025-02-06 03:12:39,043 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [216824450]
[2025-02-06 03:12:39,043 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 03:12:39,043 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-06 03:12:39,043 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 03:12:39,045 INFO  L229       MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-02-06 03:12:39,046 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process
[2025-02-06 03:12:39,159 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes.
[2025-02-06 03:12:39,257 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements.
[2025-02-06 03:12:39,257 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 03:12:39,257 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 03:12:39,259 INFO  L256         TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 26 conjuncts are in the unsatisfiable core
[2025-02-06 03:12:39,266 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-06 03:12:39,268 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1
[2025-02-06 03:12:39,270 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 19 treesize of output 1
[2025-02-06 03:12:39,272 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 19 treesize of output 1
[2025-02-06 03:12:39,273 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 19 treesize of output 1
[2025-02-06 03:12:39,351 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-02-06 03:12:39,352 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 28
[2025-02-06 03:12:39,370 INFO  L134       CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked.
[2025-02-06 03:12:39,370 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-02-06 03:12:39,370 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 03:12:39,370 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552970361]
[2025-02-06 03:12:39,370 WARN  L311   FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2025-02-06 03:12:39,370 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [216824450]
[2025-02-06 03:12:39,370 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [216824450] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-06 03:12:39,370 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-06 03:12:39,370 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-02-06 03:12:39,370 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142241612]
[2025-02-06 03:12:39,370 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-06 03:12:39,370 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-02-06 03:12:39,370 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 03:12:39,371 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-02-06 03:12:39,371 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2025-02-06 03:12:39,371 INFO  L87              Difference]: Start difference. First operand 357 states and 387 transitions. Second operand  has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16)
[2025-02-06 03:12:39,621 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-06 03:12:39,622 INFO  L93              Difference]: Finished difference Result 653 states and 708 transitions.
[2025-02-06 03:12:39,622 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-02-06 03:12:39,622 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 138
[2025-02-06 03:12:39,623 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-06 03:12:39,624 INFO  L225             Difference]: With dead ends: 653
[2025-02-06 03:12:39,624 INFO  L226             Difference]: Without dead ends: 394
[2025-02-06 03:12:39,625 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2025-02-06 03:12:39,625 INFO  L435           NwaCegarLoop]: 162 mSDtfsCounter, 56 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-02-06 03:12:39,625 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 514 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-02-06 03:12:39,641 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 394 states.
[2025-02-06 03:12:39,689 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 328.
[2025-02-06 03:12:39,689 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 328 states, 275 states have (on average 1.050909090909091) internal successors, (289), 275 states have internal predecessors, (289), 32 states have call successors, (32), 20 states have call predecessors, (32), 20 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32)
[2025-02-06 03:12:39,690 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 353 transitions.
[2025-02-06 03:12:39,691 INFO  L78                 Accepts]: Start accepts. Automaton has 328 states and 353 transitions. Word has length 138
[2025-02-06 03:12:39,691 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-06 03:12:39,691 INFO  L471      AbstractCegarLoop]: Abstraction has 328 states and 353 transitions.
[2025-02-06 03:12:39,691 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16)
[2025-02-06 03:12:39,691 INFO  L276                IsEmpty]: Start isEmpty. Operand 328 states and 353 transitions.
[2025-02-06 03:12:39,692 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 139
[2025-02-06 03:12:39,692 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-06 03:12:39,692 INFO  L218           NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:12:39,699 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0
[2025-02-06 03:12:39,892 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,17 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-06 03:12:39,892 INFO  L396      AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-06 03:12:39,893 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 03:12:39,893 INFO  L85        PathProgramCache]: Analyzing trace with hash -252583860, now seen corresponding path program 1 times
[2025-02-06 03:12:39,893 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 03:12:39,893 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258743007]
[2025-02-06 03:12:39,893 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 03:12:39,893 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 03:12:39,902 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes.
[2025-02-06 03:12:39,951 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements.
[2025-02-06 03:12:39,952 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 03:12:39,952 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unknown
[2025-02-06 03:12:39,953 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [14313239]
[2025-02-06 03:12:39,953 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 03:12:39,953 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-06 03:12:39,953 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 03:12:39,955 INFO  L229       MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-02-06 03:12:39,956 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process
[2025-02-06 03:12:40,076 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes.
[2025-02-06 03:12:40,211 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements.
[2025-02-06 03:12:40,211 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 03:12:40,211 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 03:12:40,213 INFO  L256         TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 32 conjuncts are in the unsatisfiable core
[2025-02-06 03:12:40,216 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-06 03:12:40,218 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3
[2025-02-06 03:12:40,221 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 19 treesize of output 1
[2025-02-06 03:12:40,223 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1
[2025-02-06 03:12:40,224 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 19 treesize of output 1
[2025-02-06 03:12:40,285 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-02-06 03:12:40,285 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 28
[2025-02-06 03:12:40,304 INFO  L134       CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked.
[2025-02-06 03:12:40,304 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-02-06 03:12:40,304 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 03:12:40,304 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258743007]
[2025-02-06 03:12:40,304 WARN  L311   FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2025-02-06 03:12:40,304 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [14313239]
[2025-02-06 03:12:40,304 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [14313239] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-06 03:12:40,304 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-06 03:12:40,304 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-02-06 03:12:40,304 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949734572]
[2025-02-06 03:12:40,305 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-06 03:12:40,305 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-02-06 03:12:40,305 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 03:12:40,305 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-02-06 03:12:40,305 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2025-02-06 03:12:40,305 INFO  L87              Difference]: Start difference. First operand 328 states and 353 transitions. Second operand  has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16)
[2025-02-06 03:12:40,559 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-06 03:12:40,560 INFO  L93              Difference]: Finished difference Result 647 states and 697 transitions.
[2025-02-06 03:12:40,560 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-02-06 03:12:40,560 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 138
[2025-02-06 03:12:40,561 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-06 03:12:40,562 INFO  L225             Difference]: With dead ends: 647
[2025-02-06 03:12:40,562 INFO  L226             Difference]: Without dead ends: 430
[2025-02-06 03:12:40,563 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2025-02-06 03:12:40,563 INFO  L435           NwaCegarLoop]: 117 mSDtfsCounter, 50 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-02-06 03:12:40,563 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 384 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-02-06 03:12:40,563 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 430 states.
[2025-02-06 03:12:40,612 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 321.
[2025-02-06 03:12:40,612 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 321 states, 268 states have (on average 1.0485074626865671) internal successors, (281), 268 states have internal predecessors, (281), 32 states have call successors, (32), 20 states have call predecessors, (32), 20 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32)
[2025-02-06 03:12:40,613 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 345 transitions.
[2025-02-06 03:12:40,613 INFO  L78                 Accepts]: Start accepts. Automaton has 321 states and 345 transitions. Word has length 138
[2025-02-06 03:12:40,614 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-06 03:12:40,614 INFO  L471      AbstractCegarLoop]: Abstraction has 321 states and 345 transitions.
[2025-02-06 03:12:40,614 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16)
[2025-02-06 03:12:40,614 INFO  L276                IsEmpty]: Start isEmpty. Operand 321 states and 345 transitions.
[2025-02-06 03:12:40,614 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 143
[2025-02-06 03:12:40,614 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-06 03:12:40,614 INFO  L218           NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:12:40,621 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0
[2025-02-06 03:12:40,815 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,18 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-06 03:12:40,815 INFO  L396      AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-06 03:12:40,815 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 03:12:40,816 INFO  L85        PathProgramCache]: Analyzing trace with hash -480477584, now seen corresponding path program 1 times
[2025-02-06 03:12:40,816 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 03:12:40,816 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40381274]
[2025-02-06 03:12:40,816 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 03:12:40,816 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 03:12:40,825 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes.
[2025-02-06 03:12:40,851 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements.
[2025-02-06 03:12:40,851 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 03:12:40,851 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 03:12:41,699 INFO  L134       CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked.
[2025-02-06 03:12:41,700 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 03:12:41,700 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40381274]
[2025-02-06 03:12:41,700 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40381274] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-06 03:12:41,700 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-06 03:12:41,700 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14
[2025-02-06 03:12:41,700 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035131286]
[2025-02-06 03:12:41,700 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-06 03:12:41,700 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 14 states
[2025-02-06 03:12:41,701 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 03:12:41,701 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2025-02-06 03:12:41,701 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182
[2025-02-06 03:12:41,701 INFO  L87              Difference]: Start difference. First operand 321 states and 345 transitions. Second operand  has 14 states, 13 states have (on average 5.0) internal successors, (65), 14 states have internal predecessors, (65), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16)
[2025-02-06 03:12:42,080 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-06 03:12:42,080 INFO  L93              Difference]: Finished difference Result 374 states and 399 transitions.
[2025-02-06 03:12:42,080 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2025-02-06 03:12:42,081 INFO  L78                 Accepts]: Start accepts. Automaton has  has 14 states, 13 states have (on average 5.0) internal successors, (65), 14 states have internal predecessors, (65), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 142
[2025-02-06 03:12:42,081 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-06 03:12:42,082 INFO  L225             Difference]: With dead ends: 374
[2025-02-06 03:12:42,082 INFO  L226             Difference]: Without dead ends: 372
[2025-02-06 03:12:42,083 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462
[2025-02-06 03:12:42,083 INFO  L435           NwaCegarLoop]: 120 mSDtfsCounter, 29 mSDsluCounter, 1301 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1421 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-02-06 03:12:42,083 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1421 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-02-06 03:12:42,084 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 372 states.
[2025-02-06 03:12:42,155 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 353.
[2025-02-06 03:12:42,156 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 353 states, 300 states have (on average 1.0466666666666666) internal successors, (314), 300 states have internal predecessors, (314), 32 states have call successors, (32), 20 states have call predecessors, (32), 20 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32)
[2025-02-06 03:12:42,156 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 378 transitions.
[2025-02-06 03:12:42,157 INFO  L78                 Accepts]: Start accepts. Automaton has 353 states and 378 transitions. Word has length 142
[2025-02-06 03:12:42,157 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-06 03:12:42,157 INFO  L471      AbstractCegarLoop]: Abstraction has 353 states and 378 transitions.
[2025-02-06 03:12:42,157 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 14 states, 13 states have (on average 5.0) internal successors, (65), 14 states have internal predecessors, (65), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16)
[2025-02-06 03:12:42,157 INFO  L276                IsEmpty]: Start isEmpty. Operand 353 states and 378 transitions.
[2025-02-06 03:12:42,158 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 143
[2025-02-06 03:12:42,158 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-06 03:12:42,158 INFO  L218           NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:12:42,158 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38
[2025-02-06 03:12:42,158 INFO  L396      AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-06 03:12:42,158 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 03:12:42,158 INFO  L85        PathProgramCache]: Analyzing trace with hash 2007035249, now seen corresponding path program 1 times
[2025-02-06 03:12:42,158 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 03:12:42,158 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74162137]
[2025-02-06 03:12:42,158 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 03:12:42,159 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 03:12:42,168 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes.
[2025-02-06 03:12:42,187 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements.
[2025-02-06 03:12:42,188 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 03:12:42,188 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 03:12:42,468 INFO  L134       CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked.
[2025-02-06 03:12:42,468 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 03:12:42,468 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74162137]
[2025-02-06 03:12:42,468 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74162137] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-06 03:12:42,468 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-06 03:12:42,468 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-02-06 03:12:42,468 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713710385]
[2025-02-06 03:12:42,468 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-06 03:12:42,469 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-02-06 03:12:42,469 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 03:12:42,469 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-02-06 03:12:42,469 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2025-02-06 03:12:42,469 INFO  L87              Difference]: Start difference. First operand 353 states and 378 transitions. Second operand  has 7 states, 5 states have (on average 13.0) internal successors, (65), 7 states have internal predecessors, (65), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16)
[2025-02-06 03:12:42,629 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-06 03:12:42,629 INFO  L93              Difference]: Finished difference Result 629 states and 671 transitions.
[2025-02-06 03:12:42,630 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-02-06 03:12:42,630 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 5 states have (on average 13.0) internal successors, (65), 7 states have internal predecessors, (65), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16) Word has length 142
[2025-02-06 03:12:42,630 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-06 03:12:42,632 INFO  L225             Difference]: With dead ends: 629
[2025-02-06 03:12:42,632 INFO  L226             Difference]: Without dead ends: 387
[2025-02-06 03:12:42,632 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2025-02-06 03:12:42,633 INFO  L435           NwaCegarLoop]: 123 mSDtfsCounter, 23 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-02-06 03:12:42,633 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 618 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-02-06 03:12:42,635 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 387 states.
[2025-02-06 03:12:42,684 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 353.
[2025-02-06 03:12:42,685 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 353 states, 300 states have (on average 1.0433333333333332) internal successors, (313), 300 states have internal predecessors, (313), 32 states have call successors, (32), 20 states have call predecessors, (32), 20 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32)
[2025-02-06 03:12:42,685 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 377 transitions.
[2025-02-06 03:12:42,686 INFO  L78                 Accepts]: Start accepts. Automaton has 353 states and 377 transitions. Word has length 142
[2025-02-06 03:12:42,686 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-06 03:12:42,686 INFO  L471      AbstractCegarLoop]: Abstraction has 353 states and 377 transitions.
[2025-02-06 03:12:42,686 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 5 states have (on average 13.0) internal successors, (65), 7 states have internal predecessors, (65), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16)
[2025-02-06 03:12:42,686 INFO  L276                IsEmpty]: Start isEmpty. Operand 353 states and 377 transitions.
[2025-02-06 03:12:42,687 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 143
[2025-02-06 03:12:42,687 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-06 03:12:42,687 INFO  L218           NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:12:42,687 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39
[2025-02-06 03:12:42,687 INFO  L396      AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-06 03:12:42,687 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 03:12:42,687 INFO  L85        PathProgramCache]: Analyzing trace with hash -469161457, now seen corresponding path program 1 times
[2025-02-06 03:12:42,687 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 03:12:42,687 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522056068]
[2025-02-06 03:12:42,687 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 03:12:42,687 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 03:12:42,697 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes.
[2025-02-06 03:12:42,716 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements.
[2025-02-06 03:12:42,716 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 03:12:42,716 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 03:12:42,947 INFO  L134       CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked.
[2025-02-06 03:12:42,947 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 03:12:42,948 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522056068]
[2025-02-06 03:12:42,948 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522056068] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-06 03:12:42,948 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-06 03:12:42,948 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-02-06 03:12:42,948 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051949960]
[2025-02-06 03:12:42,948 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-06 03:12:42,948 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-02-06 03:12:42,948 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 03:12:42,948 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-02-06 03:12:42,949 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2025-02-06 03:12:42,949 INFO  L87              Difference]: Start difference. First operand 353 states and 377 transitions. Second operand  has 6 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16)
[2025-02-06 03:12:43,069 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-06 03:12:43,070 INFO  L93              Difference]: Finished difference Result 610 states and 650 transitions.
[2025-02-06 03:12:43,071 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-02-06 03:12:43,071 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 142
[2025-02-06 03:12:43,072 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-06 03:12:43,074 INFO  L225             Difference]: With dead ends: 610
[2025-02-06 03:12:43,074 INFO  L226             Difference]: Without dead ends: 368
[2025-02-06 03:12:43,074 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2025-02-06 03:12:43,074 INFO  L435           NwaCegarLoop]: 140 mSDtfsCounter, 41 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-02-06 03:12:43,075 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 472 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-02-06 03:12:43,075 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 368 states.
[2025-02-06 03:12:43,124 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 353.
[2025-02-06 03:12:43,125 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 353 states, 300 states have (on average 1.04) internal successors, (312), 300 states have internal predecessors, (312), 32 states have call successors, (32), 20 states have call predecessors, (32), 20 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32)
[2025-02-06 03:12:43,125 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 376 transitions.
[2025-02-06 03:12:43,126 INFO  L78                 Accepts]: Start accepts. Automaton has 353 states and 376 transitions. Word has length 142
[2025-02-06 03:12:43,126 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-06 03:12:43,126 INFO  L471      AbstractCegarLoop]: Abstraction has 353 states and 376 transitions.
[2025-02-06 03:12:43,126 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16)
[2025-02-06 03:12:43,127 INFO  L276                IsEmpty]: Start isEmpty. Operand 353 states and 376 transitions.
[2025-02-06 03:12:43,127 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 143
[2025-02-06 03:12:43,127 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-06 03:12:43,127 INFO  L218           NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:12:43,127 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40
[2025-02-06 03:12:43,127 INFO  L396      AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-06 03:12:43,128 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 03:12:43,128 INFO  L85        PathProgramCache]: Analyzing trace with hash 2018351376, now seen corresponding path program 1 times
[2025-02-06 03:12:43,128 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 03:12:43,128 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7950295]
[2025-02-06 03:12:43,128 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 03:12:43,128 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 03:12:43,139 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes.
[2025-02-06 03:12:43,155 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements.
[2025-02-06 03:12:43,155 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 03:12:43,155 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 03:12:43,471 INFO  L134       CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked.
[2025-02-06 03:12:43,471 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 03:12:43,471 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7950295]
[2025-02-06 03:12:43,471 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7950295] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-06 03:12:43,471 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-06 03:12:43,471 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13
[2025-02-06 03:12:43,471 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454761487]
[2025-02-06 03:12:43,471 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-06 03:12:43,471 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 13 states
[2025-02-06 03:12:43,471 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 03:12:43,472 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2025-02-06 03:12:43,472 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156
[2025-02-06 03:12:43,472 INFO  L87              Difference]: Start difference. First operand 353 states and 376 transitions. Second operand  has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16)
[2025-02-06 03:12:43,788 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-06 03:12:43,788 INFO  L93              Difference]: Finished difference Result 460 states and 498 transitions.
[2025-02-06 03:12:43,788 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 
[2025-02-06 03:12:43,789 INFO  L78                 Accepts]: Start accepts. Automaton has  has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 142
[2025-02-06 03:12:43,789 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-06 03:12:43,790 INFO  L225             Difference]: With dead ends: 460
[2025-02-06 03:12:43,790 INFO  L226             Difference]: Without dead ends: 0
[2025-02-06 03:12:43,790 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=438, Unknown=0, NotChecked=0, Total=506
[2025-02-06 03:12:43,790 INFO  L435           NwaCegarLoop]: 188 mSDtfsCounter, 80 mSDsluCounter, 1716 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 1904 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-02-06 03:12:43,791 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 1904 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-02-06 03:12:43,791 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2025-02-06 03:12:43,791 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2025-02-06 03:12:43,791 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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-02-06 03:12:43,791 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2025-02-06 03:12:43,792 INFO  L78                 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 142
[2025-02-06 03:12:43,792 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-06 03:12:43,792 INFO  L471      AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2025-02-06 03:12:43,792 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16)
[2025-02-06 03:12:43,792 INFO  L276                IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2025-02-06 03:12:43,792 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2025-02-06 03:12:43,796 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2025-02-06 03:12:43,796 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41
[2025-02-06 03:12:43,800 INFO  L422         BasicCegarLoop]: Path program 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]
[2025-02-06 03:12:43,801 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.
[2025-02-06 03:13:07,289 WARN  L286               SmtUtils]: Spent 23.46s on a formula simplification. DAG size of input: 222 DAG size of output: 275 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or)