./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem16_label33.c --full-output --architecture 32bit


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


Checking for ERROR reachability
Using default analysis
Version c00e63dc
Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem16_label33.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) )

 --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 699c9c8063acd4bd53cef44ad5ead9f63bc9d124723ec1a4a717150e95ac10f2
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-c00e63d-m
[2025-02-05 11:58:44,952 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-02-05 11:58:45,026 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2025-02-05 11:58:45,031 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-02-05 11:58:45,031 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-02-05 11:58:45,056 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-02-05 11:58:45,057 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-02-05 11:58:45,057 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-02-05 11:58:45,057 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-02-05 11:58:45,057 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-02-05 11:58:45,058 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-02-05 11:58:45,058 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-02-05 11:58:45,058 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-02-05 11:58:45,058 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-02-05 11:58:45,058 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-02-05 11:58:45,058 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-02-05 11:58:45,058 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-02-05 11:58:45,059 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-02-05 11:58:45,059 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-02-05 11:58:45,059 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-02-05 11:58:45,059 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-02-05 11:58:45,059 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-02-05 11:58:45,059 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-02-05 11:58:45,059 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-02-05 11:58:45,059 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-02-05 11:58:45,059 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-02-05 11:58:45,059 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-02-05 11:58:45,059 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-02-05 11:58:45,059 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-02-05 11:58:45,059 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-02-05 11:58:45,060 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-02-05 11:58:45,060 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-02-05 11:58:45,060 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-02-05 11:58:45,060 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-02-05 11:58:45,061 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-02-05 11:58:45,061 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-02-05 11:58:45,061 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-02-05 11:58:45,061 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-02-05 11:58:45,061 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-02-05 11:58:45,061 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-02-05 11:58:45,061 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-02-05 11:58:45,061 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-02-05 11:58:45,061 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-02-05 11:58:45,061 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 -> 699c9c8063acd4bd53cef44ad5ead9f63bc9d124723ec1a4a717150e95ac10f2
[2025-02-05 11:58:45,343 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-02-05 11:58:45,355 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-02-05 11:58:45,358 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-02-05 11:58:45,360 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-02-05 11:58:45,360 INFO  L274        PluginConnector]: CDTParser initialized
[2025-02-05 11:58:45,361 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem16_label33.c
[2025-02-05 11:58:46,741 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2355bcac4/36bd46ba7e97408790b3f45e57184f43/FLAGc8ffd403e
[2025-02-05 11:58:47,108 INFO  L384              CDTParser]: Found 1 translation units.
[2025-02-05 11:58:47,110 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label33.c
[2025-02-05 11:58:47,131 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2355bcac4/36bd46ba7e97408790b3f45e57184f43/FLAGc8ffd403e
[2025-02-05 11:58:47,144 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2355bcac4/36bd46ba7e97408790b3f45e57184f43
[2025-02-05 11:58:47,146 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-02-05 11:58:47,148 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-02-05 11:58:47,149 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-02-05 11:58:47,149 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-02-05 11:58:47,153 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-02-05 11:58:47,154 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:58:47" (1/1) ...
[2025-02-05 11:58:47,154 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62f00722 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:58:47, skipping insertion in model container
[2025-02-05 11:58:47,156 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:58:47" (1/1) ...
[2025-02-05 11:58:47,207 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-02-05 11:58:47,378 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/eca-rers2012/Problem16_label33.c[3017,3030]
[2025-02-05 11:58:47,687 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-05 11:58:47,695 INFO  L200         MainTranslator]: Completed pre-run
[2025-02-05 11:58:47,707 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/eca-rers2012/Problem16_label33.c[3017,3030]
[2025-02-05 11:58:47,834 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-05 11:58:47,851 INFO  L204         MainTranslator]: Completed translation
[2025-02-05 11:58:47,852 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:58:47 WrapperNode
[2025-02-05 11:58:47,852 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-02-05 11:58:47,853 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-02-05 11:58:47,854 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-02-05 11:58:47,854 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-02-05 11:58:47,859 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:58:47" (1/1) ...
[2025-02-05 11:58:47,893 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:58:47" (1/1) ...
[2025-02-05 11:58:48,016 INFO  L138                Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1767
[2025-02-05 11:58:48,017 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-02-05 11:58:48,017 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-02-05 11:58:48,018 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-02-05 11:58:48,018 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-02-05 11:58:48,026 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:58:47" (1/1) ...
[2025-02-05 11:58:48,027 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:58:47" (1/1) ...
[2025-02-05 11:58:48,046 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:58:47" (1/1) ...
[2025-02-05 11:58:48,157 INFO  L175           MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2025-02-05 11:58:48,158 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:58:47" (1/1) ...
[2025-02-05 11:58:48,158 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:58:47" (1/1) ...
[2025-02-05 11:58:48,218 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:58:47" (1/1) ...
[2025-02-05 11:58:48,226 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:58:47" (1/1) ...
[2025-02-05 11:58:48,235 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:58:47" (1/1) ...
[2025-02-05 11:58:48,240 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:58:47" (1/1) ...
[2025-02-05 11:58:48,256 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-02-05 11:58:48,258 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-02-05 11:58:48,259 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-02-05 11:58:48,259 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-02-05 11:58:48,260 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:58:47" (1/1) ...
[2025-02-05 11:58:48,264 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-02-05 11:58:48,276 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 11:58:48,289 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2025-02-05 11:58:48,297 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2025-02-05 11:58:48,316 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-02-05 11:58:48,317 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-02-05 11:58:48,317 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-02-05 11:58:48,317 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-02-05 11:58:48,379 INFO  L257             CfgBuilder]: Building ICFG
[2025-02-05 11:58:48,380 INFO  L287             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-02-05 11:58:50,521 INFO  L1309  $ProcedureCfgBuilder]: dead code at ProgramPoint L1501: havoc calculate_output_#t~ret7#1;
[2025-02-05 11:58:50,605 INFO  L?                        ?]: Removed 276 outVars from TransFormulas that were not future-live.
[2025-02-05 11:58:50,605 INFO  L308             CfgBuilder]: Performing block encoding
[2025-02-05 11:58:50,659 INFO  L332             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-02-05 11:58:50,664 INFO  L337             CfgBuilder]: Removed 0 assume(true) statements.
[2025-02-05 11:58:50,664 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:58:50 BoogieIcfgContainer
[2025-02-05 11:58:50,664 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-02-05 11:58:50,666 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-02-05 11:58:50,667 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-02-05 11:58:50,672 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-02-05 11:58:50,672 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 11:58:47" (1/3) ...
[2025-02-05 11:58:50,672 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bb8f836 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:58:50, skipping insertion in model container
[2025-02-05 11:58:50,673 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:58:47" (2/3) ...
[2025-02-05 11:58:50,673 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bb8f836 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:58:50, skipping insertion in model container
[2025-02-05 11:58:50,673 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:58:50" (3/3) ...
[2025-02-05 11:58:50,674 INFO  L128   eAbstractionObserver]: Analyzing ICFG Problem16_label33.c
[2025-02-05 11:58:50,691 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-02-05 11:58:50,692 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG Problem16_label33.c that has 1 procedures, 396 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-02-05 11:58:50,762 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-02-05 11:58:50,775 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;@4e1fe055, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-02-05 11:58:50,776 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-02-05 11:58:50,781 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 396 states, 394 states have (on average 1.83248730964467) internal successors, (722), 395 states have internal predecessors, (722), 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-05 11:58:50,788 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 28
[2025-02-05 11:58:50,789 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:58:50,790 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:58:50,790 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:58:50,794 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:58:50,796 INFO  L85        PathProgramCache]: Analyzing trace with hash -1976981925, now seen corresponding path program 1 times
[2025-02-05 11:58:50,802 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:58:50,802 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519273138]
[2025-02-05 11:58:50,802 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:58:50,803 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:58:50,874 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes.
[2025-02-05 11:58:50,905 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements.
[2025-02-05 11:58:50,909 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:58:50,909 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:58:51,110 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 11:58:51,111 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:58:51,111 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519273138]
[2025-02-05 11:58:51,111 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519273138] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:58:51,111 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:58:51,112 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-02-05 11:58:51,113 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277227621]
[2025-02-05 11:58:51,114 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:58:51,117 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:58:51,118 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:58:51,136 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:58:51,137 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:58:51,140 INFO  L87              Difference]: Start difference. First operand  has 396 states, 394 states have (on average 1.83248730964467) internal successors, (722), 395 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand  has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:58:52,795 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:58:52,796 INFO  L93              Difference]: Finished difference Result 1122 states and 2100 transitions.
[2025-02-05 11:58:52,798 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:58:52,799 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27
[2025-02-05 11:58:52,799 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:58:52,810 INFO  L225             Difference]: With dead ends: 1122
[2025-02-05 11:58:52,811 INFO  L226             Difference]: Without dead ends: 662
[2025-02-05 11:58:52,815 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:58:52,820 INFO  L435           NwaCegarLoop]: 246 mSDtfsCounter, 360 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 864 mSolverCounterSat, 450 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 1314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 450 IncrementalHoareTripleChecker+Valid, 864 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time
[2025-02-05 11:58:52,821 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 254 Invalid, 1314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [450 Valid, 864 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time]
[2025-02-05 11:58:52,838 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 662 states.
[2025-02-05 11:58:52,879 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 662.
[2025-02-05 11:58:52,881 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 662 states, 661 states have (on average 1.518910741301059) internal successors, (1004), 661 states have internal predecessors, (1004), 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-05 11:58:52,890 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 1004 transitions.
[2025-02-05 11:58:52,891 INFO  L78                 Accepts]: Start accepts. Automaton has 662 states and 1004 transitions. Word has length 27
[2025-02-05 11:58:52,892 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:58:52,892 INFO  L471      AbstractCegarLoop]: Abstraction has 662 states and 1004 transitions.
[2025-02-05 11:58:52,892 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:58:52,893 INFO  L276                IsEmpty]: Start isEmpty. Operand 662 states and 1004 transitions.
[2025-02-05 11:58:52,895 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 96
[2025-02-05 11:58:52,895 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:58:52,895 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 11:58:52,896 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2025-02-05 11:58:52,896 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:58:52,897 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:58:52,897 INFO  L85        PathProgramCache]: Analyzing trace with hash -692867122, now seen corresponding path program 1 times
[2025-02-05 11:58:52,897 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:58:52,897 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316954189]
[2025-02-05 11:58:52,897 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:58:52,897 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:58:52,920 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes.
[2025-02-05 11:58:52,948 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements.
[2025-02-05 11:58:52,948 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:58:52,948 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:58:53,337 INFO  L134       CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 11:58:53,337 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:58:53,337 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316954189]
[2025-02-05 11:58:53,337 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316954189] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:58:53,337 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:58:53,337 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:58:53,337 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561910183]
[2025-02-05 11:58:53,337 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:58:53,339 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 11:58:53,339 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:58:53,339 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 11:58:53,339 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-05 11:58:53,340 INFO  L87              Difference]: Start difference. First operand 662 states and 1004 transitions. Second operand  has 4 states, 4 states have (on average 23.75) internal successors, (95), 3 states have internal predecessors, (95), 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-05 11:58:55,316 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:58:55,317 INFO  L93              Difference]: Finished difference Result 2309 states and 3414 transitions.
[2025-02-05 11:58:55,317 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 11:58:55,317 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 23.75) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95
[2025-02-05 11:58:55,317 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:58:55,323 INFO  L225             Difference]: With dead ends: 2309
[2025-02-05 11:58:55,324 INFO  L226             Difference]: Without dead ends: 1649
[2025-02-05 11:58:55,325 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-05 11:58:55,326 INFO  L435           NwaCegarLoop]: 33 mSDtfsCounter, 1008 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 1496 mSolverCounterSat, 489 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1008 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 1985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 489 IncrementalHoareTripleChecker+Valid, 1496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time
[2025-02-05 11:58:55,327 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1008 Valid, 42 Invalid, 1985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [489 Valid, 1496 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time]
[2025-02-05 11:58:55,329 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1649 states.
[2025-02-05 11:58:55,371 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1649 to 1649.
[2025-02-05 11:58:55,373 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1649 states, 1648 states have (on average 1.4016990291262137) internal successors, (2310), 1648 states have internal predecessors, (2310), 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-05 11:58:55,379 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1649 states to 1649 states and 2310 transitions.
[2025-02-05 11:58:55,380 INFO  L78                 Accepts]: Start accepts. Automaton has 1649 states and 2310 transitions. Word has length 95
[2025-02-05 11:58:55,380 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:58:55,380 INFO  L471      AbstractCegarLoop]: Abstraction has 1649 states and 2310 transitions.
[2025-02-05 11:58:55,380 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 23.75) internal successors, (95), 3 states have internal predecessors, (95), 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-05 11:58:55,381 INFO  L276                IsEmpty]: Start isEmpty. Operand 1649 states and 2310 transitions.
[2025-02-05 11:58:55,384 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 159
[2025-02-05 11:58:55,384 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:58:55,384 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 11:58:55,385 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-02-05 11:58:55,385 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:58:55,385 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:58:55,385 INFO  L85        PathProgramCache]: Analyzing trace with hash -328131634, now seen corresponding path program 1 times
[2025-02-05 11:58:55,386 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:58:55,386 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396865281]
[2025-02-05 11:58:55,386 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:58:55,386 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:58:55,420 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes.
[2025-02-05 11:58:55,444 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements.
[2025-02-05 11:58:55,444 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:58:55,445 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:58:55,623 INFO  L134       CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 11:58:55,623 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:58:55,624 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396865281]
[2025-02-05 11:58:55,624 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396865281] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:58:55,624 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:58:55,624 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-02-05 11:58:55,624 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441468120]
[2025-02-05 11:58:55,624 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:58:55,624 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:58:55,626 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:58:55,627 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:58:55,627 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:58:55,627 INFO  L87              Difference]: Start difference. First operand 1649 states and 2310 transitions. Second operand  has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 2 states have internal predecessors, (158), 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-05 11:58:57,006 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:58:57,007 INFO  L93              Difference]: Finished difference Result 3625 states and 5242 transitions.
[2025-02-05 11:58:57,007 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:58:57,007 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 2 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 158
[2025-02-05 11:58:57,008 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:58:57,016 INFO  L225             Difference]: With dead ends: 3625
[2025-02-05 11:58:57,017 INFO  L226             Difference]: Without dead ends: 2307
[2025-02-05 11:58:57,019 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:58:57,020 INFO  L435           NwaCegarLoop]: 73 mSDtfsCounter, 278 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 882 mSolverCounterSat, 380 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 1262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 380 IncrementalHoareTripleChecker+Valid, 882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time
[2025-02-05 11:58:57,020 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 77 Invalid, 1262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [380 Valid, 882 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time]
[2025-02-05 11:58:57,024 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2307 states.
[2025-02-05 11:58:57,054 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2307 to 2307.
[2025-02-05 11:58:57,058 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2307 states, 2306 states have (on average 1.349956634865568) internal successors, (3113), 2306 states have internal predecessors, (3113), 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-05 11:58:57,065 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2307 states to 2307 states and 3113 transitions.
[2025-02-05 11:58:57,066 INFO  L78                 Accepts]: Start accepts. Automaton has 2307 states and 3113 transitions. Word has length 158
[2025-02-05 11:58:57,068 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:58:57,068 INFO  L471      AbstractCegarLoop]: Abstraction has 2307 states and 3113 transitions.
[2025-02-05 11:58:57,068 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 2 states have internal predecessors, (158), 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-05 11:58:57,068 INFO  L276                IsEmpty]: Start isEmpty. Operand 2307 states and 3113 transitions.
[2025-02-05 11:58:57,071 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 194
[2025-02-05 11:58:57,073 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:58:57,073 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:58:57,073 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-02-05 11:58:57,074 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:58:57,074 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:58:57,075 INFO  L85        PathProgramCache]: Analyzing trace with hash -1609533913, now seen corresponding path program 1 times
[2025-02-05 11:58:57,075 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:58:57,075 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138681869]
[2025-02-05 11:58:57,075 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:58:57,075 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:58:57,123 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes.
[2025-02-05 11:58:57,150 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements.
[2025-02-05 11:58:57,151 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:58:57,151 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:58:57,338 INFO  L134       CoverageAnalysis]: Checked inductivity of 127 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked.
[2025-02-05 11:58:57,339 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:58:57,339 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138681869]
[2025-02-05 11:58:57,339 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138681869] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:58:57,339 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:58:57,339 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-02-05 11:58:57,340 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836713000]
[2025-02-05 11:58:57,340 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:58:57,340 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:58:57,340 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:58:57,341 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:58:57,342 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:58:57,342 INFO  L87              Difference]: Start difference. First operand 2307 states and 3113 transitions. Second operand  has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 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-05 11:58:58,560 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:58:58,561 INFO  L93              Difference]: Finished difference Result 5599 states and 7699 transitions.
[2025-02-05 11:58:58,561 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:58:58,561 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 193
[2025-02-05 11:58:58,562 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:58:58,575 INFO  L225             Difference]: With dead ends: 5599
[2025-02-05 11:58:58,575 INFO  L226             Difference]: Without dead ends: 3623
[2025-02-05 11:58:58,578 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:58:58,580 INFO  L435           NwaCegarLoop]: 151 mSDtfsCounter, 359 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 307 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 1118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 307 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time
[2025-02-05 11:58:58,580 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 155 Invalid, 1118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [307 Valid, 811 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time]
[2025-02-05 11:58:58,586 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3623 states.
[2025-02-05 11:58:58,639 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3623 to 2965.
[2025-02-05 11:58:58,643 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2965 states, 2964 states have (on average 1.2442645074224021) internal successors, (3688), 2964 states have internal predecessors, (3688), 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-05 11:58:58,650 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2965 states to 2965 states and 3688 transitions.
[2025-02-05 11:58:58,650 INFO  L78                 Accepts]: Start accepts. Automaton has 2965 states and 3688 transitions. Word has length 193
[2025-02-05 11:58:58,652 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:58:58,652 INFO  L471      AbstractCegarLoop]: Abstraction has 2965 states and 3688 transitions.
[2025-02-05 11:58:58,652 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 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-05 11:58:58,652 INFO  L276                IsEmpty]: Start isEmpty. Operand 2965 states and 3688 transitions.
[2025-02-05 11:58:58,654 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 211
[2025-02-05 11:58:58,655 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:58:58,655 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:58:58,655 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-02-05 11:58:58,655 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:58:58,656 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:58:58,656 INFO  L85        PathProgramCache]: Analyzing trace with hash -2089281831, now seen corresponding path program 1 times
[2025-02-05 11:58:58,656 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:58:58,657 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924630641]
[2025-02-05 11:58:58,657 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:58:58,657 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:58:58,681 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes.
[2025-02-05 11:58:58,699 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements.
[2025-02-05 11:58:58,700 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:58:58,700 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:58:58,844 INFO  L134       CoverageAnalysis]: Checked inductivity of 135 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 11:58:58,844 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:58:58,844 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924630641]
[2025-02-05 11:58:58,844 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924630641] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:58:58,845 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:58:58,845 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:58:58,845 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14982684]
[2025-02-05 11:58:58,845 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:58:58,846 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:58:58,846 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:58:58,847 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:58:58,847 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:58:58,847 INFO  L87              Difference]: Start difference. First operand 2965 states and 3688 transitions. Second operand  has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 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-05 11:58:59,961 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:58:59,961 INFO  L93              Difference]: Finished difference Result 6915 states and 8657 transitions.
[2025-02-05 11:58:59,962 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:58:59,962 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 210
[2025-02-05 11:58:59,962 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:58:59,973 INFO  L225             Difference]: With dead ends: 6915
[2025-02-05 11:58:59,973 INFO  L226             Difference]: Without dead ends: 3623
[2025-02-05 11:58:59,977 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:58:59,978 INFO  L435           NwaCegarLoop]: 534 mSDtfsCounter, 286 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 796 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 1094 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time
[2025-02-05 11:58:59,978 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 540 Invalid, 1094 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 796 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2025-02-05 11:58:59,982 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3623 states.
[2025-02-05 11:59:00,023 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3623 to 3623.
[2025-02-05 11:59:00,028 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3623 states, 3622 states have (on average 1.0762009939260078) internal successors, (3898), 3622 states have internal predecessors, (3898), 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-05 11:59:00,033 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3623 states to 3623 states and 3898 transitions.
[2025-02-05 11:59:00,034 INFO  L78                 Accepts]: Start accepts. Automaton has 3623 states and 3898 transitions. Word has length 210
[2025-02-05 11:59:00,034 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:59:00,034 INFO  L471      AbstractCegarLoop]: Abstraction has 3623 states and 3898 transitions.
[2025-02-05 11:59:00,034 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 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-05 11:59:00,034 INFO  L276                IsEmpty]: Start isEmpty. Operand 3623 states and 3898 transitions.
[2025-02-05 11:59:00,036 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 263
[2025-02-05 11:59:00,037 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:59:00,037 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 11:59:00,037 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-02-05 11:59:00,037 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:59:00,038 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:59:00,038 INFO  L85        PathProgramCache]: Analyzing trace with hash -967830446, now seen corresponding path program 1 times
[2025-02-05 11:59:00,038 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:59:00,038 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156750514]
[2025-02-05 11:59:00,038 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:59:00,038 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:59:00,072 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 262 statements into 1 equivalence classes.
[2025-02-05 11:59:00,094 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 262 of 262 statements.
[2025-02-05 11:59:00,094 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:59:00,094 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:59:00,328 INFO  L134       CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 11:59:00,329 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:59:00,329 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156750514]
[2025-02-05 11:59:00,329 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156750514] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:59:00,329 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:59:00,329 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:59:00,329 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383803702]
[2025-02-05 11:59:00,329 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:59:00,330 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:59:00,330 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:59:00,330 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:59:00,330 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:59:00,330 INFO  L87              Difference]: Start difference. First operand 3623 states and 3898 transitions. Second operand  has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 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-05 11:59:01,256 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:59:01,257 INFO  L93              Difference]: Finished difference Result 8231 states and 8905 transitions.
[2025-02-05 11:59:01,257 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:59:01,258 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 262
[2025-02-05 11:59:01,258 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:59:01,270 INFO  L225             Difference]: With dead ends: 8231
[2025-02-05 11:59:01,270 INFO  L226             Difference]: Without dead ends: 4939
[2025-02-05 11:59:01,273 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:59:01,274 INFO  L435           NwaCegarLoop]: 413 mSDtfsCounter, 309 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 765 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 848 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 765 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time
[2025-02-05 11:59:01,274 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 419 Invalid, 848 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 765 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2025-02-05 11:59:01,281 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 4939 states.
[2025-02-05 11:59:01,329 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 4939 to 4939.
[2025-02-05 11:59:01,336 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 4939 states, 4938 states have (on average 1.0514378290805995) internal successors, (5192), 4938 states have internal predecessors, (5192), 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-05 11:59:01,344 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4939 states to 4939 states and 5192 transitions.
[2025-02-05 11:59:01,345 INFO  L78                 Accepts]: Start accepts. Automaton has 4939 states and 5192 transitions. Word has length 262
[2025-02-05 11:59:01,345 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:59:01,345 INFO  L471      AbstractCegarLoop]: Abstraction has 4939 states and 5192 transitions.
[2025-02-05 11:59:01,345 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 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-05 11:59:01,347 INFO  L276                IsEmpty]: Start isEmpty. Operand 4939 states and 5192 transitions.
[2025-02-05 11:59:01,350 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 367
[2025-02-05 11:59:01,350 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:59:01,351 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 11:59:01,351 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-02-05 11:59:01,352 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:59:01,352 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:59:01,352 INFO  L85        PathProgramCache]: Analyzing trace with hash -1740051553, now seen corresponding path program 1 times
[2025-02-05 11:59:01,352 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:59:01,352 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268901148]
[2025-02-05 11:59:01,353 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:59:01,353 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:59:01,383 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 366 statements into 1 equivalence classes.
[2025-02-05 11:59:01,408 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 366 of 366 statements.
[2025-02-05 11:59:01,409 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:59:01,409 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:59:01,682 INFO  L134       CoverageAnalysis]: Checked inductivity of 144 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked.
[2025-02-05 11:59:01,682 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:59:01,682 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268901148]
[2025-02-05 11:59:01,683 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268901148] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:59:01,683 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:59:01,683 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:59:01,683 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673092029]
[2025-02-05 11:59:01,683 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:59:01,684 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:59:01,684 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:59:01,684 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:59:01,685 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:59:01,685 INFO  L87              Difference]: Start difference. First operand 4939 states and 5192 transitions. Second operand  has 3 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 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-05 11:59:02,618 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:59:02,619 INFO  L93              Difference]: Finished difference Result 10863 states and 11493 transitions.
[2025-02-05 11:59:02,619 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:59:02,619 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 366
[2025-02-05 11:59:02,620 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:59:02,639 INFO  L225             Difference]: With dead ends: 10863
[2025-02-05 11:59:02,639 INFO  L226             Difference]: Without dead ends: 6255
[2025-02-05 11:59:02,645 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:59:02,647 INFO  L435           NwaCegarLoop]: 33 mSDtfsCounter, 321 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 760 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time
[2025-02-05 11:59:02,647 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 38 Invalid, 857 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 760 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2025-02-05 11:59:02,653 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 6255 states.
[2025-02-05 11:59:02,722 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 6255 to 6255.
[2025-02-05 11:59:02,731 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 6255 states, 6254 states have (on average 1.0548448992644708) internal successors, (6597), 6254 states have internal predecessors, (6597), 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-05 11:59:02,746 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6255 states to 6255 states and 6597 transitions.
[2025-02-05 11:59:02,746 INFO  L78                 Accepts]: Start accepts. Automaton has 6255 states and 6597 transitions. Word has length 366
[2025-02-05 11:59:02,747 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:59:02,747 INFO  L471      AbstractCegarLoop]: Abstraction has 6255 states and 6597 transitions.
[2025-02-05 11:59:02,747 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 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-05 11:59:02,748 INFO  L276                IsEmpty]: Start isEmpty. Operand 6255 states and 6597 transitions.
[2025-02-05 11:59:02,755 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 421
[2025-02-05 11:59:02,756 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:59:02,756 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 11:59:02,756 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-02-05 11:59:02,757 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:59:02,758 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:59:02,758 INFO  L85        PathProgramCache]: Analyzing trace with hash 311615590, now seen corresponding path program 1 times
[2025-02-05 11:59:02,759 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:59:02,759 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733220005]
[2025-02-05 11:59:02,759 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:59:02,759 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:59:02,798 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 420 statements into 1 equivalence classes.
[2025-02-05 11:59:02,828 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 420 of 420 statements.
[2025-02-05 11:59:02,828 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:59:02,828 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:59:03,188 INFO  L134       CoverageAnalysis]: Checked inductivity of 206 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked.
[2025-02-05 11:59:03,189 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:59:03,189 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733220005]
[2025-02-05 11:59:03,189 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733220005] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:59:03,189 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:59:03,189 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:59:03,190 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009607134]
[2025-02-05 11:59:03,190 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:59:03,190 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:59:03,190 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:59:03,191 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:59:03,191 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:59:03,191 INFO  L87              Difference]: Start difference. First operand 6255 states and 6597 transitions. Second operand  has 3 states, 3 states have (on average 88.0) internal successors, (264), 3 states have internal predecessors, (264), 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-05 11:59:04,139 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:59:04,139 INFO  L93              Difference]: Finished difference Result 13495 states and 14303 transitions.
[2025-02-05 11:59:04,140 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:59:04,140 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 88.0) internal successors, (264), 3 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 420
[2025-02-05 11:59:04,141 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:59:04,172 INFO  L225             Difference]: With dead ends: 13495
[2025-02-05 11:59:04,172 INFO  L226             Difference]: Without dead ends: 7571
[2025-02-05 11:59:04,179 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:59:04,179 INFO  L435           NwaCegarLoop]: 432 mSDtfsCounter, 305 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 774 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 774 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time
[2025-02-05 11:59:04,180 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 438 Invalid, 845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 774 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2025-02-05 11:59:04,187 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 7571 states.
[2025-02-05 11:59:04,260 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 7571 to 7571.
[2025-02-05 11:59:04,275 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 7571 states, 7570 states have (on average 1.0498018494055483) internal successors, (7947), 7570 states have internal predecessors, (7947), 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-05 11:59:04,288 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7571 states to 7571 states and 7947 transitions.
[2025-02-05 11:59:04,288 INFO  L78                 Accepts]: Start accepts. Automaton has 7571 states and 7947 transitions. Word has length 420
[2025-02-05 11:59:04,289 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:59:04,290 INFO  L471      AbstractCegarLoop]: Abstraction has 7571 states and 7947 transitions.
[2025-02-05 11:59:04,290 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 88.0) internal successors, (264), 3 states have internal predecessors, (264), 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-05 11:59:04,290 INFO  L276                IsEmpty]: Start isEmpty. Operand 7571 states and 7947 transitions.
[2025-02-05 11:59:04,298 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 482
[2025-02-05 11:59:04,299 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:59:04,299 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:59:04,300 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-02-05 11:59:04,300 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:59:04,300 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:59:04,301 INFO  L85        PathProgramCache]: Analyzing trace with hash -185229101, now seen corresponding path program 1 times
[2025-02-05 11:59:04,301 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:59:04,301 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386492129]
[2025-02-05 11:59:04,301 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:59:04,301 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:59:04,352 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 481 statements into 1 equivalence classes.
[2025-02-05 11:59:04,384 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 481 of 481 statements.
[2025-02-05 11:59:04,384 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:59:04,384 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:59:04,915 INFO  L134       CoverageAnalysis]: Checked inductivity of 267 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked.
[2025-02-05 11:59:04,915 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:59:04,915 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386492129]
[2025-02-05 11:59:04,915 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386492129] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-05 11:59:04,915 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [408319254]
[2025-02-05 11:59:04,915 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:59:04,915 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 11:59:04,915 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 11:59:04,921 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-02-05 11:59:04,923 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2025-02-05 11:59:05,022 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 481 statements into 1 equivalence classes.
[2025-02-05 11:59:05,127 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 481 of 481 statements.
[2025-02-05 11:59:05,127 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:59:05,127 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:59:05,131 INFO  L256         TraceCheckSpWp]: Trace formula consists of 577 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-02-05 11:59:05,151 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-05 11:59:05,823 INFO  L134       CoverageAnalysis]: Checked inductivity of 267 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked.
[2025-02-05 11:59:05,823 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-02-05 11:59:05,823 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [408319254] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:59:05,823 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-02-05 11:59:05,824 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4
[2025-02-05 11:59:05,824 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716725859]
[2025-02-05 11:59:05,824 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:59:05,825 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:59:05,826 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:59:05,826 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:59:05,826 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-05 11:59:05,827 INFO  L87              Difference]: Start difference. First operand 7571 states and 7947 transitions. Second operand  has 3 states, 3 states have (on average 80.0) internal successors, (240), 2 states have internal predecessors, (240), 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-05 11:59:06,643 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:59:06,643 INFO  L93              Difference]: Finished difference Result 9218 states and 9631 transitions.
[2025-02-05 11:59:06,643 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:59:06,644 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 80.0) internal successors, (240), 2 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 481
[2025-02-05 11:59:06,644 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:59:06,659 INFO  L225             Difference]: With dead ends: 9218
[2025-02-05 11:59:06,659 INFO  L226             Difference]: Without dead ends: 9216
[2025-02-05 11:59:06,661 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 483 GetRequests, 480 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-05 11:59:06,662 INFO  L435           NwaCegarLoop]: 70 mSDtfsCounter, 116 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 740 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time
[2025-02-05 11:59:06,662 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 75 Invalid, 772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 740 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2025-02-05 11:59:06,669 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 9216 states.
[2025-02-05 11:59:06,741 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 9216 to 7900.
[2025-02-05 11:59:06,754 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 7900 states, 7899 states have (on average 1.0493733383972654) internal successors, (8289), 7899 states have internal predecessors, (8289), 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-05 11:59:06,766 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7900 states to 7900 states and 8289 transitions.
[2025-02-05 11:59:06,767 INFO  L78                 Accepts]: Start accepts. Automaton has 7900 states and 8289 transitions. Word has length 481
[2025-02-05 11:59:06,767 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:59:06,767 INFO  L471      AbstractCegarLoop]: Abstraction has 7900 states and 8289 transitions.
[2025-02-05 11:59:06,768 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 80.0) internal successors, (240), 2 states have internal predecessors, (240), 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-05 11:59:06,768 INFO  L276                IsEmpty]: Start isEmpty. Operand 7900 states and 8289 transitions.
[2025-02-05 11:59:06,814 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1223
[2025-02-05 11:59:06,814 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:59:06,816 INFO  L218           NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:59:06,825 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2025-02-05 11:59:07,017 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 11:59:07,017 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:59:07,018 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:59:07,018 INFO  L85        PathProgramCache]: Analyzing trace with hash 100508677, now seen corresponding path program 1 times
[2025-02-05 11:59:07,018 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:59:07,018 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280925774]
[2025-02-05 11:59:07,019 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:59:07,019 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:59:07,146 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1222 statements into 1 equivalence classes.
[2025-02-05 11:59:07,206 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1222 of 1222 statements.
[2025-02-05 11:59:07,206 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:59:07,207 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:59:07,937 INFO  L134       CoverageAnalysis]: Checked inductivity of 2677 backedges. 1881 proven. 0 refuted. 0 times theorem prover too weak. 796 trivial. 0 not checked.
[2025-02-05 11:59:07,937 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:59:07,937 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280925774]
[2025-02-05 11:59:07,938 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280925774] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:59:07,938 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:59:07,938 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:59:07,938 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023572997]
[2025-02-05 11:59:07,938 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:59:07,939 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:59:07,939 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:59:07,940 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:59:07,940 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:59:07,941 INFO  L87              Difference]: Start difference. First operand 7900 states and 8289 transitions. Second operand  has 3 states, 3 states have (on average 217.0) internal successors, (651), 3 states have internal predecessors, (651), 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-05 11:59:08,820 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:59:08,821 INFO  L93              Difference]: Finished difference Result 15469 states and 16245 transitions.
[2025-02-05 11:59:08,821 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:59:08,822 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 217.0) internal successors, (651), 3 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1222
[2025-02-05 11:59:08,823 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:59:08,836 INFO  L225             Difference]: With dead ends: 15469
[2025-02-05 11:59:08,837 INFO  L226             Difference]: Without dead ends: 7900
[2025-02-05 11:59:08,842 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:59:08,843 INFO  L435           NwaCegarLoop]: 422 mSDtfsCounter, 222 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 751 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time
[2025-02-05 11:59:08,843 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 427 Invalid, 827 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 751 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2025-02-05 11:59:08,848 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 7900 states.
[2025-02-05 11:59:08,899 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 7900 to 7900.
[2025-02-05 11:59:08,910 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 7900 states, 7899 states have (on average 1.0357007216103304) internal successors, (8181), 7899 states have internal predecessors, (8181), 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-05 11:59:08,919 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7900 states to 7900 states and 8181 transitions.
[2025-02-05 11:59:08,919 INFO  L78                 Accepts]: Start accepts. Automaton has 7900 states and 8181 transitions. Word has length 1222
[2025-02-05 11:59:08,920 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:59:08,921 INFO  L471      AbstractCegarLoop]: Abstraction has 7900 states and 8181 transitions.
[2025-02-05 11:59:08,921 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 217.0) internal successors, (651), 3 states have internal predecessors, (651), 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-05 11:59:08,921 INFO  L276                IsEmpty]: Start isEmpty. Operand 7900 states and 8181 transitions.
[2025-02-05 11:59:08,939 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1224
[2025-02-05 11:59:08,939 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:59:08,940 INFO  L218           NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:59:08,940 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-02-05 11:59:08,940 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:59:08,941 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:59:08,941 INFO  L85        PathProgramCache]: Analyzing trace with hash 1222529071, now seen corresponding path program 1 times
[2025-02-05 11:59:08,941 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:59:08,942 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946962990]
[2025-02-05 11:59:08,942 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:59:08,942 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:59:09,030 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1223 statements into 1 equivalence classes.
[2025-02-05 11:59:09,077 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1223 of 1223 statements.
[2025-02-05 11:59:09,078 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:59:09,078 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:59:10,589 INFO  L134       CoverageAnalysis]: Checked inductivity of 2683 backedges. 1867 proven. 0 refuted. 0 times theorem prover too weak. 816 trivial. 0 not checked.
[2025-02-05 11:59:10,589 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:59:10,590 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946962990]
[2025-02-05 11:59:10,590 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946962990] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:59:10,590 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:59:10,590 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:59:10,590 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4967568]
[2025-02-05 11:59:10,590 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:59:10,591 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:59:10,591 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:59:10,592 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:59:10,592 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:59:10,592 INFO  L87              Difference]: Start difference. First operand 7900 states and 8181 transitions. Second operand  has 3 states, 3 states have (on average 226.0) internal successors, (678), 3 states have internal predecessors, (678), 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-05 11:59:11,339 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:59:11,339 INFO  L93              Difference]: Finished difference Result 15469 states and 16029 transitions.
[2025-02-05 11:59:11,340 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:59:11,340 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 226.0) internal successors, (678), 3 states have internal predecessors, (678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1223
[2025-02-05 11:59:11,341 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:59:11,356 INFO  L225             Difference]: With dead ends: 15469
[2025-02-05 11:59:11,356 INFO  L226             Difference]: Without dead ends: 7900
[2025-02-05 11:59:11,364 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:59:11,365 INFO  L435           NwaCegarLoop]: 33 mSDtfsCounter, 210 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 743 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 819 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-02-05 11:59:11,366 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 37 Invalid, 819 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 743 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-02-05 11:59:11,372 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 7900 states.
[2025-02-05 11:59:11,427 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 7900 to 7900.
[2025-02-05 11:59:11,432 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 7900 states, 7899 states have (on average 1.0332953538422585) internal successors, (8162), 7899 states have internal predecessors, (8162), 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-05 11:59:11,441 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7900 states to 7900 states and 8162 transitions.
[2025-02-05 11:59:11,441 INFO  L78                 Accepts]: Start accepts. Automaton has 7900 states and 8162 transitions. Word has length 1223
[2025-02-05 11:59:11,443 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:59:11,443 INFO  L471      AbstractCegarLoop]: Abstraction has 7900 states and 8162 transitions.
[2025-02-05 11:59:11,443 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 226.0) internal successors, (678), 3 states have internal predecessors, (678), 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-05 11:59:11,443 INFO  L276                IsEmpty]: Start isEmpty. Operand 7900 states and 8162 transitions.
[2025-02-05 11:59:11,462 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1252
[2025-02-05 11:59:11,462 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:59:11,463 INFO  L218           NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:59:11,463 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-02-05 11:59:11,463 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:59:11,464 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:59:11,464 INFO  L85        PathProgramCache]: Analyzing trace with hash -1432226515, now seen corresponding path program 1 times
[2025-02-05 11:59:11,464 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:59:11,464 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617000743]
[2025-02-05 11:59:11,464 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:59:11,464 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:59:11,559 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1251 statements into 1 equivalence classes.
[2025-02-05 11:59:11,607 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1251 of 1251 statements.
[2025-02-05 11:59:11,607 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:59:11,607 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:59:12,872 INFO  L134       CoverageAnalysis]: Checked inductivity of 2791 backedges. 1573 proven. 0 refuted. 0 times theorem prover too weak. 1218 trivial. 0 not checked.
[2025-02-05 11:59:12,873 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:59:12,873 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617000743]
[2025-02-05 11:59:12,873 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617000743] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:59:12,873 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:59:12,874 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:59:12,874 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494503975]
[2025-02-05 11:59:12,874 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:59:12,875 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:59:12,875 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:59:12,876 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:59:12,876 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:59:12,876 INFO  L87              Difference]: Start difference. First operand 7900 states and 8162 transitions. Second operand  has 3 states, 3 states have (on average 215.33333333333334) internal successors, (646), 3 states have internal predecessors, (646), 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-05 11:59:13,527 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:59:13,528 INFO  L93              Difference]: Finished difference Result 16785 states and 17326 transitions.
[2025-02-05 11:59:13,528 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:59:13,529 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 215.33333333333334) internal successors, (646), 3 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1251
[2025-02-05 11:59:13,529 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:59:13,547 INFO  L225             Difference]: With dead ends: 16785
[2025-02-05 11:59:13,547 INFO  L226             Difference]: Without dead ends: 9216
[2025-02-05 11:59:13,555 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:59:13,556 INFO  L435           NwaCegarLoop]: 432 mSDtfsCounter, 224 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 754 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 754 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-02-05 11:59:13,557 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 438 Invalid, 763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 754 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-02-05 11:59:13,566 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 9216 states.
[2025-02-05 11:59:13,665 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 9216 to 8887.
[2025-02-05 11:59:13,676 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 8887 states, 8886 states have (on average 1.0303848750844025) internal successors, (9156), 8886 states have internal predecessors, (9156), 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-05 11:59:13,688 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8887 states to 8887 states and 9156 transitions.
[2025-02-05 11:59:13,689 INFO  L78                 Accepts]: Start accepts. Automaton has 8887 states and 9156 transitions. Word has length 1251
[2025-02-05 11:59:13,690 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:59:13,690 INFO  L471      AbstractCegarLoop]: Abstraction has 8887 states and 9156 transitions.
[2025-02-05 11:59:13,690 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 215.33333333333334) internal successors, (646), 3 states have internal predecessors, (646), 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-05 11:59:13,691 INFO  L276                IsEmpty]: Start isEmpty. Operand 8887 states and 9156 transitions.
[2025-02-05 11:59:13,721 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1270
[2025-02-05 11:59:13,721 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:59:13,722 INFO  L218           NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:59:13,722 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2025-02-05 11:59:13,722 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:59:13,723 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:59:13,723 INFO  L85        PathProgramCache]: Analyzing trace with hash -363156068, now seen corresponding path program 1 times
[2025-02-05 11:59:13,723 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:59:13,723 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459074582]
[2025-02-05 11:59:13,724 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:59:13,724 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:59:13,863 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1269 statements into 1 equivalence classes.
[2025-02-05 11:59:13,948 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1269 of 1269 statements.
[2025-02-05 11:59:13,948 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:59:13,948 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:59:14,514 INFO  L134       CoverageAnalysis]: Checked inductivity of 2821 backedges. 174 proven. 0 refuted. 0 times theorem prover too weak. 2647 trivial. 0 not checked.
[2025-02-05 11:59:14,515 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:59:14,515 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459074582]
[2025-02-05 11:59:14,515 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459074582] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:59:14,515 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:59:14,515 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:59:14,515 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246548512]
[2025-02-05 11:59:14,515 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:59:14,516 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:59:14,516 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:59:14,516 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:59:14,516 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:59:14,517 INFO  L87              Difference]: Start difference. First operand 8887 states and 9156 transitions. Second operand  has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 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-05 11:59:15,165 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:59:15,165 INFO  L93              Difference]: Finished difference Result 18430 states and 18980 transitions.
[2025-02-05 11:59:15,165 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:59:15,166 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1269
[2025-02-05 11:59:15,166 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:59:15,182 INFO  L225             Difference]: With dead ends: 18430
[2025-02-05 11:59:15,182 INFO  L226             Difference]: Without dead ends: 8887
[2025-02-05 11:59:15,191 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:59:15,192 INFO  L435           NwaCegarLoop]: 415 mSDtfsCounter, 309 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 761 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 761 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-02-05 11:59:15,193 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 421 Invalid, 801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 761 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-02-05 11:59:15,199 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 8887 states.
[2025-02-05 11:59:15,256 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 8887 to 8887.
[2025-02-05 11:59:15,265 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 8887 states, 8886 states have (on average 1.0259959486833221) internal successors, (9117), 8886 states have internal predecessors, (9117), 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-05 11:59:15,274 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8887 states to 8887 states and 9117 transitions.
[2025-02-05 11:59:15,275 INFO  L78                 Accepts]: Start accepts. Automaton has 8887 states and 9117 transitions. Word has length 1269
[2025-02-05 11:59:15,276 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:59:15,276 INFO  L471      AbstractCegarLoop]: Abstraction has 8887 states and 9117 transitions.
[2025-02-05 11:59:15,276 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 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-05 11:59:15,276 INFO  L276                IsEmpty]: Start isEmpty. Operand 8887 states and 9117 transitions.
[2025-02-05 11:59:15,293 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1279
[2025-02-05 11:59:15,294 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:59:15,295 INFO  L218           NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:59:15,295 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2025-02-05 11:59:15,295 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:59:15,296 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:59:15,296 INFO  L85        PathProgramCache]: Analyzing trace with hash 1458540970, now seen corresponding path program 1 times
[2025-02-05 11:59:15,296 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:59:15,296 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639076943]
[2025-02-05 11:59:15,296 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:59:15,297 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:59:15,386 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1278 statements into 1 equivalence classes.
[2025-02-05 11:59:15,431 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1278 of 1278 statements.
[2025-02-05 11:59:15,432 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:59:15,432 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:59:16,561 INFO  L134       CoverageAnalysis]: Checked inductivity of 2812 backedges. 2035 proven. 0 refuted. 0 times theorem prover too weak. 777 trivial. 0 not checked.
[2025-02-05 11:59:16,561 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:59:16,561 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639076943]
[2025-02-05 11:59:16,561 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639076943] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:59:16,562 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:59:16,562 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-02-05 11:59:16,562 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580765728]
[2025-02-05 11:59:16,562 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:59:16,563 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-02-05 11:59:16,563 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:59:16,564 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-02-05 11:59:16,564 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2025-02-05 11:59:16,564 INFO  L87              Difference]: Start difference. First operand 8887 states and 9117 transitions. Second operand  has 6 states, 6 states have (on average 128.66666666666666) internal successors, (772), 6 states have internal predecessors, (772), 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-05 11:59:17,746 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:59:17,746 INFO  L93              Difference]: Finished difference Result 17444 states and 17902 transitions.
[2025-02-05 11:59:17,746 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-02-05 11:59:17,747 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 128.66666666666666) internal successors, (772), 6 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1278
[2025-02-05 11:59:17,747 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:59:17,764 INFO  L225             Difference]: With dead ends: 17444
[2025-02-05 11:59:17,764 INFO  L226             Difference]: Without dead ends: 8888
[2025-02-05 11:59:17,772 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2025-02-05 11:59:17,773 INFO  L435           NwaCegarLoop]: 423 mSDtfsCounter, 357 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 1774 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 1783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1774 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time
[2025-02-05 11:59:17,773 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 558 Invalid, 1783 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1774 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2025-02-05 11:59:17,781 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 8888 states.
[2025-02-05 11:59:17,846 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 8888 to 8887.
[2025-02-05 11:59:17,853 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 8887 states, 8886 states have (on average 1.0252081926626153) internal successors, (9110), 8886 states have internal predecessors, (9110), 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-05 11:59:17,862 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8887 states to 8887 states and 9110 transitions.
[2025-02-05 11:59:17,863 INFO  L78                 Accepts]: Start accepts. Automaton has 8887 states and 9110 transitions. Word has length 1278
[2025-02-05 11:59:17,864 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:59:17,864 INFO  L471      AbstractCegarLoop]: Abstraction has 8887 states and 9110 transitions.
[2025-02-05 11:59:17,865 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 128.66666666666666) internal successors, (772), 6 states have internal predecessors, (772), 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-05 11:59:17,865 INFO  L276                IsEmpty]: Start isEmpty. Operand 8887 states and 9110 transitions.
[2025-02-05 11:59:17,882 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1293
[2025-02-05 11:59:17,882 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:59:17,883 INFO  L218           NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:59:17,883 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2025-02-05 11:59:17,883 INFO  L396      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:59:17,884 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:59:17,884 INFO  L85        PathProgramCache]: Analyzing trace with hash -875903520, now seen corresponding path program 1 times
[2025-02-05 11:59:17,884 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:59:17,884 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953185462]
[2025-02-05 11:59:17,884 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:59:17,884 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:59:17,987 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1292 statements into 1 equivalence classes.
[2025-02-05 11:59:18,039 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1292 of 1292 statements.
[2025-02-05 11:59:18,040 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:59:18,040 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:59:19,543 INFO  L134       CoverageAnalysis]: Checked inductivity of 2712 backedges. 1972 proven. 0 refuted. 0 times theorem prover too weak. 740 trivial. 0 not checked.
[2025-02-05 11:59:19,543 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:59:19,543 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953185462]
[2025-02-05 11:59:19,543 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953185462] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:59:19,543 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:59:19,544 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-05 11:59:19,544 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385377964]
[2025-02-05 11:59:19,544 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:59:19,545 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 11:59:19,545 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:59:19,545 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 11:59:19,546 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-05 11:59:19,546 INFO  L87              Difference]: Start difference. First operand 8887 states and 9110 transitions. Second operand  has 4 states, 4 states have (on average 192.75) internal successors, (771), 4 states have internal predecessors, (771), 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-05 11:59:20,479 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:59:20,479 INFO  L93              Difference]: Finished difference Result 17450 states and 17894 transitions.
[2025-02-05 11:59:20,479 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-05 11:59:20,479 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 192.75) internal successors, (771), 4 states have internal predecessors, (771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1292
[2025-02-05 11:59:20,480 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:59:20,495 INFO  L225             Difference]: With dead ends: 17450
[2025-02-05 11:59:20,495 INFO  L226             Difference]: Without dead ends: 8894
[2025-02-05 11:59:20,501 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-05 11:59:20,501 INFO  L435           NwaCegarLoop]: 423 mSDtfsCounter, 217 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 1317 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 1340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time
[2025-02-05 11:59:20,502 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 437 Invalid, 1340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1317 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2025-02-05 11:59:20,507 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 8894 states.
[2025-02-05 11:59:20,564 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 8894 to 8887.
[2025-02-05 11:59:20,570 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 8887 states, 8886 states have (on average 1.024983119513842) internal successors, (9108), 8886 states have internal predecessors, (9108), 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-05 11:59:20,578 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8887 states to 8887 states and 9108 transitions.
[2025-02-05 11:59:20,578 INFO  L78                 Accepts]: Start accepts. Automaton has 8887 states and 9108 transitions. Word has length 1292
[2025-02-05 11:59:20,579 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:59:20,579 INFO  L471      AbstractCegarLoop]: Abstraction has 8887 states and 9108 transitions.
[2025-02-05 11:59:20,580 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 192.75) internal successors, (771), 4 states have internal predecessors, (771), 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-05 11:59:20,580 INFO  L276                IsEmpty]: Start isEmpty. Operand 8887 states and 9108 transitions.
[2025-02-05 11:59:20,599 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1442
[2025-02-05 11:59:20,599 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:59:20,600 INFO  L218           NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:59:20,600 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2025-02-05 11:59:20,600 INFO  L396      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:59:20,601 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:59:20,601 INFO  L85        PathProgramCache]: Analyzing trace with hash 1946378582, now seen corresponding path program 1 times
[2025-02-05 11:59:20,601 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:59:20,601 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657226362]
[2025-02-05 11:59:20,601 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:59:20,601 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:59:20,703 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1441 statements into 1 equivalence classes.
[2025-02-05 11:59:20,765 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1441 of 1441 statements.
[2025-02-05 11:59:20,765 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:59:20,765 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:59:22,056 INFO  L134       CoverageAnalysis]: Checked inductivity of 3945 backedges. 1524 proven. 1181 refuted. 0 times theorem prover too weak. 1240 trivial. 0 not checked.
[2025-02-05 11:59:22,056 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:59:22,056 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657226362]
[2025-02-05 11:59:22,056 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657226362] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-05 11:59:22,056 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1868539507]
[2025-02-05 11:59:22,057 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:59:22,057 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 11:59:22,057 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 11:59:22,059 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-02-05 11:59:22,086 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2025-02-05 11:59:22,224 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1441 statements into 1 equivalence classes.
[2025-02-05 11:59:22,457 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1441 of 1441 statements.
[2025-02-05 11:59:22,458 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:59:22,458 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:59:22,462 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1673 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-02-05 11:59:22,480 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-05 11:59:23,245 INFO  L134       CoverageAnalysis]: Checked inductivity of 3945 backedges. 2288 proven. 0 refuted. 0 times theorem prover too weak. 1657 trivial. 0 not checked.
[2025-02-05 11:59:23,245 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-02-05 11:59:23,246 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1868539507] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:59:23,246 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-02-05 11:59:23,246 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6
[2025-02-05 11:59:23,246 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494595983]
[2025-02-05 11:59:23,246 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:59:23,247 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:59:23,247 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:59:23,248 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:59:23,248 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2025-02-05 11:59:23,248 INFO  L87              Difference]: Start difference. First operand 8887 states and 9108 transitions. Second operand  has 3 states, 3 states have (on average 167.66666666666666) internal successors, (503), 3 states have internal predecessors, (503), 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-05 11:59:23,852 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:59:23,852 INFO  L93              Difference]: Finished difference Result 17443 states and 17883 transitions.
[2025-02-05 11:59:23,852 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:59:23,852 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 167.66666666666666) internal successors, (503), 3 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1441
[2025-02-05 11:59:23,853 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:59:23,867 INFO  L225             Difference]: With dead ends: 17443
[2025-02-05 11:59:23,868 INFO  L226             Difference]: Without dead ends: 8887
[2025-02-05 11:59:23,874 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 1445 GetRequests, 1441 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2025-02-05 11:59:23,874 INFO  L435           NwaCegarLoop]: 371 mSDtfsCounter, 113 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-02-05 11:59:23,874 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 377 Invalid, 774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 756 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-02-05 11:59:23,880 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 8887 states.
[2025-02-05 11:59:23,940 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 8887 to 8887.
[2025-02-05 11:59:23,947 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 8887 states, 8886 states have (on average 1.0221697051541752) internal successors, (9083), 8886 states have internal predecessors, (9083), 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-05 11:59:23,956 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8887 states to 8887 states and 9083 transitions.
[2025-02-05 11:59:23,957 INFO  L78                 Accepts]: Start accepts. Automaton has 8887 states and 9083 transitions. Word has length 1441
[2025-02-05 11:59:23,958 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:59:23,958 INFO  L471      AbstractCegarLoop]: Abstraction has 8887 states and 9083 transitions.
[2025-02-05 11:59:23,958 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 167.66666666666666) internal successors, (503), 3 states have internal predecessors, (503), 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-05 11:59:23,958 INFO  L276                IsEmpty]: Start isEmpty. Operand 8887 states and 9083 transitions.
[2025-02-05 11:59:23,984 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1772
[2025-02-05 11:59:23,984 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:59:23,985 INFO  L218           NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:59:23,994 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2025-02-05 11:59:24,185 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15
[2025-02-05 11:59:24,186 INFO  L396      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:59:24,187 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:59:24,187 INFO  L85        PathProgramCache]: Analyzing trace with hash -877825302, now seen corresponding path program 1 times
[2025-02-05 11:59:24,187 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:59:24,187 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978809489]
[2025-02-05 11:59:24,187 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:59:24,187 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:59:24,298 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1771 statements into 1 equivalence classes.
[2025-02-05 11:59:24,384 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1771 of 1771 statements.
[2025-02-05 11:59:24,384 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:59:24,384 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:59:25,843 INFO  L134       CoverageAnalysis]: Checked inductivity of 6370 backedges. 4415 proven. 132 refuted. 0 times theorem prover too weak. 1823 trivial. 0 not checked.
[2025-02-05 11:59:25,843 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:59:25,843 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978809489]
[2025-02-05 11:59:25,843 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978809489] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-05 11:59:25,843 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2140582960]
[2025-02-05 11:59:25,843 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:59:25,843 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 11:59:25,843 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 11:59:25,847 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-02-05 11:59:25,849 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2025-02-05 11:59:25,996 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1771 statements into 1 equivalence classes.
[2025-02-05 11:59:26,266 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1771 of 1771 statements.
[2025-02-05 11:59:26,267 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:59:26,267 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:59:26,272 INFO  L256         TraceCheckSpWp]: Trace formula consists of 2049 conjuncts, 7 conjuncts are in the unsatisfiable core
[2025-02-05 11:59:26,290 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-05 11:59:28,659 INFO  L134       CoverageAnalysis]: Checked inductivity of 6370 backedges. 2545 proven. 201 refuted. 0 times theorem prover too weak. 3624 trivial. 0 not checked.
[2025-02-05 11:59:28,660 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-02-05 11:59:32,317 INFO  L134       CoverageAnalysis]: Checked inductivity of 6370 backedges. 2545 proven. 201 refuted. 0 times theorem prover too weak. 3624 trivial. 0 not checked.
[2025-02-05 11:59:32,317 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2140582960] provided 0 perfect and 2 imperfect interpolant sequences
[2025-02-05 11:59:32,318 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-02-05 11:59:32,318 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 9
[2025-02-05 11:59:32,318 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280999311]
[2025-02-05 11:59:32,318 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-02-05 11:59:32,321 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2025-02-05 11:59:32,321 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:59:32,322 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2025-02-05 11:59:32,322 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2025-02-05 11:59:32,322 INFO  L87              Difference]: Start difference. First operand 8887 states and 9083 transitions. Second operand  has 9 states, 9 states have (on average 196.0) internal successors, (1764), 9 states have internal predecessors, (1764), 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-05 11:59:37,117 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:59:37,117 INFO  L93              Difference]: Finished difference Result 31261 states and 31987 transitions.
[2025-02-05 11:59:37,117 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2025-02-05 11:59:37,118 INFO  L78                 Accepts]: Start accepts. Automaton has  has 9 states, 9 states have (on average 196.0) internal successors, (1764), 9 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1771
[2025-02-05 11:59:37,118 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:59:37,145 INFO  L225             Difference]: With dead ends: 31261
[2025-02-05 11:59:37,145 INFO  L226             Difference]: Without dead ends: 22705
[2025-02-05 11:59:37,156 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3567 GetRequests, 3549 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380
[2025-02-05 11:59:37,157 INFO  L435           NwaCegarLoop]: 20 mSDtfsCounter, 3200 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 7915 mSolverCounterSat, 470 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3200 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 8385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 470 IncrementalHoareTripleChecker+Valid, 7915 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time
[2025-02-05 11:59:37,157 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [3200 Valid, 100 Invalid, 8385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [470 Valid, 7915 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time]
[2025-02-05 11:59:37,175 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 22705 states.
[2025-02-05 11:59:37,317 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 22705 to 15138.
[2025-02-05 11:59:37,329 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 15138 states, 15137 states have (on average 1.0206117460527184) internal successors, (15449), 15137 states have internal predecessors, (15449), 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-05 11:59:37,344 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 15138 states to 15138 states and 15449 transitions.
[2025-02-05 11:59:37,345 INFO  L78                 Accepts]: Start accepts. Automaton has 15138 states and 15449 transitions. Word has length 1771
[2025-02-05 11:59:37,345 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:59:37,345 INFO  L471      AbstractCegarLoop]: Abstraction has 15138 states and 15449 transitions.
[2025-02-05 11:59:37,346 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 196.0) internal successors, (1764), 9 states have internal predecessors, (1764), 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-05 11:59:37,346 INFO  L276                IsEmpty]: Start isEmpty. Operand 15138 states and 15449 transitions.
[2025-02-05 11:59:37,378 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1864
[2025-02-05 11:59:37,378 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:59:37,379 INFO  L218           NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:59:37,391 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0
[2025-02-05 11:59:37,580 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 11:59:37,580 INFO  L396      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:59:37,581 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:59:37,581 INFO  L85        PathProgramCache]: Analyzing trace with hash 557576515, now seen corresponding path program 1 times
[2025-02-05 11:59:37,581 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:59:37,581 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806925540]
[2025-02-05 11:59:37,581 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:59:37,581 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:59:37,670 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1863 statements into 1 equivalence classes.
[2025-02-05 11:59:37,697 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1863 of 1863 statements.
[2025-02-05 11:59:37,697 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:59:37,697 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:59:40,457 INFO  L134       CoverageAnalysis]: Checked inductivity of 7419 backedges. 2658 proven. 156 refuted. 0 times theorem prover too weak. 4605 trivial. 0 not checked.
[2025-02-05 11:59:40,457 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:59:40,457 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806925540]
[2025-02-05 11:59:40,457 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806925540] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-05 11:59:40,458 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2061305044]
[2025-02-05 11:59:40,458 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:59:40,458 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 11:59:40,458 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 11:59:40,461 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-02-05 11:59:40,462 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2025-02-05 11:59:40,603 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1863 statements into 1 equivalence classes.
[2025-02-05 11:59:40,842 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1863 of 1863 statements.
[2025-02-05 11:59:40,842 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:59:40,842 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:59:40,848 INFO  L256         TraceCheckSpWp]: Trace formula consists of 2160 conjuncts, 4 conjuncts are in the unsatisfiable core
[2025-02-05 11:59:40,863 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-05 11:59:41,549 INFO  L134       CoverageAnalysis]: Checked inductivity of 7419 backedges. 2814 proven. 0 refuted. 0 times theorem prover too weak. 4605 trivial. 0 not checked.
[2025-02-05 11:59:41,550 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-02-05 11:59:41,550 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2061305044] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:59:41,550 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-02-05 11:59:41,551 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7
[2025-02-05 11:59:41,551 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911916917]
[2025-02-05 11:59:41,551 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:59:41,552 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:59:41,552 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:59:41,553 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:59:41,553 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2025-02-05 11:59:41,553 INFO  L87              Difference]: Start difference. First operand 15138 states and 15449 transitions. Second operand  has 3 states, 3 states have (on average 217.33333333333334) internal successors, (652), 3 states have internal predecessors, (652), 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-05 11:59:42,266 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:59:42,266 INFO  L93              Difference]: Finished difference Result 30932 states and 31578 transitions.
[2025-02-05 11:59:42,266 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:59:42,267 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 217.33333333333334) internal successors, (652), 3 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1863
[2025-02-05 11:59:42,267 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:59:42,279 INFO  L225             Difference]: With dead ends: 30932
[2025-02-05 11:59:42,279 INFO  L226             Difference]: Without dead ends: 16125
[2025-02-05 11:59:42,283 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 1867 GetRequests, 1862 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2025-02-05 11:59:42,284 INFO  L435           NwaCegarLoop]: 84 mSDtfsCounter, 173 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 755 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-02-05 11:59:42,284 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 89 Invalid, 790 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 755 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-02-05 11:59:42,295 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 16125 states.
[2025-02-05 11:59:42,399 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 16125 to 15796.
[2025-02-05 11:59:42,412 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 15796 states, 15795 states have (on average 1.0192465970243747) internal successors, (16099), 15795 states have internal predecessors, (16099), 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-05 11:59:42,427 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 15796 states to 15796 states and 16099 transitions.
[2025-02-05 11:59:42,427 INFO  L78                 Accepts]: Start accepts. Automaton has 15796 states and 16099 transitions. Word has length 1863
[2025-02-05 11:59:42,428 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:59:42,428 INFO  L471      AbstractCegarLoop]: Abstraction has 15796 states and 16099 transitions.
[2025-02-05 11:59:42,428 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 217.33333333333334) internal successors, (652), 3 states have internal predecessors, (652), 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-05 11:59:42,428 INFO  L276                IsEmpty]: Start isEmpty. Operand 15796 states and 16099 transitions.
[2025-02-05 11:59:42,451 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1972
[2025-02-05 11:59:42,451 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:59:42,452 INFO  L218           NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:59:42,460 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0
[2025-02-05 11:59:42,652 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17
[2025-02-05 11:59:42,653 INFO  L396      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:59:42,653 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:59:42,654 INFO  L85        PathProgramCache]: Analyzing trace with hash -250817359, now seen corresponding path program 1 times
[2025-02-05 11:59:42,654 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:59:42,654 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755504904]
[2025-02-05 11:59:42,654 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:59:42,654 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:59:42,782 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1971 statements into 1 equivalence classes.
[2025-02-05 11:59:42,844 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1971 of 1971 statements.
[2025-02-05 11:59:42,845 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:59:42,845 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:59:46,049 INFO  L134       CoverageAnalysis]: Checked inductivity of 7432 backedges. 4066 proven. 1581 refuted. 0 times theorem prover too weak. 1785 trivial. 0 not checked.
[2025-02-05 11:59:46,049 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:59:46,049 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755504904]
[2025-02-05 11:59:46,049 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755504904] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-05 11:59:46,049 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1921890779]
[2025-02-05 11:59:46,050 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:59:46,050 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 11:59:46,050 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 11:59:46,052 INFO  L229       MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-02-05 11:59:46,054 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2025-02-05 11:59:46,261 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1971 statements into 1 equivalence classes.
[2025-02-05 11:59:46,583 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1971 of 1971 statements.
[2025-02-05 11:59:46,584 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:59:46,584 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:59:46,593 INFO  L256         TraceCheckSpWp]: Trace formula consists of 2276 conjuncts, 4 conjuncts are in the unsatisfiable core
[2025-02-05 11:59:46,608 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-05 11:59:46,809 INFO  L134       CoverageAnalysis]: Checked inductivity of 7432 backedges. 4042 proven. 0 refuted. 0 times theorem prover too weak. 3390 trivial. 0 not checked.
[2025-02-05 11:59:46,810 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-02-05 11:59:46,810 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1921890779] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:59:46,810 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-02-05 11:59:46,811 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6
[2025-02-05 11:59:46,811 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284440006]
[2025-02-05 11:59:46,811 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:59:46,821 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:59:46,828 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:59:46,829 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:59:46,829 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2025-02-05 11:59:46,829 INFO  L87              Difference]: Start difference. First operand 15796 states and 16099 transitions. Second operand  has 3 states, 3 states have (on average 207.33333333333334) internal successors, (622), 3 states have internal predecessors, (622), 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-05 11:59:47,481 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:59:47,481 INFO  L93              Difference]: Finished difference Result 31919 states and 32529 transitions.
[2025-02-05 11:59:47,482 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:59:47,482 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 207.33333333333334) internal successors, (622), 3 states have internal predecessors, (622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1971
[2025-02-05 11:59:47,483 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:59:47,499 INFO  L225             Difference]: With dead ends: 31919
[2025-02-05 11:59:47,499 INFO  L226             Difference]: Without dead ends: 16125
[2025-02-05 11:59:47,512 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 1976 GetRequests, 1972 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2025-02-05 11:59:47,512 INFO  L435           NwaCegarLoop]: 425 mSDtfsCounter, 263 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 761 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 761 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-02-05 11:59:47,513 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 431 Invalid, 764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 761 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-02-05 11:59:47,525 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 16125 states.
[2025-02-05 11:59:47,627 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 16125 to 15796.
[2025-02-05 11:59:47,636 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 15796 states, 15795 states have (on average 1.0191832858499525) internal successors, (16098), 15795 states have internal predecessors, (16098), 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-05 11:59:47,717 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 15796 states to 15796 states and 16098 transitions.
[2025-02-05 11:59:47,718 INFO  L78                 Accepts]: Start accepts. Automaton has 15796 states and 16098 transitions. Word has length 1971
[2025-02-05 11:59:47,719 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:59:47,719 INFO  L471      AbstractCegarLoop]: Abstraction has 15796 states and 16098 transitions.
[2025-02-05 11:59:47,719 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 207.33333333333334) internal successors, (622), 3 states have internal predecessors, (622), 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-05 11:59:47,719 INFO  L276                IsEmpty]: Start isEmpty. Operand 15796 states and 16098 transitions.
[2025-02-05 11:59:47,744 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 2056
[2025-02-05 11:59:47,745 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:59:47,745 INFO  L218           NwaCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:59:47,753 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-05 11:59:47,946 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 11:59:47,946 INFO  L396      AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:59:47,947 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:59:47,947 INFO  L85        PathProgramCache]: Analyzing trace with hash -110170251, now seen corresponding path program 1 times
[2025-02-05 11:59:47,948 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:59:47,948 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173572537]
[2025-02-05 11:59:47,948 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:59:47,948 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:59:48,120 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2055 statements into 1 equivalence classes.
[2025-02-05 11:59:48,267 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2055 of 2055 statements.
[2025-02-05 11:59:48,272 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:59:48,273 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:59:51,854 INFO  L134       CoverageAnalysis]: Checked inductivity of 8561 backedges. 4005 proven. 505 refuted. 0 times theorem prover too weak. 4051 trivial. 0 not checked.
[2025-02-05 11:59:51,854 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:59:51,855 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173572537]
[2025-02-05 11:59:51,855 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173572537] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-05 11:59:51,855 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [882834606]
[2025-02-05 11:59:51,855 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:59:51,855 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 11:59:51,855 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 11:59:51,858 INFO  L229       MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-02-05 11:59:51,861 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process
[2025-02-05 11:59:52,037 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2055 statements into 1 equivalence classes.
[2025-02-05 11:59:52,296 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2055 of 2055 statements.
[2025-02-05 11:59:52,296 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:59:52,296 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:59:52,303 INFO  L256         TraceCheckSpWp]: Trace formula consists of 2368 conjuncts, 3 conjuncts are in the unsatisfiable core
[2025-02-05 11:59:52,335 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-05 11:59:52,489 INFO  L134       CoverageAnalysis]: Checked inductivity of 8561 backedges. 4885 proven. 0 refuted. 0 times theorem prover too weak. 3676 trivial. 0 not checked.
[2025-02-05 11:59:52,490 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-02-05 11:59:52,490 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [882834606] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:59:52,490 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-02-05 11:59:52,491 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8
[2025-02-05 11:59:52,493 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611546576]
[2025-02-05 11:59:52,493 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:59:52,494 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:59:52,494 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:59:52,495 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:59:52,495 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2025-02-05 11:59:52,496 INFO  L87              Difference]: Start difference. First operand 15796 states and 16098 transitions. Second operand  has 3 states, 3 states have (on average 209.33333333333334) internal successors, (628), 3 states have internal predecessors, (628), 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-05 11:59:53,263 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:59:53,263 INFO  L93              Difference]: Finished difference Result 34551 states and 35210 transitions.
[2025-02-05 11:59:53,264 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:59:53,264 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 209.33333333333334) internal successors, (628), 3 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2055
[2025-02-05 11:59:53,265 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:59:53,281 INFO  L225             Difference]: With dead ends: 34551
[2025-02-05 11:59:53,281 INFO  L226             Difference]: Without dead ends: 18757
[2025-02-05 11:59:53,294 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2063 GetRequests, 2057 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2025-02-05 11:59:53,294 INFO  L435           NwaCegarLoop]: 421 mSDtfsCounter, 221 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 795 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 795 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-02-05 11:59:53,294 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 427 Invalid, 834 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 795 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-02-05 11:59:53,305 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 18757 states.
[2025-02-05 11:59:53,453 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 18757 to 18428.
[2025-02-05 11:59:53,465 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 18428 states, 18427 states have (on average 1.0178542356324958) internal successors, (18756), 18427 states have internal predecessors, (18756), 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-05 11:59:53,485 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 18428 states to 18428 states and 18756 transitions.
[2025-02-05 11:59:53,485 INFO  L78                 Accepts]: Start accepts. Automaton has 18428 states and 18756 transitions. Word has length 2055
[2025-02-05 11:59:53,486 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:59:53,486 INFO  L471      AbstractCegarLoop]: Abstraction has 18428 states and 18756 transitions.
[2025-02-05 11:59:53,486 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 209.33333333333334) internal successors, (628), 3 states have internal predecessors, (628), 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-05 11:59:53,486 INFO  L276                IsEmpty]: Start isEmpty. Operand 18428 states and 18756 transitions.
[2025-02-05 11:59:53,527 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 2087
[2025-02-05 11:59:53,528 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:59:53,528 INFO  L218           NwaCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:59:53,536 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0
[2025-02-05 11:59:53,729 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 11:59:53,729 INFO  L396      AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:59:53,730 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:59:53,730 INFO  L85        PathProgramCache]: Analyzing trace with hash 1662959549, now seen corresponding path program 1 times
[2025-02-05 11:59:53,730 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:59:53,730 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686168561]
[2025-02-05 11:59:53,730 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:59:53,730 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:59:53,820 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2086 statements into 1 equivalence classes.
[2025-02-05 11:59:53,881 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2086 of 2086 statements.
[2025-02-05 11:59:53,881 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:59:53,881 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:59:55,446 INFO  L134       CoverageAnalysis]: Checked inductivity of 8995 backedges. 4148 proven. 0 refuted. 0 times theorem prover too weak. 4847 trivial. 0 not checked.
[2025-02-05 11:59:55,447 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:59:55,447 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686168561]
[2025-02-05 11:59:55,447 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686168561] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:59:55,447 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:59:55,447 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:59:55,448 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171565746]
[2025-02-05 11:59:55,448 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:59:55,449 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:59:55,449 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:59:55,449 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:59:55,450 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:59:55,450 INFO  L87              Difference]: Start difference. First operand 18428 states and 18756 transitions. Second operand  has 3 states, 3 states have (on average 214.0) internal successors, (642), 3 states have internal predecessors, (642), 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-05 11:59:56,179 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:59:56,179 INFO  L93              Difference]: Finished difference Result 39157 states and 39866 transitions.
[2025-02-05 11:59:56,179 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:59:56,180 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 214.0) internal successors, (642), 3 states have internal predecessors, (642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2086
[2025-02-05 11:59:56,180 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:59:56,198 INFO  L225             Difference]: With dead ends: 39157
[2025-02-05 11:59:56,198 INFO  L226             Difference]: Without dead ends: 20731
[2025-02-05 11:59:56,208 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:59:56,209 INFO  L435           NwaCegarLoop]: 37 mSDtfsCounter, 207 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 760 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-02-05 11:59:56,209 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 42 Invalid, 837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 760 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-02-05 11:59:56,218 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 20731 states.
[2025-02-05 11:59:56,314 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 20731 to 18757.
[2025-02-05 11:59:56,324 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 18757 states, 18756 states have (on average 1.0175943698016634) internal successors, (19086), 18756 states have internal predecessors, (19086), 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-05 11:59:56,338 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 18757 states to 18757 states and 19086 transitions.
[2025-02-05 11:59:56,338 INFO  L78                 Accepts]: Start accepts. Automaton has 18757 states and 19086 transitions. Word has length 2086
[2025-02-05 11:59:56,339 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:59:56,339 INFO  L471      AbstractCegarLoop]: Abstraction has 18757 states and 19086 transitions.
[2025-02-05 11:59:56,339 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 214.0) internal successors, (642), 3 states have internal predecessors, (642), 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-05 11:59:56,339 INFO  L276                IsEmpty]: Start isEmpty. Operand 18757 states and 19086 transitions.
[2025-02-05 11:59:56,422 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 2128
[2025-02-05 11:59:56,422 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:59:56,423 INFO  L218           NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:59:56,423 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2025-02-05 11:59:56,423 INFO  L396      AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:59:56,424 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:59:56,424 INFO  L85        PathProgramCache]: Analyzing trace with hash -947783454, now seen corresponding path program 1 times
[2025-02-05 11:59:56,424 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:59:56,424 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860068970]
[2025-02-05 11:59:56,425 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:59:56,425 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms