./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem14_label19.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/Problem14_label19.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 5b769442af2d950aaf4b68e467259bd2e1d98c5d8ca4dcdd5a740ef956112baf
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-c00e63d-m
[2025-02-05 11:49:08,845 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-02-05 11:49:08,881 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:49:08,885 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-02-05 11:49:08,885 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-02-05 11:49:08,899 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-02-05 11:49:08,899 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-02-05 11:49:08,899 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-02-05 11:49:08,900 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-02-05 11:49:08,900 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-02-05 11:49:08,900 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-02-05 11:49:08,900 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-02-05 11:49:08,900 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-02-05 11:49:08,900 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-02-05 11:49:08,900 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-02-05 11:49:08,901 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-02-05 11:49:08,901 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-02-05 11:49:08,901 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-02-05 11:49:08,901 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-02-05 11:49:08,901 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-02-05 11:49:08,901 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-02-05 11:49:08,901 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-02-05 11:49:08,901 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-02-05 11:49:08,901 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-02-05 11:49:08,901 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-02-05 11:49:08,901 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-02-05 11:49:08,901 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-02-05 11:49:08,902 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-02-05 11:49:08,902 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-02-05 11:49:08,902 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-02-05 11:49:08,902 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-02-05 11:49:08,902 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-02-05 11:49:08,902 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-02-05 11:49:08,902 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-02-05 11:49:08,902 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-02-05 11:49:08,902 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-02-05 11:49:08,902 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-02-05 11:49:08,902 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-02-05 11:49:08,902 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-02-05 11:49:08,903 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-02-05 11:49:08,903 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-02-05 11:49:08,903 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-02-05 11:49:08,903 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-02-05 11:49:08,903 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 -> 5b769442af2d950aaf4b68e467259bd2e1d98c5d8ca4dcdd5a740ef956112baf
[2025-02-05 11:49:09,082 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-02-05 11:49:09,101 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-02-05 11:49:09,103 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-02-05 11:49:09,104 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-02-05 11:49:09,104 INFO  L274        PluginConnector]: CDTParser initialized
[2025-02-05 11:49:09,111 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem14_label19.c
[2025-02-05 11:49:10,348 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9e792dd1b/7a199add665b4883a654f7dad42ef376/FLAGc629d1400
[2025-02-05 11:49:10,647 INFO  L384              CDTParser]: Found 1 translation units.
[2025-02-05 11:49:10,651 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label19.c
[2025-02-05 11:49:10,669 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9e792dd1b/7a199add665b4883a654f7dad42ef376/FLAGc629d1400
[2025-02-05 11:49:10,933 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9e792dd1b/7a199add665b4883a654f7dad42ef376
[2025-02-05 11:49:10,935 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-02-05 11:49:10,936 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-02-05 11:49:10,937 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-02-05 11:49:10,937 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-02-05 11:49:10,941 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-02-05 11:49:10,942 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:49:10" (1/1) ...
[2025-02-05 11:49:10,944 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69df3533 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:49:10, skipping insertion in model container
[2025-02-05 11:49:10,944 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:49:10" (1/1) ...
[2025-02-05 11:49:10,978 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-02-05 11:49:11,128 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/Problem14_label19.c[6323,6336]
[2025-02-05 11:49:11,248 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-05 11:49:11,259 INFO  L200         MainTranslator]: Completed pre-run
[2025-02-05 11:49:11,286 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/Problem14_label19.c[6323,6336]
[2025-02-05 11:49:11,373 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-05 11:49:11,389 INFO  L204         MainTranslator]: Completed translation
[2025-02-05 11:49:11,390 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:49:11 WrapperNode
[2025-02-05 11:49:11,390 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-02-05 11:49:11,392 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-02-05 11:49:11,392 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-02-05 11:49:11,393 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-02-05 11:49:11,398 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:49:11" (1/1) ...
[2025-02-05 11:49:11,416 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:49:11" (1/1) ...
[2025-02-05 11:49:11,493 INFO  L138                Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 856
[2025-02-05 11:49:11,495 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-02-05 11:49:11,495 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-02-05 11:49:11,495 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-02-05 11:49:11,495 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-02-05 11:49:11,503 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:49:11" (1/1) ...
[2025-02-05 11:49:11,503 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:49:11" (1/1) ...
[2025-02-05 11:49:11,511 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:49:11" (1/1) ...
[2025-02-05 11:49:11,545 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:49:11,546 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:49:11" (1/1) ...
[2025-02-05 11:49:11,546 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:49:11" (1/1) ...
[2025-02-05 11:49:11,573 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:49:11" (1/1) ...
[2025-02-05 11:49:11,579 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:49:11" (1/1) ...
[2025-02-05 11:49:11,586 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:49:11" (1/1) ...
[2025-02-05 11:49:11,591 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:49:11" (1/1) ...
[2025-02-05 11:49:11,597 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-02-05 11:49:11,599 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-02-05 11:49:11,599 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-02-05 11:49:11,599 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-02-05 11:49:11,600 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:49:11" (1/1) ...
[2025-02-05 11:49:11,605 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-02-05 11:49:11,615 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 11:49:11,629 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:49:11,645 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:49:11,661 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-02-05 11:49:11,661 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-02-05 11:49:11,661 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-02-05 11:49:11,661 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-02-05 11:49:11,708 INFO  L257             CfgBuilder]: Building ICFG
[2025-02-05 11:49:11,710 INFO  L287             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-02-05 11:49:12,821 INFO  L?                        ?]: Removed 123 outVars from TransFormulas that were not future-live.
[2025-02-05 11:49:12,821 INFO  L308             CfgBuilder]: Performing block encoding
[2025-02-05 11:49:12,831 INFO  L332             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-02-05 11:49:12,831 INFO  L337             CfgBuilder]: Removed 0 assume(true) statements.
[2025-02-05 11:49:12,831 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:49:12 BoogieIcfgContainer
[2025-02-05 11:49:12,831 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-02-05 11:49:12,833 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-02-05 11:49:12,833 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-02-05 11:49:12,836 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-02-05 11:49:12,837 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 11:49:10" (1/3) ...
[2025-02-05 11:49:12,837 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@702673e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:49:12, skipping insertion in model container
[2025-02-05 11:49:12,837 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:49:11" (2/3) ...
[2025-02-05 11:49:12,838 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@702673e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:49:12, skipping insertion in model container
[2025-02-05 11:49:12,838 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:49:12" (3/3) ...
[2025-02-05 11:49:12,839 INFO  L128   eAbstractionObserver]: Analyzing ICFG Problem14_label19.c
[2025-02-05 11:49:12,849 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-02-05 11:49:12,851 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG Problem14_label19.c that has 1 procedures, 245 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-02-05 11:49:12,886 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-02-05 11:49:12,893 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;@77f09beb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-02-05 11:49:12,894 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-02-05 11:49:12,896 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 245 states, 243 states have (on average 1.7325102880658436) internal successors, (421), 244 states have internal predecessors, (421), 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:49:12,901 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 63
[2025-02-05 11:49:12,901 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:49:12,901 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:49:12,902 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:49:12,905 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:49:12,905 INFO  L85        PathProgramCache]: Analyzing trace with hash 609789482, now seen corresponding path program 1 times
[2025-02-05 11:49:12,910 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:49:12,910 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214524449]
[2025-02-05 11:49:12,910 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:49:12,911 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:49:12,963 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes.
[2025-02-05 11:49:12,988 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements.
[2025-02-05 11:49:12,989 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:49:12,989 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:49:13,264 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:49:13,265 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:49:13,265 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214524449]
[2025-02-05 11:49:13,265 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214524449] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:49:13,265 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:49:13,265 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:49:13,266 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627561984]
[2025-02-05 11:49:13,267 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:49:13,269 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 11:49:13,269 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:49:13,280 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 11:49:13,280 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-05 11:49:13,282 INFO  L87              Difference]: Start difference. First operand  has 245 states, 243 states have (on average 1.7325102880658436) internal successors, (421), 244 states have internal predecessors, (421), 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 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 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:49:14,527 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:49:14,528 INFO  L93              Difference]: Finished difference Result 850 states and 1554 transitions.
[2025-02-05 11:49:14,529 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 11:49:14,530 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 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 62
[2025-02-05 11:49:14,530 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:49:14,539 INFO  L225             Difference]: With dead ends: 850
[2025-02-05 11:49:14,542 INFO  L226             Difference]: Without dead ends: 538
[2025-02-05 11:49:14,547 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:49:14,551 INFO  L435           NwaCegarLoop]: 174 mSDtfsCounter, 465 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 1337 mSolverCounterSat, 266 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 465 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 1603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 266 IncrementalHoareTripleChecker+Valid, 1337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time
[2025-02-05 11:49:14,552 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [465 Valid, 194 Invalid, 1603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [266 Valid, 1337 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time]
[2025-02-05 11:49:14,569 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 538 states.
[2025-02-05 11:49:14,621 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 538.
[2025-02-05 11:49:14,624 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 538 states, 537 states have (on average 1.4487895716945995) internal successors, (778), 537 states have internal predecessors, (778), 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:49:14,627 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 778 transitions.
[2025-02-05 11:49:14,629 INFO  L78                 Accepts]: Start accepts. Automaton has 538 states and 778 transitions. Word has length 62
[2025-02-05 11:49:14,633 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:49:14,633 INFO  L471      AbstractCegarLoop]: Abstraction has 538 states and 778 transitions.
[2025-02-05 11:49:14,633 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 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:49:14,633 INFO  L276                IsEmpty]: Start isEmpty. Operand 538 states and 778 transitions.
[2025-02-05 11:49:14,636 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 143
[2025-02-05 11:49:14,640 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:49:14,641 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-02-05 11:49:14,641 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2025-02-05 11:49:14,641 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:49:14,642 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:49:14,642 INFO  L85        PathProgramCache]: Analyzing trace with hash 733023489, now seen corresponding path program 1 times
[2025-02-05 11:49:14,642 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:49:14,642 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824481462]
[2025-02-05 11:49:14,642 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:49:14,642 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:49:14,688 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes.
[2025-02-05 11:49:14,738 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements.
[2025-02-05 11:49:14,740 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:49:14,741 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:49:15,088 INFO  L134       CoverageAnalysis]: Checked inductivity of 59 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 11:49:15,089 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:49:15,090 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824481462]
[2025-02-05 11:49:15,090 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824481462] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:49:15,090 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:49:15,090 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:49:15,090 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894294869]
[2025-02-05 11:49:15,090 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:49:15,091 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 11:49:15,092 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:49:15,092 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 11:49:15,092 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-02-05 11:49:15,093 INFO  L87              Difference]: Start difference. First operand 538 states and 778 transitions. Second operand  has 4 states, 4 states have (on average 35.5) internal successors, (142), 3 states have internal predecessors, (142), 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:49:15,848 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:49:15,849 INFO  L93              Difference]: Finished difference Result 1283 states and 1979 transitions.
[2025-02-05 11:49:15,849 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 11:49:15,849 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 35.5) internal successors, (142), 3 states have internal predecessors, (142), 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 142
[2025-02-05 11:49:15,850 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:49:15,852 INFO  L225             Difference]: With dead ends: 1283
[2025-02-05 11:49:15,852 INFO  L226             Difference]: Without dead ends: 896
[2025-02-05 11:49:15,854 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-02-05 11:49:15,854 INFO  L435           NwaCegarLoop]: 112 mSDtfsCounter, 118 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 663 mSolverCounterSat, 188 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 851 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 188 IncrementalHoareTripleChecker+Valid, 663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-02-05 11:49:15,854 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 121 Invalid, 851 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [188 Valid, 663 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-02-05 11:49:15,855 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 896 states.
[2025-02-05 11:49:15,870 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 896 to 894.
[2025-02-05 11:49:15,871 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 894 states, 893 states have (on average 1.1836506159014557) internal successors, (1057), 893 states have internal predecessors, (1057), 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:49:15,874 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 894 states and 1057 transitions.
[2025-02-05 11:49:15,874 INFO  L78                 Accepts]: Start accepts. Automaton has 894 states and 1057 transitions. Word has length 142
[2025-02-05 11:49:15,874 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:49:15,874 INFO  L471      AbstractCegarLoop]: Abstraction has 894 states and 1057 transitions.
[2025-02-05 11:49:15,874 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 35.5) internal successors, (142), 3 states have internal predecessors, (142), 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:49:15,874 INFO  L276                IsEmpty]: Start isEmpty. Operand 894 states and 1057 transitions.
[2025-02-05 11:49:15,876 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 234
[2025-02-05 11:49:15,876 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:49:15,877 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:49:15,877 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-02-05 11:49:15,877 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:49:15,877 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:49:15,877 INFO  L85        PathProgramCache]: Analyzing trace with hash -131410699, now seen corresponding path program 1 times
[2025-02-05 11:49:15,877 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:49:15,878 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121980020]
[2025-02-05 11:49:15,878 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:49:15,878 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:49:15,901 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 233 statements into 1 equivalence classes.
[2025-02-05 11:49:15,925 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 233 of 233 statements.
[2025-02-05 11:49:15,926 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:49:15,926 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:49:16,339 INFO  L134       CoverageAnalysis]: Checked inductivity of 184 backedges. 119 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 11:49:16,341 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:49:16,342 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121980020]
[2025-02-05 11:49:16,342 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121980020] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-05 11:49:16,342 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1401541881]
[2025-02-05 11:49:16,342 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:49:16,342 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 11:49:16,342 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 11:49:16,348 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:49:16,351 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:49:16,407 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 233 statements into 1 equivalence classes.
[2025-02-05 11:49:16,445 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 233 of 233 statements.
[2025-02-05 11:49:16,445 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:49:16,445 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:49:16,448 INFO  L256         TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-02-05 11:49:16,455 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-05 11:49:16,686 INFO  L134       CoverageAnalysis]: Checked inductivity of 184 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked.
[2025-02-05 11:49:16,686 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-02-05 11:49:16,686 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1401541881] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:49:16,686 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-02-05 11:49:16,686 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6
[2025-02-05 11:49:16,686 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974980231]
[2025-02-05 11:49:16,686 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:49:16,686 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:49:16,686 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:49:16,687 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:49:16,687 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2025-02-05 11:49:16,687 INFO  L87              Difference]: Start difference. First operand 894 states and 1057 transitions. Second operand  has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 2 states have internal predecessors, (169), 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:49:17,162 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:49:17,163 INFO  L93              Difference]: Finished difference Result 1964 states and 2439 transitions.
[2025-02-05 11:49:17,163 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:49:17,163 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 2 states have internal predecessors, (169), 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 233
[2025-02-05 11:49:17,164 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:49:17,168 INFO  L225             Difference]: With dead ends: 1964
[2025-02-05 11:49:17,168 INFO  L226             Difference]: Without dead ends: 1250
[2025-02-05 11:49:17,169 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 232 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:49:17,170 INFO  L435           NwaCegarLoop]: 44 mSDtfsCounter, 84 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-02-05 11:49:17,170 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 47 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-02-05 11:49:17,171 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1250 states.
[2025-02-05 11:49:17,189 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 1250.
[2025-02-05 11:49:17,191 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1250 states, 1249 states have (on average 1.188150520416333) internal successors, (1484), 1249 states have internal predecessors, (1484), 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:49:17,194 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1250 states to 1250 states and 1484 transitions.
[2025-02-05 11:49:17,194 INFO  L78                 Accepts]: Start accepts. Automaton has 1250 states and 1484 transitions. Word has length 233
[2025-02-05 11:49:17,195 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:49:17,195 INFO  L471      AbstractCegarLoop]: Abstraction has 1250 states and 1484 transitions.
[2025-02-05 11:49:17,195 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 2 states have internal predecessors, (169), 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:49:17,195 INFO  L276                IsEmpty]: Start isEmpty. Operand 1250 states and 1484 transitions.
[2025-02-05 11:49:17,197 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 237
[2025-02-05 11:49:17,197 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:49:17,197 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:17,204 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2025-02-05 11:49:17,398 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 11:49:17,398 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:49:17,399 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:49:17,399 INFO  L85        PathProgramCache]: Analyzing trace with hash -1802789660, now seen corresponding path program 1 times
[2025-02-05 11:49:17,399 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:49:17,399 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435950734]
[2025-02-05 11:49:17,399 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:49:17,399 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:49:17,423 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 236 statements into 1 equivalence classes.
[2025-02-05 11:49:17,442 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 236 of 236 statements.
[2025-02-05 11:49:17,442 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:49:17,442 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:49:17,742 INFO  L134       CoverageAnalysis]: Checked inductivity of 187 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 11:49:17,742 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:49:17,742 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435950734]
[2025-02-05 11:49:17,742 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435950734] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:49:17,742 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:49:17,742 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:49:17,742 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549047638]
[2025-02-05 11:49:17,742 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:49:17,742 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:49:17,742 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:49:17,743 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:49:17,743 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:49:17,743 INFO  L87              Difference]: Start difference. First operand 1250 states and 1484 transitions. Second operand  has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 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:49:18,235 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:49:18,236 INFO  L93              Difference]: Finished difference Result 2854 states and 3434 transitions.
[2025-02-05 11:49:18,236 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:49:18,236 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 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 236
[2025-02-05 11:49:18,237 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:49:18,241 INFO  L225             Difference]: With dead ends: 2854
[2025-02-05 11:49:18,242 INFO  L226             Difference]: Without dead ends: 1784
[2025-02-05 11:49:18,243 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:49:18,244 INFO  L435           NwaCegarLoop]: 73 mSDtfsCounter, 111 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-02-05 11:49:18,244 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 77 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-02-05 11:49:18,245 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1784 states.
[2025-02-05 11:49:18,264 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1784 to 1784.
[2025-02-05 11:49:18,267 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1784 states, 1783 states have (on average 1.1542344363432417) internal successors, (2058), 1783 states have internal predecessors, (2058), 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:49:18,271 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1784 states to 1784 states and 2058 transitions.
[2025-02-05 11:49:18,271 INFO  L78                 Accepts]: Start accepts. Automaton has 1784 states and 2058 transitions. Word has length 236
[2025-02-05 11:49:18,272 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:49:18,272 INFO  L471      AbstractCegarLoop]: Abstraction has 1784 states and 2058 transitions.
[2025-02-05 11:49:18,272 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 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:49:18,272 INFO  L276                IsEmpty]: Start isEmpty. Operand 1784 states and 2058 transitions.
[2025-02-05 11:49:18,275 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 354
[2025-02-05 11:49:18,275 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:49:18,275 INFO  L218           NwaCegarLoop]: trace histogram [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, 2, 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]
[2025-02-05 11:49:18,275 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-02-05 11:49:18,275 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:49:18,276 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:49:18,276 INFO  L85        PathProgramCache]: Analyzing trace with hash -825835076, now seen corresponding path program 1 times
[2025-02-05 11:49:18,276 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:49:18,276 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642575087]
[2025-02-05 11:49:18,276 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:49:18,276 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:49:18,301 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 353 statements into 1 equivalence classes.
[2025-02-05 11:49:18,321 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 353 of 353 statements.
[2025-02-05 11:49:18,321 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:49:18,321 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:49:18,574 INFO  L134       CoverageAnalysis]: Checked inductivity of 442 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 263 trivial. 0 not checked.
[2025-02-05 11:49:18,574 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:49:18,574 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642575087]
[2025-02-05 11:49:18,575 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642575087] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:49:18,575 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:49:18,575 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:49:18,575 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428256695]
[2025-02-05 11:49:18,575 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:49:18,575 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 11:49:18,576 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:49:18,576 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 11:49:18,576 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-02-05 11:49:18,576 INFO  L87              Difference]: Start difference. First operand 1784 states and 2058 transitions. Second operand  has 4 states, 4 states have (on average 42.75) internal successors, (171), 3 states have internal predecessors, (171), 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:49:19,084 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:49:19,085 INFO  L93              Difference]: Finished difference Result 3417 states and 4000 transitions.
[2025-02-05 11:49:19,085 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 11:49:19,085 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 42.75) internal successors, (171), 3 states have internal predecessors, (171), 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 353
[2025-02-05 11:49:19,086 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:49:19,091 INFO  L225             Difference]: With dead ends: 3417
[2025-02-05 11:49:19,091 INFO  L226             Difference]: Without dead ends: 1962
[2025-02-05 11:49:19,093 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-02-05 11:49:19,093 INFO  L435           NwaCegarLoop]: 9 mSDtfsCounter, 124 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-02-05 11:49:19,094 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 17 Invalid, 745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-02-05 11:49:19,095 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1962 states.
[2025-02-05 11:49:19,115 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1962 to 1784.
[2025-02-05 11:49:19,118 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1784 states, 1783 states have (on average 1.1099270891755468) internal successors, (1979), 1783 states have internal predecessors, (1979), 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:49:19,122 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1784 states to 1784 states and 1979 transitions.
[2025-02-05 11:49:19,123 INFO  L78                 Accepts]: Start accepts. Automaton has 1784 states and 1979 transitions. Word has length 353
[2025-02-05 11:49:19,123 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:49:19,123 INFO  L471      AbstractCegarLoop]: Abstraction has 1784 states and 1979 transitions.
[2025-02-05 11:49:19,123 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 42.75) internal successors, (171), 3 states have internal predecessors, (171), 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:49:19,123 INFO  L276                IsEmpty]: Start isEmpty. Operand 1784 states and 1979 transitions.
[2025-02-05 11:49:19,127 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 443
[2025-02-05 11:49:19,127 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:49:19,127 INFO  L218           NwaCegarLoop]: trace histogram [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, 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]
[2025-02-05 11:49:19,128 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-02-05 11:49:19,128 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:49:19,128 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:49:19,129 INFO  L85        PathProgramCache]: Analyzing trace with hash -2086783488, now seen corresponding path program 1 times
[2025-02-05 11:49:19,129 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:49:19,129 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61362559]
[2025-02-05 11:49:19,129 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:49:19,129 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:49:19,158 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 442 statements into 1 equivalence classes.
[2025-02-05 11:49:19,180 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 442 of 442 statements.
[2025-02-05 11:49:19,180 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:49:19,181 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:49:19,842 INFO  L134       CoverageAnalysis]: Checked inductivity of 493 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 322 trivial. 0 not checked.
[2025-02-05 11:49:19,842 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:49:19,842 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61362559]
[2025-02-05 11:49:19,842 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61362559] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-05 11:49:19,842 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1236811693]
[2025-02-05 11:49:19,842 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:49:19,842 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 11:49:19,842 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 11:49:19,846 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:49:19,863 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:49:19,917 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 442 statements into 1 equivalence classes.
[2025-02-05 11:49:19,988 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 442 of 442 statements.
[2025-02-05 11:49:19,988 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:49:19,988 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:49:19,990 INFO  L256         TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-02-05 11:49:19,999 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-05 11:49:20,566 INFO  L134       CoverageAnalysis]: Checked inductivity of 493 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 493 trivial. 0 not checked.
[2025-02-05 11:49:20,566 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-02-05 11:49:20,567 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1236811693] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:49:20,567 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-02-05 11:49:20,567 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4
[2025-02-05 11:49:20,567 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720304135]
[2025-02-05 11:49:20,567 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:49:20,567 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:49:20,568 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:49:20,568 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:49:20,568 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-05 11:49:20,568 INFO  L87              Difference]: Start difference. First operand 1784 states and 1979 transitions. Second operand  has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 2 states have internal predecessors, (175), 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:49:20,953 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:49:20,954 INFO  L93              Difference]: Finished difference Result 2498 states and 2748 transitions.
[2025-02-05 11:49:20,956 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:49:20,957 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 2 states have internal predecessors, (175), 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 442
[2025-02-05 11:49:20,957 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:49:20,963 INFO  L225             Difference]: With dead ends: 2498
[2025-02-05 11:49:20,963 INFO  L226             Difference]: Without dead ends: 2496
[2025-02-05 11:49:20,964 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 444 GetRequests, 441 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:49:20,966 INFO  L435           NwaCegarLoop]: 7 mSDtfsCounter, 27 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-02-05 11:49:20,967 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 11 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-02-05 11:49:20,970 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2496 states.
[2025-02-05 11:49:20,988 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2496 to 1606.
[2025-02-05 11:49:20,990 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1606 states, 1605 states have (on average 1.0859813084112149) internal successors, (1743), 1605 states have internal predecessors, (1743), 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:49:20,993 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1606 states to 1606 states and 1743 transitions.
[2025-02-05 11:49:20,994 INFO  L78                 Accepts]: Start accepts. Automaton has 1606 states and 1743 transitions. Word has length 442
[2025-02-05 11:49:20,995 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:49:20,995 INFO  L471      AbstractCegarLoop]: Abstraction has 1606 states and 1743 transitions.
[2025-02-05 11:49:20,995 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 2 states have internal predecessors, (175), 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:49:20,995 INFO  L276                IsEmpty]: Start isEmpty. Operand 1606 states and 1743 transitions.
[2025-02-05 11:49:20,999 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 449
[2025-02-05 11:49:20,999 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:49:20,999 INFO  L218           NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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]
[2025-02-05 11:49:21,008 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:49:21,203 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 11:49:21,204 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:49:21,204 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:49:21,204 INFO  L85        PathProgramCache]: Analyzing trace with hash -1834281500, now seen corresponding path program 1 times
[2025-02-05 11:49:21,204 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:49:21,205 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065042004]
[2025-02-05 11:49:21,205 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:49:21,205 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:49:21,244 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 448 statements into 1 equivalence classes.
[2025-02-05 11:49:21,265 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 448 of 448 statements.
[2025-02-05 11:49:21,265 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:49:21,265 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:49:21,613 INFO  L134       CoverageAnalysis]: Checked inductivity of 759 backedges. 445 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked.
[2025-02-05 11:49:21,614 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:49:21,614 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065042004]
[2025-02-05 11:49:21,614 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065042004] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:49:21,614 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:49:21,614 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:49:21,614 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625104953]
[2025-02-05 11:49:21,614 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:49:21,614 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:49:21,614 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:49:21,615 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:49:21,615 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:49:21,615 INFO  L87              Difference]: Start difference. First operand 1606 states and 1743 transitions. Second operand  has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 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:49:22,034 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:49:22,035 INFO  L93              Difference]: Finished difference Result 3566 states and 3923 transitions.
[2025-02-05 11:49:22,035 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:49:22,035 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 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 448
[2025-02-05 11:49:22,036 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:49:22,041 INFO  L225             Difference]: With dead ends: 3566
[2025-02-05 11:49:22,041 INFO  L226             Difference]: Without dead ends: 2140
[2025-02-05 11:49:22,043 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:49:22,043 INFO  L435           NwaCegarLoop]: 240 mSDtfsCounter, 110 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-02-05 11:49:22,044 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 245 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-02-05 11:49:22,045 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2140 states.
[2025-02-05 11:49:22,064 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2140 to 1784.
[2025-02-05 11:49:22,066 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1784 states, 1783 states have (on average 1.0779584969153113) internal successors, (1922), 1783 states have internal predecessors, (1922), 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:49:22,069 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1784 states to 1784 states and 1922 transitions.
[2025-02-05 11:49:22,069 INFO  L78                 Accepts]: Start accepts. Automaton has 1784 states and 1922 transitions. Word has length 448
[2025-02-05 11:49:22,070 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:49:22,070 INFO  L471      AbstractCegarLoop]: Abstraction has 1784 states and 1922 transitions.
[2025-02-05 11:49:22,070 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 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:49:22,070 INFO  L276                IsEmpty]: Start isEmpty. Operand 1784 states and 1922 transitions.
[2025-02-05 11:49:22,074 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 456
[2025-02-05 11:49:22,074 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:49:22,074 INFO  L218           NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:49:22,074 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-02-05 11:49:22,074 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:49:22,075 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:49:22,075 INFO  L85        PathProgramCache]: Analyzing trace with hash 1219163251, now seen corresponding path program 1 times
[2025-02-05 11:49:22,075 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:49:22,075 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779848242]
[2025-02-05 11:49:22,075 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:49:22,075 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:49:22,119 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 455 statements into 1 equivalence classes.
[2025-02-05 11:49:22,138 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 455 of 455 statements.
[2025-02-05 11:49:22,138 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:49:22,138 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:49:22,413 INFO  L134       CoverageAnalysis]: Checked inductivity of 759 backedges. 445 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked.
[2025-02-05 11:49:22,413 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:49:22,413 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779848242]
[2025-02-05 11:49:22,414 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779848242] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:49:22,414 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:49:22,414 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:49:22,414 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618554025]
[2025-02-05 11:49:22,414 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:49:22,415 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:49:22,418 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:49:22,418 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:49:22,419 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:49:22,419 INFO  L87              Difference]: Start difference. First operand 1784 states and 1922 transitions. Second operand  has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 3 states have internal predecessors, (247), 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:49:22,856 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:49:22,857 INFO  L93              Difference]: Finished difference Result 3744 states and 4100 transitions.
[2025-02-05 11:49:22,857 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:49:22,857 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 3 states have internal predecessors, (247), 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 455
[2025-02-05 11:49:22,858 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:49:22,862 INFO  L225             Difference]: With dead ends: 3744
[2025-02-05 11:49:22,863 INFO  L226             Difference]: Without dead ends: 2140
[2025-02-05 11:49:22,864 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:49:22,865 INFO  L435           NwaCegarLoop]: 215 mSDtfsCounter, 113 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-02-05 11:49:22,865 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 220 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-02-05 11:49:22,867 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2140 states.
[2025-02-05 11:49:22,886 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2140 to 1962.
[2025-02-05 11:49:22,888 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1962 states, 1961 states have (on average 1.0882202957674656) internal successors, (2134), 1961 states have internal predecessors, (2134), 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:49:22,891 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1962 states to 1962 states and 2134 transitions.
[2025-02-05 11:49:22,891 INFO  L78                 Accepts]: Start accepts. Automaton has 1962 states and 2134 transitions. Word has length 455
[2025-02-05 11:49:22,892 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:49:22,892 INFO  L471      AbstractCegarLoop]: Abstraction has 1962 states and 2134 transitions.
[2025-02-05 11:49:22,892 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 3 states have internal predecessors, (247), 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:49:22,892 INFO  L276                IsEmpty]: Start isEmpty. Operand 1962 states and 2134 transitions.
[2025-02-05 11:49:22,896 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 497
[2025-02-05 11:49:22,896 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:49:22,897 INFO  L218           NwaCegarLoop]: trace histogram [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, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:49:22,897 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-02-05 11:49:22,897 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:49:22,897 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:49:22,898 INFO  L85        PathProgramCache]: Analyzing trace with hash -394376232, now seen corresponding path program 1 times
[2025-02-05 11:49:22,898 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:49:22,898 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346624276]
[2025-02-05 11:49:22,898 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:49:22,898 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:49:22,924 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 496 statements into 1 equivalence classes.
[2025-02-05 11:49:22,943 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 496 of 496 statements.
[2025-02-05 11:49:22,943 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:49:22,943 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:49:23,108 INFO  L134       CoverageAnalysis]: Checked inductivity of 873 backedges. 559 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked.
[2025-02-05 11:49:23,109 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:49:23,109 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346624276]
[2025-02-05 11:49:23,109 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346624276] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:49:23,109 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:49:23,109 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:49:23,109 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535925635]
[2025-02-05 11:49:23,110 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:49:23,110 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:49:23,110 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:49:23,110 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:49:23,111 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:49:23,111 INFO  L87              Difference]: Start difference. First operand 1962 states and 2134 transitions. Second operand  has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 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:49:23,590 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:49:23,590 INFO  L93              Difference]: Finished difference Result 4634 states and 5096 transitions.
[2025-02-05 11:49:23,590 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:49:23,590 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 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 496
[2025-02-05 11:49:23,591 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:49:23,597 INFO  L225             Difference]: With dead ends: 4634
[2025-02-05 11:49:23,597 INFO  L226             Difference]: Without dead ends: 2852
[2025-02-05 11:49:23,599 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:49:23,600 INFO  L435           NwaCegarLoop]: 47 mSDtfsCounter, 74 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-02-05 11:49:23,600 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 50 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-02-05 11:49:23,603 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2852 states.
[2025-02-05 11:49:23,630 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2852 to 2852.
[2025-02-05 11:49:23,633 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2852 states, 2851 states have (on average 1.0827779726411786) internal successors, (3087), 2851 states have internal predecessors, (3087), 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:49:23,638 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2852 states to 2852 states and 3087 transitions.
[2025-02-05 11:49:23,639 INFO  L78                 Accepts]: Start accepts. Automaton has 2852 states and 3087 transitions. Word has length 496
[2025-02-05 11:49:23,640 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:49:23,640 INFO  L471      AbstractCegarLoop]: Abstraction has 2852 states and 3087 transitions.
[2025-02-05 11:49:23,640 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 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:49:23,640 INFO  L276                IsEmpty]: Start isEmpty. Operand 2852 states and 3087 transitions.
[2025-02-05 11:49:23,644 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 533
[2025-02-05 11:49:23,645 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:49:23,645 INFO  L218           NwaCegarLoop]: trace histogram [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, 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, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:49:23,645 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-02-05 11:49:23,645 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:49:23,646 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:49:23,646 INFO  L85        PathProgramCache]: Analyzing trace with hash -847427712, now seen corresponding path program 1 times
[2025-02-05 11:49:23,646 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:49:23,646 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291129509]
[2025-02-05 11:49:23,646 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:49:23,646 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:49:23,686 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 532 statements into 1 equivalence classes.
[2025-02-05 11:49:23,712 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 532 of 532 statements.
[2025-02-05 11:49:23,713 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:49:23,713 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:49:24,015 INFO  L134       CoverageAnalysis]: Checked inductivity of 1118 backedges. 804 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked.
[2025-02-05 11:49:24,016 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:49:24,016 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291129509]
[2025-02-05 11:49:24,016 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291129509] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:49:24,016 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:49:24,016 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-05 11:49:24,016 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931973143]
[2025-02-05 11:49:24,016 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:49:24,017 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 11:49:24,017 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:49:24,017 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 11:49:24,018 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-02-05 11:49:24,018 INFO  L87              Difference]: Start difference. First operand 2852 states and 3087 transitions. Second operand  has 4 states, 4 states have (on average 81.0) internal successors, (324), 4 states have internal predecessors, (324), 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:49:24,643 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:49:24,644 INFO  L93              Difference]: Finished difference Result 5880 states and 6375 transitions.
[2025-02-05 11:49:24,644 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 11:49:24,644 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 81.0) internal successors, (324), 4 states have internal predecessors, (324), 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 532
[2025-02-05 11:49:24,645 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:49:24,653 INFO  L225             Difference]: With dead ends: 5880
[2025-02-05 11:49:24,653 INFO  L226             Difference]: Without dead ends: 3208
[2025-02-05 11:49:24,656 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-02-05 11:49:24,657 INFO  L435           NwaCegarLoop]: 60 mSDtfsCounter, 214 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 863 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 863 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-02-05 11:49:24,657 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 68 Invalid, 900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 863 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-02-05 11:49:24,660 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3208 states.
[2025-02-05 11:49:24,689 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3208 to 3030.
[2025-02-05 11:49:24,692 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3030 states, 3029 states have (on average 1.0762627930009905) internal successors, (3260), 3029 states have internal predecessors, (3260), 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:49:24,695 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3030 states to 3030 states and 3260 transitions.
[2025-02-05 11:49:24,696 INFO  L78                 Accepts]: Start accepts. Automaton has 3030 states and 3260 transitions. Word has length 532
[2025-02-05 11:49:24,696 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:49:24,696 INFO  L471      AbstractCegarLoop]: Abstraction has 3030 states and 3260 transitions.
[2025-02-05 11:49:24,696 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 81.0) internal successors, (324), 4 states have internal predecessors, (324), 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:49:24,697 INFO  L276                IsEmpty]: Start isEmpty. Operand 3030 states and 3260 transitions.
[2025-02-05 11:49:24,699 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 611
[2025-02-05 11:49:24,699 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:49:24,700 INFO  L218           NwaCegarLoop]: trace histogram [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, 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, 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, 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]
[2025-02-05 11:49:24,700 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-02-05 11:49:24,700 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:49:24,701 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:49:24,702 INFO  L85        PathProgramCache]: Analyzing trace with hash 784335107, now seen corresponding path program 1 times
[2025-02-05 11:49:24,702 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:49:24,702 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301984697]
[2025-02-05 11:49:24,702 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:49:24,702 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:49:24,733 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 610 statements into 1 equivalence classes.
[2025-02-05 11:49:24,752 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 610 of 610 statements.
[2025-02-05 11:49:24,752 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:49:24,753 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:49:25,032 INFO  L134       CoverageAnalysis]: Checked inductivity of 1211 backedges. 574 proven. 0 refuted. 0 times theorem prover too weak. 637 trivial. 0 not checked.
[2025-02-05 11:49:25,033 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:49:25,033 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301984697]
[2025-02-05 11:49:25,033 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301984697] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:49:25,033 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:49:25,033 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:49:25,033 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100802236]
[2025-02-05 11:49:25,033 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:49:25,034 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:49:25,034 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:49:25,034 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:49:25,034 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:49:25,034 INFO  L87              Difference]: Start difference. First operand 3030 states and 3260 transitions. Second operand  has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 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:49:25,440 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:49:25,441 INFO  L93              Difference]: Finished difference Result 6236 states and 6776 transitions.
[2025-02-05 11:49:25,441 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:49:25,441 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 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 610
[2025-02-05 11:49:25,442 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:49:25,451 INFO  L225             Difference]: With dead ends: 6236
[2025-02-05 11:49:25,451 INFO  L226             Difference]: Without dead ends: 3386
[2025-02-05 11:49:25,455 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:49:25,456 INFO  L435           NwaCegarLoop]: 222 mSDtfsCounter, 110 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-02-05 11:49:25,457 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 227 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-02-05 11:49:25,460 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3386 states.
[2025-02-05 11:49:25,490 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3386 to 3386.
[2025-02-05 11:49:25,494 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3386 states, 3385 states have (on average 1.0709010339734122) internal successors, (3625), 3385 states have internal predecessors, (3625), 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:49:25,499 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3386 states to 3386 states and 3625 transitions.
[2025-02-05 11:49:25,500 INFO  L78                 Accepts]: Start accepts. Automaton has 3386 states and 3625 transitions. Word has length 610
[2025-02-05 11:49:25,501 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:49:25,501 INFO  L471      AbstractCegarLoop]: Abstraction has 3386 states and 3625 transitions.
[2025-02-05 11:49:25,501 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 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:49:25,501 INFO  L276                IsEmpty]: Start isEmpty. Operand 3386 states and 3625 transitions.
[2025-02-05 11:49:25,504 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 652
[2025-02-05 11:49:25,504 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:49:25,505 INFO  L218           NwaCegarLoop]: trace histogram [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, 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, 4, 3, 3, 3, 3, 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]
[2025-02-05 11:49:25,505 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-02-05 11:49:25,505 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:49:25,505 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:49:25,506 INFO  L85        PathProgramCache]: Analyzing trace with hash 91529544, now seen corresponding path program 1 times
[2025-02-05 11:49:25,506 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:49:25,506 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001367701]
[2025-02-05 11:49:25,506 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:49:25,506 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:49:25,542 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 651 statements into 1 equivalence classes.
[2025-02-05 11:49:25,589 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 651 of 651 statements.
[2025-02-05 11:49:25,589 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:49:25,590 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:49:25,792 INFO  L134       CoverageAnalysis]: Checked inductivity of 1366 backedges. 942 proven. 110 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked.
[2025-02-05 11:49:25,792 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:49:25,792 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001367701]
[2025-02-05 11:49:25,792 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001367701] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-05 11:49:25,793 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1136402044]
[2025-02-05 11:49:25,793 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:49:25,793 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 11:49:25,793 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 11:49:25,796 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:49:25,804 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:49:25,862 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 651 statements into 1 equivalence classes.
[2025-02-05 11:49:25,946 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 651 of 651 statements.
[2025-02-05 11:49:25,946 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:49:25,946 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:49:25,949 INFO  L256         TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-02-05 11:49:25,980 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-05 11:49:26,059 INFO  L134       CoverageAnalysis]: Checked inductivity of 1366 backedges. 299 proven. 0 refuted. 0 times theorem prover too weak. 1067 trivial. 0 not checked.
[2025-02-05 11:49:26,059 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-02-05 11:49:26,059 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1136402044] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:49:26,059 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-02-05 11:49:26,060 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5
[2025-02-05 11:49:26,060 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002720179]
[2025-02-05 11:49:26,060 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:49:26,060 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:49:26,060 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:49:26,061 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:49:26,061 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-05 11:49:26,061 INFO  L87              Difference]: Start difference. First operand 3386 states and 3625 transitions. Second operand  has 3 states, 3 states have (on average 74.0) internal successors, (222), 3 states have internal predecessors, (222), 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:49:26,457 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:49:26,457 INFO  L93              Difference]: Finished difference Result 8016 states and 8583 transitions.
[2025-02-05 11:49:26,458 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:49:26,458 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 74.0) internal successors, (222), 3 states have internal predecessors, (222), 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 651
[2025-02-05 11:49:26,458 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:49:26,468 INFO  L225             Difference]: With dead ends: 8016
[2025-02-05 11:49:26,468 INFO  L226             Difference]: Without dead ends: 3920
[2025-02-05 11:49:26,471 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 654 GetRequests, 651 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-05 11:49:26,472 INFO  L435           NwaCegarLoop]: 236 mSDtfsCounter, 119 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-02-05 11:49:26,472 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 241 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-02-05 11:49:26,474 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3920 states.
[2025-02-05 11:49:26,516 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3920 to 3564.
[2025-02-05 11:49:26,520 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3564 states, 3563 states have (on average 1.0645523435307325) internal successors, (3793), 3563 states have internal predecessors, (3793), 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:49:26,525 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3564 states to 3564 states and 3793 transitions.
[2025-02-05 11:49:26,525 INFO  L78                 Accepts]: Start accepts. Automaton has 3564 states and 3793 transitions. Word has length 651
[2025-02-05 11:49:26,525 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:49:26,525 INFO  L471      AbstractCegarLoop]: Abstraction has 3564 states and 3793 transitions.
[2025-02-05 11:49:26,526 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 74.0) internal successors, (222), 3 states have internal predecessors, (222), 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:49:26,526 INFO  L276                IsEmpty]: Start isEmpty. Operand 3564 states and 3793 transitions.
[2025-02-05 11:49:26,530 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 743
[2025-02-05 11:49:26,531 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:49:26,531 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, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 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]
[2025-02-05 11:49:26,538 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2025-02-05 11:49:26,731 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 11:49:26,731 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:49:26,732 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:49:26,732 INFO  L85        PathProgramCache]: Analyzing trace with hash -1307110560, now seen corresponding path program 1 times
[2025-02-05 11:49:26,732 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:49:26,732 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835603024]
[2025-02-05 11:49:26,732 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:49:26,732 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:49:26,793 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 742 statements into 1 equivalence classes.
[2025-02-05 11:49:26,829 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 742 of 742 statements.
[2025-02-05 11:49:26,829 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:49:26,829 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:49:27,100 INFO  L134       CoverageAnalysis]: Checked inductivity of 1880 backedges. 1396 proven. 110 refuted. 0 times theorem prover too weak. 374 trivial. 0 not checked.
[2025-02-05 11:49:27,101 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:49:27,101 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835603024]
[2025-02-05 11:49:27,101 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835603024] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-05 11:49:27,101 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [279958834]
[2025-02-05 11:49:27,101 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:49:27,101 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 11:49:27,101 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 11:49:27,105 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:49:27,110 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:49:27,170 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 742 statements into 1 equivalence classes.
[2025-02-05 11:49:27,264 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 742 of 742 statements.
[2025-02-05 11:49:27,264 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:49:27,264 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:49:27,268 INFO  L256         TraceCheckSpWp]: Trace formula consists of 921 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-02-05 11:49:27,276 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-05 11:49:27,386 INFO  L134       CoverageAnalysis]: Checked inductivity of 1880 backedges. 359 proven. 0 refuted. 0 times theorem prover too weak. 1521 trivial. 0 not checked.
[2025-02-05 11:49:27,387 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-02-05 11:49:27,387 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [279958834] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:49:27,387 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-02-05 11:49:27,388 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5
[2025-02-05 11:49:27,388 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550514311]
[2025-02-05 11:49:27,388 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:49:27,389 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:49:27,389 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:49:27,389 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:49:27,389 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-05 11:49:27,390 INFO  L87              Difference]: Start difference. First operand 3564 states and 3793 transitions. Second operand  has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 3 states have internal predecessors, (223), 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:49:27,800 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:49:27,801 INFO  L93              Difference]: Finished difference Result 4456 states and 4730 transitions.
[2025-02-05 11:49:27,801 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:49:27,801 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 3 states have internal predecessors, (223), 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 742
[2025-02-05 11:49:27,802 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:49:27,810 INFO  L225             Difference]: With dead ends: 4456
[2025-02-05 11:49:27,810 INFO  L226             Difference]: Without dead ends: 4454
[2025-02-05 11:49:27,811 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 745 GetRequests, 742 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-05 11:49:27,811 INFO  L435           NwaCegarLoop]: 12 mSDtfsCounter, 140 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-02-05 11:49:27,812 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 16 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-02-05 11:49:27,814 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 4454 states.
[2025-02-05 11:49:27,836 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 4454 to 3564.
[2025-02-05 11:49:27,840 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3564 states, 3563 states have (on average 1.0639910188043784) internal successors, (3791), 3563 states have internal predecessors, (3791), 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:49:27,843 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3564 states to 3564 states and 3791 transitions.
[2025-02-05 11:49:27,843 INFO  L78                 Accepts]: Start accepts. Automaton has 3564 states and 3791 transitions. Word has length 742
[2025-02-05 11:49:27,843 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:49:27,843 INFO  L471      AbstractCegarLoop]: Abstraction has 3564 states and 3791 transitions.
[2025-02-05 11:49:27,844 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 3 states have internal predecessors, (223), 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:49:27,844 INFO  L276                IsEmpty]: Start isEmpty. Operand 3564 states and 3791 transitions.
[2025-02-05 11:49:27,849 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 830
[2025-02-05 11:49:27,849 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:49:27,849 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, 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, 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, 4, 4, 3, 3, 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]
[2025-02-05 11:49:27,856 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:49:28,050 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,SelfDestructingSolverStorable12
[2025-02-05 11:49:28,050 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:49:28,050 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:49:28,051 INFO  L85        PathProgramCache]: Analyzing trace with hash -1726661175, now seen corresponding path program 1 times
[2025-02-05 11:49:28,051 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:49:28,051 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774402250]
[2025-02-05 11:49:28,051 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:49:28,051 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:49:28,090 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 829 statements into 1 equivalence classes.
[2025-02-05 11:49:28,114 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 829 of 829 statements.
[2025-02-05 11:49:28,115 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:49:28,115 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:49:28,378 INFO  L134       CoverageAnalysis]: Checked inductivity of 2439 backedges. 1825 proven. 110 refuted. 0 times theorem prover too weak. 504 trivial. 0 not checked.
[2025-02-05 11:49:28,378 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:49:28,378 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774402250]
[2025-02-05 11:49:28,378 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774402250] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-05 11:49:28,378 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1319175777]
[2025-02-05 11:49:28,378 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:49:28,378 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 11:49:28,379 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 11:49:28,385 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:49:28,386 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:49:28,449 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 829 statements into 1 equivalence classes.
[2025-02-05 11:49:28,564 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 829 of 829 statements.
[2025-02-05 11:49:28,564 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:49:28,564 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:49:28,568 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1030 conjuncts, 3 conjuncts are in the unsatisfiable core
[2025-02-05 11:49:28,576 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-05 11:49:28,844 INFO  L134       CoverageAnalysis]: Checked inductivity of 2439 backedges. 1825 proven. 110 refuted. 0 times theorem prover too weak. 504 trivial. 0 not checked.
[2025-02-05 11:49:28,845 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-02-05 11:49:29,101 INFO  L134       CoverageAnalysis]: Checked inductivity of 2439 backedges. 1825 proven. 110 refuted. 0 times theorem prover too weak. 504 trivial. 0 not checked.
[2025-02-05 11:49:29,101 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1319175777] provided 0 perfect and 2 imperfect interpolant sequences
[2025-02-05 11:49:29,101 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-02-05 11:49:29,101 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6
[2025-02-05 11:49:29,101 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010984753]
[2025-02-05 11:49:29,101 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-02-05 11:49:29,103 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-02-05 11:49:29,103 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:49:29,103 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-02-05 11:49:29,103 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2025-02-05 11:49:29,108 INFO  L87              Difference]: Start difference. First operand 3564 states and 3791 transitions. Second operand  has 6 states, 6 states have (on average 126.5) internal successors, (759), 6 states have internal predecessors, (759), 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:49:29,899 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:49:29,900 INFO  L93              Difference]: Finished difference Result 8550 states and 9096 transitions.
[2025-02-05 11:49:29,900 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-05 11:49:29,901 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 126.5) internal successors, (759), 6 states have internal predecessors, (759), 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 829
[2025-02-05 11:49:29,901 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:49:29,917 INFO  L225             Difference]: With dead ends: 8550
[2025-02-05 11:49:29,917 INFO  L226             Difference]: Without dead ends: 5166
[2025-02-05 11:49:29,920 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 1660 GetRequests, 1656 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2025-02-05 11:49:29,920 INFO  L435           NwaCegarLoop]: 50 mSDtfsCounter, 227 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 1000 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 1092 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 1000 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-02-05 11:49:29,920 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 62 Invalid, 1092 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 1000 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-02-05 11:49:29,924 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 5166 states.
[2025-02-05 11:49:29,948 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 5166 to 4276.
[2025-02-05 11:49:29,952 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 4276 states, 4275 states have (on average 1.0617543859649123) internal successors, (4539), 4275 states have internal predecessors, (4539), 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:49:29,955 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4276 states to 4276 states and 4539 transitions.
[2025-02-05 11:49:29,955 INFO  L78                 Accepts]: Start accepts. Automaton has 4276 states and 4539 transitions. Word has length 829
[2025-02-05 11:49:29,955 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:49:29,956 INFO  L471      AbstractCegarLoop]: Abstraction has 4276 states and 4539 transitions.
[2025-02-05 11:49:29,956 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 126.5) internal successors, (759), 6 states have internal predecessors, (759), 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:49:29,956 INFO  L276                IsEmpty]: Start isEmpty. Operand 4276 states and 4539 transitions.
[2025-02-05 11:49:29,961 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 889
[2025-02-05 11:49:29,962 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:49:29,962 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, 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, 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, 4, 4, 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, 1, 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:49:29,973 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:49:30,162 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13
[2025-02-05 11:49:30,163 INFO  L396      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:49:30,163 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:49:30,164 INFO  L85        PathProgramCache]: Analyzing trace with hash 2063887242, now seen corresponding path program 1 times
[2025-02-05 11:49:30,164 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:49:30,164 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468534977]
[2025-02-05 11:49:30,164 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:49:30,164 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:49:30,210 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 888 statements into 1 equivalence classes.
[2025-02-05 11:49:30,237 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 888 of 888 statements.
[2025-02-05 11:49:30,237 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:49:30,237 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:49:31,067 INFO  L134       CoverageAnalysis]: Checked inductivity of 2487 backedges. 977 proven. 325 refuted. 0 times theorem prover too weak. 1185 trivial. 0 not checked.
[2025-02-05 11:49:31,067 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:49:31,068 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468534977]
[2025-02-05 11:49:31,068 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468534977] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-05 11:49:31,068 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [264101128]
[2025-02-05 11:49:31,068 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:49:31,068 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 11:49:31,068 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 11:49:31,070 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:49:31,072 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:49:31,165 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 888 statements into 1 equivalence classes.
[2025-02-05 11:49:31,292 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 888 of 888 statements.
[2025-02-05 11:49:31,292 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:49:31,292 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:49:31,295 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1088 conjuncts, 5 conjuncts are in the unsatisfiable core
[2025-02-05 11:49:31,303 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-05 11:49:33,864 INFO  L134       CoverageAnalysis]: Checked inductivity of 2487 backedges. 1168 proven. 0 refuted. 0 times theorem prover too weak. 1319 trivial. 0 not checked.
[2025-02-05 11:49:33,865 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-02-05 11:49:33,865 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [264101128] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:49:33,865 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-02-05 11:49:33,865 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7
[2025-02-05 11:49:33,865 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886824081]
[2025-02-05 11:49:33,865 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:49:33,866 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 11:49:33,866 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:49:33,867 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 11:49:33,867 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2025-02-05 11:49:33,867 INFO  L87              Difference]: Start difference. First operand 4276 states and 4539 transitions. Second operand  has 4 states, 4 states have (on average 81.75) internal successors, (327), 3 states have internal predecessors, (327), 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:49:34,359 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:49:34,359 INFO  L93              Difference]: Finished difference Result 8579 states and 9109 transitions.
[2025-02-05 11:49:34,359 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 11:49:34,359 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 81.75) internal successors, (327), 3 states have internal predecessors, (327), 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 888
[2025-02-05 11:49:34,360 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:49:34,366 INFO  L225             Difference]: With dead ends: 8579
[2025-02-05 11:49:34,366 INFO  L226             Difference]: Without dead ends: 4276
[2025-02-05 11:49:34,370 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 892 GetRequests, 886 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2025-02-05 11:49:34,371 INFO  L435           NwaCegarLoop]: 40 mSDtfsCounter, 102 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-02-05 11:49:34,371 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 46 Invalid, 640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 581 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-02-05 11:49:34,374 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 4276 states.
[2025-02-05 11:49:34,405 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 4276 to 4276.
[2025-02-05 11:49:34,410 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 4276 states, 4275 states have (on average 1.0449122807017543) internal successors, (4467), 4275 states have internal predecessors, (4467), 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:49:34,414 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4276 states to 4276 states and 4467 transitions.
[2025-02-05 11:49:34,414 INFO  L78                 Accepts]: Start accepts. Automaton has 4276 states and 4467 transitions. Word has length 888
[2025-02-05 11:49:34,415 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:49:34,415 INFO  L471      AbstractCegarLoop]: Abstraction has 4276 states and 4467 transitions.
[2025-02-05 11:49:34,415 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 81.75) internal successors, (327), 3 states have internal predecessors, (327), 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:49:34,415 INFO  L276                IsEmpty]: Start isEmpty. Operand 4276 states and 4467 transitions.
[2025-02-05 11:49:34,422 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1029
[2025-02-05 11:49:34,422 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:49:34,422 INFO  L218           NwaCegarLoop]: trace histogram [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, 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, 8, 8, 7, 7, 7, 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, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:49:34,430 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0
[2025-02-05 11:49:34,623 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14
[2025-02-05 11:49:34,624 INFO  L396      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:49:34,624 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:49:34,624 INFO  L85        PathProgramCache]: Analyzing trace with hash 1055358609, now seen corresponding path program 1 times
[2025-02-05 11:49:34,624 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:49:34,624 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066191186]
[2025-02-05 11:49:34,625 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:49:34,625 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:49:34,677 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1028 statements into 1 equivalence classes.
[2025-02-05 11:49:34,712 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1028 of 1028 statements.
[2025-02-05 11:49:34,712 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:49:34,712 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:49:35,293 INFO  L134       CoverageAnalysis]: Checked inductivity of 3567 backedges. 1098 proven. 0 refuted. 0 times theorem prover too weak. 2469 trivial. 0 not checked.
[2025-02-05 11:49:35,294 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:49:35,294 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066191186]
[2025-02-05 11:49:35,294 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066191186] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:49:35,294 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:49:35,294 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:49:35,294 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701582718]
[2025-02-05 11:49:35,294 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:49:35,295 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:49:35,295 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:49:35,295 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:49:35,295 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:49:35,296 INFO  L87              Difference]: Start difference. First operand 4276 states and 4467 transitions. Second operand  has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 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:49:35,676 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:49:35,676 INFO  L93              Difference]: Finished difference Result 8372 states and 8753 transitions.
[2025-02-05 11:49:35,677 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:49:35,677 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 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 1028
[2025-02-05 11:49:35,678 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:49:35,685 INFO  L225             Difference]: With dead ends: 8372
[2025-02-05 11:49:35,685 INFO  L226             Difference]: Without dead ends: 4276
[2025-02-05 11:49:35,689 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:49:35,690 INFO  L435           NwaCegarLoop]: 222 mSDtfsCounter, 111 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-02-05 11:49:35,690 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 227 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-02-05 11:49:35,692 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 4276 states.
[2025-02-05 11:49:35,721 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 4276 to 4276.
[2025-02-05 11:49:35,724 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 4276 states, 4275 states have (on average 1.040701754385965) internal successors, (4449), 4275 states have internal predecessors, (4449), 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:49:35,760 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4276 states to 4276 states and 4449 transitions.
[2025-02-05 11:49:35,760 INFO  L78                 Accepts]: Start accepts. Automaton has 4276 states and 4449 transitions. Word has length 1028
[2025-02-05 11:49:35,761 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:49:35,761 INFO  L471      AbstractCegarLoop]: Abstraction has 4276 states and 4449 transitions.
[2025-02-05 11:49:35,761 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 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:49:35,761 INFO  L276                IsEmpty]: Start isEmpty. Operand 4276 states and 4449 transitions.
[2025-02-05 11:49:35,772 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1077
[2025-02-05 11:49:35,772 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:49:35,772 INFO  L218           NwaCegarLoop]: trace histogram [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, 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, 8, 8, 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, 5, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:49:35,772 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2025-02-05 11:49:35,773 INFO  L396      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:49:35,773 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:49:35,773 INFO  L85        PathProgramCache]: Analyzing trace with hash 29077785, now seen corresponding path program 1 times
[2025-02-05 11:49:35,774 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:49:35,774 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49404963]
[2025-02-05 11:49:35,774 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:49:35,774 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:49:35,854 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1076 statements into 1 equivalence classes.
[2025-02-05 11:49:35,905 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1076 of 1076 statements.
[2025-02-05 11:49:35,906 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:49:35,906 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:49:37,150 INFO  L134       CoverageAnalysis]: Checked inductivity of 3764 backedges. 2688 proven. 72 refuted. 0 times theorem prover too weak. 1004 trivial. 0 not checked.
[2025-02-05 11:49:37,151 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:49:37,151 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49404963]
[2025-02-05 11:49:37,151 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49404963] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-05 11:49:37,151 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [753310429]
[2025-02-05 11:49:37,151 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:49:37,151 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 11:49:37,151 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 11:49:37,153 INFO  L229       MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-02-05 11:49:37,159 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process
[2025-02-05 11:49:37,235 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1076 statements into 1 equivalence classes.
[2025-02-05 11:49:37,362 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1076 of 1076 statements.
[2025-02-05 11:49:37,363 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:49:37,363 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:49:37,367 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1320 conjuncts, 6 conjuncts are in the unsatisfiable core
[2025-02-05 11:49:37,374 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-05 11:49:38,006 INFO  L134       CoverageAnalysis]: Checked inductivity of 3764 backedges. 2647 proven. 666 refuted. 0 times theorem prover too weak. 451 trivial. 0 not checked.
[2025-02-05 11:49:38,006 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-02-05 11:49:38,390 INFO  L134       CoverageAnalysis]: Checked inductivity of 3764 backedges. 2760 proven. 0 refuted. 0 times theorem prover too weak. 1004 trivial. 0 not checked.
[2025-02-05 11:49:38,391 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [753310429] provided 1 perfect and 1 imperfect interpolant sequences
[2025-02-05 11:49:38,391 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences.
[2025-02-05 11:49:38,391 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 6] total 9
[2025-02-05 11:49:38,391 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773173684]
[2025-02-05 11:49:38,391 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:49:38,392 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-05 11:49:38,392 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:49:38,392 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-05 11:49:38,392 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72
[2025-02-05 11:49:38,393 INFO  L87              Difference]: Start difference. First operand 4276 states and 4449 transitions. Second operand  has 5 states, 5 states have (on average 124.2) internal successors, (621), 5 states have internal predecessors, (621), 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:49:38,784 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:49:38,785 INFO  L93              Difference]: Finished difference Result 8906 states and 9281 transitions.
[2025-02-05 11:49:38,785 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 11:49:38,786 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 124.2) internal successors, (621), 5 states have internal predecessors, (621), 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 1076
[2025-02-05 11:49:38,786 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:49:38,791 INFO  L225             Difference]: With dead ends: 8906
[2025-02-05 11:49:38,791 INFO  L226             Difference]: Without dead ends: 4810
[2025-02-05 11:49:38,794 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2155 GetRequests, 2147 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72
[2025-02-05 11:49:38,795 INFO  L435           NwaCegarLoop]: 6 mSDtfsCounter, 128 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-02-05 11:49:38,795 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 9 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-02-05 11:49:38,797 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 4810 states.
[2025-02-05 11:49:38,818 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 4810 to 4276.
[2025-02-05 11:49:38,820 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 4276 states, 4275 states have (on average 1.040233918128655) internal successors, (4447), 4275 states have internal predecessors, (4447), 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:49:38,823 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4276 states to 4276 states and 4447 transitions.
[2025-02-05 11:49:38,823 INFO  L78                 Accepts]: Start accepts. Automaton has 4276 states and 4447 transitions. Word has length 1076
[2025-02-05 11:49:38,823 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:49:38,823 INFO  L471      AbstractCegarLoop]: Abstraction has 4276 states and 4447 transitions.
[2025-02-05 11:49:38,823 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 124.2) internal successors, (621), 5 states have internal predecessors, (621), 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:49:38,824 INFO  L276                IsEmpty]: Start isEmpty. Operand 4276 states and 4447 transitions.
[2025-02-05 11:49:38,830 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1236
[2025-02-05 11:49:38,831 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:49:38,831 INFO  L218           NwaCegarLoop]: trace histogram [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, 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, 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, 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, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:49:38,840 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0
[2025-02-05 11:49:39,035 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 11:49:39,035 INFO  L396      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:49:39,036 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:49:39,036 INFO  L85        PathProgramCache]: Analyzing trace with hash 388486813, now seen corresponding path program 1 times
[2025-02-05 11:49:39,036 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:49:39,036 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159530525]
[2025-02-05 11:49:39,036 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:49:39,036 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:49:39,109 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1235 statements into 1 equivalence classes.
[2025-02-05 11:49:39,158 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1235 of 1235 statements.
[2025-02-05 11:49:39,158 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:49:39,158 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:49:40,381 INFO  L134       CoverageAnalysis]: Checked inductivity of 4300 backedges. 3224 proven. 72 refuted. 0 times theorem prover too weak. 1004 trivial. 0 not checked.
[2025-02-05 11:49:40,382 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:49:40,382 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159530525]
[2025-02-05 11:49:40,382 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159530525] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-05 11:49:40,382 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1524562062]
[2025-02-05 11:49:40,382 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:49:40,382 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 11:49:40,382 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 11:49:40,384 INFO  L229       MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-02-05 11:49:40,385 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process
[2025-02-05 11:49:40,470 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1235 statements into 1 equivalence classes.
[2025-02-05 11:49:40,625 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1235 of 1235 statements.
[2025-02-05 11:49:40,625 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:49:40,625 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:49:40,631 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1480 conjuncts, 5 conjuncts are in the unsatisfiable core
[2025-02-05 11:49:40,639 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-05 11:49:40,968 INFO  L134       CoverageAnalysis]: Checked inductivity of 4300 backedges. 2937 proven. 0 refuted. 0 times theorem prover too weak. 1363 trivial. 0 not checked.
[2025-02-05 11:49:40,970 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-02-05 11:49:40,970 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1524562062] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:49:40,970 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-02-05 11:49:40,970 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7
[2025-02-05 11:49:40,970 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909622458]
[2025-02-05 11:49:40,970 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:49:40,971 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 11:49:40,971 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:49:40,971 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 11:49:40,971 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42
[2025-02-05 11:49:40,972 INFO  L87              Difference]: Start difference. First operand 4276 states and 4447 transitions. Second operand  has 4 states, 4 states have (on average 177.25) internal successors, (709), 4 states have internal predecessors, (709), 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:49:41,519 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:49:41,520 INFO  L93              Difference]: Finished difference Result 9440 states and 9804 transitions.
[2025-02-05 11:49:41,520 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 11:49:41,520 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 177.25) internal successors, (709), 4 states have internal predecessors, (709), 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 1235
[2025-02-05 11:49:41,521 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:49:41,528 INFO  L225             Difference]: With dead ends: 9440
[2025-02-05 11:49:41,529 INFO  L226             Difference]: Without dead ends: 5344
[2025-02-05 11:49:41,533 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 1239 GetRequests, 1234 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42
[2025-02-05 11:49:41,533 INFO  L435           NwaCegarLoop]: 32 mSDtfsCounter, 16 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 783 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 813 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-02-05 11:49:41,533 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 40 Invalid, 813 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 783 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-02-05 11:49:41,537 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 5344 states.
[2025-02-05 11:49:41,568 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 5344 to 4632.
[2025-02-05 11:49:41,572 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 4632 states, 4631 states have (on average 1.038436622759663) internal successors, (4809), 4631 states have internal predecessors, (4809), 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:49:41,575 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4632 states to 4632 states and 4809 transitions.
[2025-02-05 11:49:41,576 INFO  L78                 Accepts]: Start accepts. Automaton has 4632 states and 4809 transitions. Word has length 1235
[2025-02-05 11:49:41,577 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:49:41,577 INFO  L471      AbstractCegarLoop]: Abstraction has 4632 states and 4809 transitions.
[2025-02-05 11:49:41,577 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 177.25) internal successors, (709), 4 states have internal predecessors, (709), 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:49:41,577 INFO  L276                IsEmpty]: Start isEmpty. Operand 4632 states and 4809 transitions.
[2025-02-05 11:49:41,584 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1238
[2025-02-05 11:49:41,585 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:49:41,585 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, 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, 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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:49:41,596 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0
[2025-02-05 11:49:41,789 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17
[2025-02-05 11:49:41,789 INFO  L396      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:49:41,790 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:49:41,790 INFO  L85        PathProgramCache]: Analyzing trace with hash -561635589, now seen corresponding path program 1 times
[2025-02-05 11:49:41,790 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:49:41,790 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421059072]
[2025-02-05 11:49:41,790 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:49:41,790 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:49:41,844 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1237 statements into 1 equivalence classes.
[2025-02-05 11:49:41,873 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1237 of 1237 statements.
[2025-02-05 11:49:41,873 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:49:41,873 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:49:42,523 INFO  L134       CoverageAnalysis]: Checked inductivity of 4058 backedges. 2642 proven. 7 refuted. 0 times theorem prover too weak. 1409 trivial. 0 not checked.
[2025-02-05 11:49:42,523 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:49:42,523 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421059072]
[2025-02-05 11:49:42,523 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421059072] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-05 11:49:42,523 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [711587594]
[2025-02-05 11:49:42,524 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:49:42,524 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 11:49:42,524 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 11:49:42,526 INFO  L229       MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-02-05 11:49:42,527 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process
[2025-02-05 11:49:42,608 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1237 statements into 1 equivalence classes.
[2025-02-05 11:49:42,808 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1237 of 1237 statements.
[2025-02-05 11:49:42,808 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:49:42,808 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:49:42,812 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1463 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-02-05 11:49:42,819 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-05 11:49:43,064 INFO  L134       CoverageAnalysis]: Checked inductivity of 4058 backedges. 2649 proven. 0 refuted. 0 times theorem prover too weak. 1409 trivial. 0 not checked.
[2025-02-05 11:49:43,064 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-02-05 11:49:43,064 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [711587594] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:49:43,064 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-02-05 11:49:43,064 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6
[2025-02-05 11:49:43,065 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591899888]
[2025-02-05 11:49:43,065 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:49:43,066 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:49:43,066 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:49:43,067 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:49:43,067 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2025-02-05 11:49:43,067 INFO  L87              Difference]: Start difference. First operand 4632 states and 4809 transitions. Second operand  has 3 states, 3 states have (on average 177.0) internal successors, (531), 3 states have internal predecessors, (531), 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:49:43,410 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:49:43,410 INFO  L93              Difference]: Finished difference Result 9618 states and 10031 transitions.
[2025-02-05 11:49:43,411 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:49:43,411 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 177.0) internal successors, (531), 3 states have internal predecessors, (531), 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 1237
[2025-02-05 11:49:43,411 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:49:43,418 INFO  L225             Difference]: With dead ends: 9618
[2025-02-05 11:49:43,418 INFO  L226             Difference]: Without dead ends: 5166
[2025-02-05 11:49:43,421 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 1240 GetRequests, 1236 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:49:43,422 INFO  L435           NwaCegarLoop]: 214 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-02-05 11:49:43,422 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 218 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-02-05 11:49:43,428 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 5166 states.
[2025-02-05 11:49:43,460 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 5166 to 4988.
[2025-02-05 11:49:43,464 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 4988 states, 4987 states have (on average 1.0368959294164828) internal successors, (5171), 4987 states have internal predecessors, (5171), 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:49:43,468 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4988 states to 4988 states and 5171 transitions.
[2025-02-05 11:49:43,468 INFO  L78                 Accepts]: Start accepts. Automaton has 4988 states and 5171 transitions. Word has length 1237
[2025-02-05 11:49:43,469 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:49:43,469 INFO  L471      AbstractCegarLoop]: Abstraction has 4988 states and 5171 transitions.
[2025-02-05 11:49:43,470 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 177.0) internal successors, (531), 3 states have internal predecessors, (531), 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:49:43,470 INFO  L276                IsEmpty]: Start isEmpty. Operand 4988 states and 5171 transitions.
[2025-02-05 11:49:43,479 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1367
[2025-02-05 11:49:43,479 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:49:43,480 INFO  L218           NwaCegarLoop]: trace histogram [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, 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, 9, 9, 9, 9, 9, 9, 8, 7, 7, 7, 7, 7, 7, 7, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:49:43,488 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0
[2025-02-05 11:49:43,684 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 11:49:43,684 INFO  L396      AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:49:43,684 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:49:43,685 INFO  L85        PathProgramCache]: Analyzing trace with hash -229966236, now seen corresponding path program 1 times
[2025-02-05 11:49:43,685 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:49:43,685 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590590895]
[2025-02-05 11:49:43,685 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:49:43,685 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:49:43,741 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1366 statements into 1 equivalence classes.
[2025-02-05 11:49:43,771 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1366 of 1366 statements.
[2025-02-05 11:49:43,771 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:49:43,771 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:49:45,183 INFO  L134       CoverageAnalysis]: Checked inductivity of 5086 backedges. 3185 proven. 495 refuted. 0 times theorem prover too weak. 1406 trivial. 0 not checked.
[2025-02-05 11:49:45,184 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:49:45,184 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590590895]
[2025-02-05 11:49:45,184 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590590895] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-05 11:49:45,184 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [926399956]
[2025-02-05 11:49:45,184 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:49:45,184 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 11:49:45,184 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 11:49:45,187 INFO  L229       MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-02-05 11:49:45,188 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process
[2025-02-05 11:49:45,314 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1366 statements into 1 equivalence classes.
[2025-02-05 11:49:45,483 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1366 of 1366 statements.
[2025-02-05 11:49:45,483 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:49:45,483 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:49:45,488 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1612 conjuncts, 3 conjuncts are in the unsatisfiable core
[2025-02-05 11:49:45,495 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-05 11:49:46,270 INFO  L134       CoverageAnalysis]: Checked inductivity of 5086 backedges. 3268 proven. 0 refuted. 0 times theorem prover too weak. 1818 trivial. 0 not checked.
[2025-02-05 11:49:46,270 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-02-05 11:49:46,270 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [926399956] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:49:46,270 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-02-05 11:49:46,270 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8
[2025-02-05 11:49:46,270 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921906312]
[2025-02-05 11:49:46,270 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:49:46,271 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 11:49:46,271 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:49:46,271 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 11:49:46,271 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2025-02-05 11:49:46,272 INFO  L87              Difference]: Start difference. First operand 4988 states and 5171 transitions. Second operand  has 4 states, 4 states have (on average 121.5) internal successors, (486), 3 states have internal predecessors, (486), 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:49:46,794 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:49:46,794 INFO  L93              Difference]: Finished difference Result 9796 states and 10161 transitions.
[2025-02-05 11:49:46,795 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 11:49:46,795 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 121.5) internal successors, (486), 3 states have internal predecessors, (486), 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 1366
[2025-02-05 11:49:46,795 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:49:46,801 INFO  L225             Difference]: With dead ends: 9796
[2025-02-05 11:49:46,801 INFO  L226             Difference]: Without dead ends: 4810
[2025-02-05 11:49:46,805 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 1372 GetRequests, 1365 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2025-02-05 11:49:46,805 INFO  L435           NwaCegarLoop]: 40 mSDtfsCounter, 67 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 776 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 776 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-02-05 11:49:46,805 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 47 Invalid, 805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 776 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-02-05 11:49:46,812 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 4810 states.
[2025-02-05 11:49:46,834 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 4810 to 4810.
[2025-02-05 11:49:46,837 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 4810 states, 4809 states have (on average 1.0363901018922852) internal successors, (4984), 4809 states have internal predecessors, (4984), 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:49:46,839 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4810 states to 4810 states and 4984 transitions.
[2025-02-05 11:49:46,840 INFO  L78                 Accepts]: Start accepts. Automaton has 4810 states and 4984 transitions. Word has length 1366
[2025-02-05 11:49:46,841 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:49:46,841 INFO  L471      AbstractCegarLoop]: Abstraction has 4810 states and 4984 transitions.
[2025-02-05 11:49:46,841 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 121.5) internal successors, (486), 3 states have internal predecessors, (486), 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:49:46,841 INFO  L276                IsEmpty]: Start isEmpty. Operand 4810 states and 4984 transitions.
[2025-02-05 11:49:46,849 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1396
[2025-02-05 11:49:46,850 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:49:46,850 INFO  L218           NwaCegarLoop]: trace histogram [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, 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, 9, 9, 9, 9, 9, 9, 8, 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, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:49:46,858 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0
[2025-02-05 11:49:47,050 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 11:49:47,051 INFO  L396      AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:49:47,052 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:49:47,052 INFO  L85        PathProgramCache]: Analyzing trace with hash 925989351, now seen corresponding path program 1 times
[2025-02-05 11:49:47,052 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:49:47,052 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879751456]
[2025-02-05 11:49:47,052 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:49:47,052 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:49:47,110 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1395 statements into 1 equivalence classes.
[2025-02-05 11:49:47,137 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1395 of 1395 statements.
[2025-02-05 11:49:47,137 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:49:47,138 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:49:47,895 INFO  L134       CoverageAnalysis]: Checked inductivity of 5228 backedges. 3088 proven. 95 refuted. 0 times theorem prover too weak. 2045 trivial. 0 not checked.
[2025-02-05 11:49:47,895 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:49:47,895 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879751456]
[2025-02-05 11:49:47,895 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879751456] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-05 11:49:47,895 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1637555668]
[2025-02-05 11:49:47,895 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:49:47,896 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 11:49:47,896 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 11:49:47,899 INFO  L229       MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-02-05 11:49:47,900 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process
[2025-02-05 11:49:47,994 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1395 statements into 1 equivalence classes.
[2025-02-05 11:49:48,166 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1395 of 1395 statements.
[2025-02-05 11:49:48,166 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:49:48,166 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:49:48,171 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1641 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-02-05 11:49:48,178 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-05 11:49:48,329 INFO  L134       CoverageAnalysis]: Checked inductivity of 5228 backedges. 3183 proven. 0 refuted. 0 times theorem prover too weak. 2045 trivial. 0 not checked.
[2025-02-05 11:49:48,330 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-02-05 11:49:48,330 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1637555668] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:49:48,330 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-02-05 11:49:48,330 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6
[2025-02-05 11:49:48,330 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446157167]
[2025-02-05 11:49:48,330 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:49:48,331 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:49:48,331 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:49:48,331 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:49:48,331 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2025-02-05 11:49:48,331 INFO  L87              Difference]: Start difference. First operand 4810 states and 4984 transitions. Second operand  has 3 states, 3 states have (on average 177.33333333333334) internal successors, (532), 3 states have internal predecessors, (532), 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:49:48,702 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:49:48,703 INFO  L93              Difference]: Finished difference Result 9440 states and 9787 transitions.
[2025-02-05 11:49:48,703 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:49:48,703 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 177.33333333333334) internal successors, (532), 3 states have internal predecessors, (532), 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 1395
[2025-02-05 11:49:48,704 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:49:48,709 INFO  L225             Difference]: With dead ends: 9440
[2025-02-05 11:49:48,709 INFO  L226             Difference]: Without dead ends: 4810
[2025-02-05 11:49:48,737 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 1398 GetRequests, 1394 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:49:48,741 INFO  L435           NwaCegarLoop]: 217 mSDtfsCounter, 4 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-02-05 11:49:48,742 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 222 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-02-05 11:49:48,743 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 4810 states.
[2025-02-05 11:49:48,829 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 4810 to 4810.
[2025-02-05 11:49:48,836 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 4810 states, 4809 states have (on average 1.0295279683925973) internal successors, (4951), 4809 states have internal predecessors, (4951), 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:49:48,844 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4810 states to 4810 states and 4951 transitions.
[2025-02-05 11:49:48,844 INFO  L78                 Accepts]: Start accepts. Automaton has 4810 states and 4951 transitions. Word has length 1395
[2025-02-05 11:49:48,845 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:49:48,845 INFO  L471      AbstractCegarLoop]: Abstraction has 4810 states and 4951 transitions.
[2025-02-05 11:49:48,845 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 177.33333333333334) internal successors, (532), 3 states have internal predecessors, (532), 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:49:48,845 INFO  L276                IsEmpty]: Start isEmpty. Operand 4810 states and 4951 transitions.
[2025-02-05 11:49:48,865 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1486
[2025-02-05 11:49:48,865 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:49:48,866 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, 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, 11, 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, 8, 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, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:49:48,877 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0
[2025-02-05 11:49:49,070 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20
[2025-02-05 11:49:49,070 INFO  L396      AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:49:49,071 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:49:49,071 INFO  L85        PathProgramCache]: Analyzing trace with hash -1300447894, now seen corresponding path program 1 times
[2025-02-05 11:49:49,071 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:49:49,071 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616352707]
[2025-02-05 11:49:49,071 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:49:49,071 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:49:49,221 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1485 statements into 1 equivalence classes.
[2025-02-05 11:49:49,271 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1485 of 1485 statements.
[2025-02-05 11:49:49,272 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:49:49,272 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:49:51,167 INFO  L134       CoverageAnalysis]: Checked inductivity of 6478 backedges. 2852 proven. 120 refuted. 0 times theorem prover too weak. 3506 trivial. 0 not checked.
[2025-02-05 11:49:51,167 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:49:51,167 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616352707]
[2025-02-05 11:49:51,167 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616352707] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-05 11:49:51,167 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [831616035]
[2025-02-05 11:49:51,167 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:49:51,168 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 11:49:51,168 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 11:49:51,172 INFO  L229       MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-02-05 11:49:51,176 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process
[2025-02-05 11:49:51,393 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1485 statements into 1 equivalence classes.
[2025-02-05 11:49:51,613 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1485 of 1485 statements.
[2025-02-05 11:49:51,614 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:49:51,614 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:49:51,620 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1769 conjuncts, 4 conjuncts are in the unsatisfiable core
[2025-02-05 11:49:51,628 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-05 11:49:52,232 INFO  L134       CoverageAnalysis]: Checked inductivity of 6478 backedges. 1842 proven. 60 refuted. 0 times theorem prover too weak. 4576 trivial. 0 not checked.
[2025-02-05 11:49:52,233 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-02-05 11:49:54,201 INFO  L134       CoverageAnalysis]: Checked inductivity of 6478 backedges. 1842 proven. 60 refuted. 0 times theorem prover too weak. 4576 trivial. 0 not checked.
[2025-02-05 11:49:54,201 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [831616035] provided 0 perfect and 2 imperfect interpolant sequences
[2025-02-05 11:49:54,201 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-02-05 11:49:54,201 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8
[2025-02-05 11:49:54,201 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424436756]
[2025-02-05 11:49:54,201 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-02-05 11:49:54,202 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-02-05 11:49:54,203 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:49:54,203 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-02-05 11:49:54,203 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56
[2025-02-05 11:49:54,204 INFO  L87              Difference]: Start difference. First operand 4810 states and 4951 transitions. Second operand  has 8 states, 8 states have (on average 126.5) internal successors, (1012), 8 states have internal predecessors, (1012), 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:49:55,559 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:49:55,560 INFO  L93              Difference]: Finished difference Result 12108 states and 12478 transitions.
[2025-02-05 11:49:55,563 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2025-02-05 11:49:55,564 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 126.5) internal successors, (1012), 8 states have internal predecessors, (1012), 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 1485
[2025-02-05 11:49:55,565 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:49:55,565 INFO  L225             Difference]: With dead ends: 12108
[2025-02-05 11:49:55,565 INFO  L226             Difference]: Without dead ends: 0
[2025-02-05 11:49:55,573 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2977 GetRequests, 2968 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90
[2025-02-05 11:49:55,584 INFO  L435           NwaCegarLoop]: 11 mSDtfsCounter, 673 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 2082 mSolverCounterSat, 193 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 673 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 2275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 193 IncrementalHoareTripleChecker+Valid, 2082 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time
[2025-02-05 11:49:55,585 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [673 Valid, 36 Invalid, 2275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [193 Valid, 2082 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time]
[2025-02-05 11:49:55,586 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2025-02-05 11:49:55,586 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2025-02-05 11:49:55,586 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:49:55,586 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2025-02-05 11:49:55,586 INFO  L78                 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1485
[2025-02-05 11:49:55,586 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:49:55,587 INFO  L471      AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2025-02-05 11:49:55,587 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 126.5) internal successors, (1012), 8 states have internal predecessors, (1012), 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:49:55,587 INFO  L276                IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2025-02-05 11:49:55,591 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2025-02-05 11:49:55,593 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2025-02-05 11:49:55,609 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0
[2025-02-05 11:49:55,798 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 11:49:55,801 INFO  L422         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:49:55,802 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.
[2025-02-05 11:49:56,722 INFO  L170   ceAbstractionStarter]: Computing trace abstraction results
[2025-02-05 11:49:56,743 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 11:49:56 BoogieIcfgContainer
[2025-02-05 11:49:56,743 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2025-02-05 11:49:56,748 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2025-02-05 11:49:56,748 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2025-02-05 11:49:56,748 INFO  L274        PluginConnector]: Witness Printer initialized
[2025-02-05 11:49:56,748 INFO  L184        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:49:12" (3/4) ...
[2025-02-05 11:49:56,750 INFO  L146         WitnessPrinter]: Generating witness for correct program
[2025-02-05 11:49:56,767 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges
[2025-02-05 11:49:56,768 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges
[2025-02-05 11:49:56,769 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges
[2025-02-05 11:49:56,769 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges
[2025-02-05 11:49:56,886 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml
[2025-02-05 11:49:56,887 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml
[2025-02-05 11:49:56,887 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2025-02-05 11:49:56,888 INFO  L158              Benchmark]: Toolchain (without parser) took 45951.44ms. Allocated memory was 142.6MB in the beginning and 503.3MB in the end (delta: 360.7MB). Free memory was 103.0MB in the beginning and 393.1MB in the end (delta: -290.1MB). Peak memory consumption was 72.3MB. Max. memory is 16.1GB.
[2025-02-05 11:49:56,888 INFO  L158              Benchmark]: CDTParser took 0.44ms. Allocated memory is still 201.3MB. Free memory is still 127.3MB. There was no memory consumed. Max. memory is 16.1GB.
[2025-02-05 11:49:56,888 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 454.52ms. Allocated memory is still 142.6MB. Free memory was 103.0MB in the beginning and 69.8MB in the end (delta: 33.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB.
[2025-02-05 11:49:56,888 INFO  L158              Benchmark]: Boogie Procedure Inliner took 102.96ms. Allocated memory is still 142.6MB. Free memory was 69.8MB in the beginning and 60.8MB in the end (delta: 9.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2025-02-05 11:49:56,888 INFO  L158              Benchmark]: Boogie Preprocessor took 102.41ms. Allocated memory is still 142.6MB. Free memory was 60.8MB in the beginning and 50.2MB in the end (delta: 10.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2025-02-05 11:49:56,888 INFO  L158              Benchmark]: IcfgBuilder took 1232.59ms. Allocated memory is still 142.6MB. Free memory was 50.2MB in the beginning and 63.5MB in the end (delta: -13.3MB). Peak memory consumption was 41.1MB. Max. memory is 16.1GB.
[2025-02-05 11:49:56,889 INFO  L158              Benchmark]: TraceAbstraction took 43910.09ms. Allocated memory was 142.6MB in the beginning and 503.3MB in the end (delta: 360.7MB). Free memory was 63.5MB in the beginning and 409.7MB in the end (delta: -346.2MB). Peak memory consumption was 283.4MB. Max. memory is 16.1GB.
[2025-02-05 11:49:56,889 INFO  L158              Benchmark]: Witness Printer took 139.17ms. Allocated memory is still 503.3MB. Free memory was 409.7MB in the beginning and 393.1MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2025-02-05 11:49:56,890 INFO  L338   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 0.44ms. Allocated memory is still 201.3MB. Free memory is still 127.3MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 454.52ms. Allocated memory is still 142.6MB. Free memory was 103.0MB in the beginning and 69.8MB in the end (delta: 33.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 102.96ms. Allocated memory is still 142.6MB. Free memory was 69.8MB in the beginning and 60.8MB in the end (delta: 9.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
 * Boogie Preprocessor took 102.41ms. Allocated memory is still 142.6MB. Free memory was 60.8MB in the beginning and 50.2MB in the end (delta: 10.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
 * IcfgBuilder took 1232.59ms. Allocated memory is still 142.6MB. Free memory was 50.2MB in the beginning and 63.5MB in the end (delta: -13.3MB). Peak memory consumption was 41.1MB. Max. memory is 16.1GB.
 * TraceAbstraction took 43910.09ms. Allocated memory was 142.6MB in the beginning and 503.3MB in the end (delta: 360.7MB). Free memory was 63.5MB in the beginning and 409.7MB in the end (delta: -346.2MB). Peak memory consumption was 283.4MB. Max. memory is 16.1GB.
 * Witness Printer took 139.17ms. Allocated memory is still 503.3MB. Free memory was 409.7MB in the beginning and 393.1MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: ErrorAutomatonStatistics
    NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0
  - PositiveResult [Line: 200]: a call to reach_error is unreachable
    For all program executions holds that a call to reach_error is unreachable at this location
  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 1 procedures, 245 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 42.9s, OverallIterations: 22, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 12.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3143 SdHoareTripleChecker+Valid, 11.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3143 mSDsluCounter, 2441 SdHoareTripleChecker+Invalid, 9.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 158 mSDsCounter, 1580 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 14229 IncrementalHoareTripleChecker+Invalid, 15809 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1580 mSolverCounterUnsat, 2283 mSDtfsCounter, 14229 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 15045 GetRequests, 14969 SyntacticMatches, 2 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4988occurred in iteration=19, InterpolantAutomatonStates: 82, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 22 MinimizatonAttempts, 5342 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 2.3s SatisfiabilityAnalysisTime, 22.2s InterpolantComputationTime, 27520 NumberOfCodeBlocks, 27520 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 30873 ConstructedInterpolants, 0 QuantifiedInterpolants, 92649 SizeOfPredicates, 1 NumberOfNonLiveVariables, 14018 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 37 InterpolantComputations, 20 PerfectInterpolantSequences, 94424/97182 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available
  - AllSpecificationsHoldResult: All specifications hold
    1 specifications checked. All of them hold
  - InvariantResult [Line: 890]: Location Invariant
    Derived location invariant: ((((((((((((((((((a24 == 1) && (a21 == 9)) && (81 <= a12)) && (a12 <= 600060)) || ((((a12 <= 11) && (a24 == 1)) && (10 <= a21)) && (0 <= ((long long) a12 + 42)))) || (((((a12 <= 11) && (7 <= a15)) && (a24 == 1)) && (7 == a21)) && (a15 <= 8))) || ((((7 <= a15) && (a24 == 1)) && (10 <= a21)) && (a12 <= 600060))) || ((((a21 == 8) && (a24 == 1)) && (8 <= a15)) && (a12 <= 600060))) || ((((a24 == 1) && (a15 <= 8)) && (a21 == 9)) && (0 <= (43773 + (((-1 * (((((long long) a12 * 10) + 2779120) >= 0) ? ((((long long) a12 * 10) + 2779120) / 9) : (((((long long) a12 * 10) + 2779120) / 9) - 1))) >= 0) ? ((-1 * (((((long long) a12 * 10) + 2779120) >= 0) ? ((((long long) a12 * 10) + 2779120) / 9) : (((((long long) a12 * 10) + 2779120) / 9) - 1))) / 10) : (((-1 * (((((long long) a12 * 10) + 2779120) >= 0) ? ((((long long) a12 * 10) + 2779120) / 9) : (((((long long) a12 * 10) + 2779120) / 9) - 1))) / 10) - 1)))))) || (((a21 <= 6) && (a12 <= 10)) && (a15 <= 5))) || (((((a12 <= 73282) && (a24 == 1)) && (a15 <= 8)) && (a21 <= 6)) && (0 <= ((long long) a12 + 42)))) || ((((((7 <= a15) && (a24 == 1)) && (12849 <= a12)) && (a21 <= 6)) && ((0 < (43773 + (((-1 * (((((long long) a12 * 10) + 2779120) >= 0) ? ((((long long) a12 * 10) + 2779120) / 9) : (((((long long) a12 * 10) + 2779120) / 9) - 1))) >= 0) ? ((-1 * (((((long long) a12 * 10) + 2779120) >= 0) ? ((((long long) a12 * 10) + 2779120) / 9) : (((((long long) a12 * 10) + 2779120) / 9) - 1))) / 10) : (((-1 * (((((long long) a12 * 10) + 2779120) >= 0) ? ((((long long) a12 * 10) + 2779120) / 9) : (((((long long) a12 * 10) + 2779120) / 9) - 1))) / 10) - 1)))) || (((((((long long) a12 + 1) >= 0) ? (((long long) a12 + 1) % 9) : ((((long long) a12 + 1) % 9) + 9)) * 9) % 10) != 0))) && (0 <= (43773 + (((-1 * (((((long long) a12 * 10) + 2779120) >= 0) ? ((((long long) a12 * 10) + 2779120) / 9) : (((((long long) a12 * 10) + 2779120) / 9) - 1))) >= 0) ? ((-1 * (((((long long) a12 * 10) + 2779120) >= 0) ? ((((long long) a12 * 10) + 2779120) / 9) : (((((long long) a12 * 10) + 2779120) / 9) - 1))) / 10) : (((-1 * (((((long long) a12 * 10) + 2779120) >= 0) ? ((((long long) a12 * 10) + 2779120) / 9) : (((((long long) a12 * 10) + 2779120) / 9) - 1))) / 10) - 1)))))) || ((a24 == 1) && (a15 <= 5))) || ((((((7 <= a15) && (a24 == 1)) && (a15 <= 8)) && (a21 <= 6)) && (0 <= ((long long) a12 + 42))) && (a12 <= 600060))) || ((((a21 == 8) && (a24 == 1)) && (12849 <= a12)) && (a12 <= 600060))) || ((((7 <= a15) && (a24 == 1)) && (a15 <= 8)) && (((long long) 49 + a12) <= 0))) || (((a12 <= 80) && (a21 == 8)) && (a24 == 1))) || (((((a24 == 1) && (7 == a21)) && (0 <= ((long long) a12 + 42))) && (8 <= a15)) && (a12 <= 600060)))
RESULT: Ultimate proved your program to be correct!
[2025-02-05 11:49:56,915 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0
Received shutdown request...
--- End real Ultimate output ---

Execution finished normally
Writing output log to file Ultimate.log
Result:
TRUE