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


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


Checking for ERROR reachability
Using default analysis
Version c00e63dc
Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem16_label32.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 7b831aa366302fa2c77135b486d8b7f29aa8c9f7f58e6c2271aafe7f88b79748
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-c00e63d-m
[2025-02-05 11:58:41,745 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-02-05 11:58:41,825 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2025-02-05 11:58:41,831 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-02-05 11:58:41,831 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-02-05 11:58:41,859 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-02-05 11:58:41,860 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-02-05 11:58:41,860 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-02-05 11:58:41,861 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-02-05 11:58:41,861 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-02-05 11:58:41,861 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-02-05 11:58:41,861 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-02-05 11:58:41,862 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-02-05 11:58:41,862 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-02-05 11:58:41,862 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-02-05 11:58:41,862 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-02-05 11:58:41,862 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-02-05 11:58:41,862 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-02-05 11:58:41,862 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-02-05 11:58:41,862 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-02-05 11:58:41,863 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-02-05 11:58:41,863 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-02-05 11:58:41,863 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-02-05 11:58:41,863 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-02-05 11:58:41,863 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-02-05 11:58:41,863 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-02-05 11:58:41,863 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-02-05 11:58:41,863 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-02-05 11:58:41,863 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-02-05 11:58:41,863 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-02-05 11:58:41,863 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-02-05 11:58:41,863 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-02-05 11:58:41,863 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-02-05 11:58:41,864 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-02-05 11:58:41,864 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-02-05 11:58:41,865 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-02-05 11:58:41,865 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-02-05 11:58:41,865 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-02-05 11:58:41,865 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-02-05 11:58:41,865 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-02-05 11:58:41,865 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-02-05 11:58:41,865 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-02-05 11:58:41,865 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-02-05 11:58:41,865 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 -> 7b831aa366302fa2c77135b486d8b7f29aa8c9f7f58e6c2271aafe7f88b79748
[2025-02-05 11:58:42,123 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-02-05 11:58:42,129 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-02-05 11:58:42,131 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-02-05 11:58:42,132 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-02-05 11:58:42,133 INFO  L274        PluginConnector]: CDTParser initialized
[2025-02-05 11:58:42,133 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem16_label32.c
[2025-02-05 11:58:43,402 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5d45cca4b/582b767986874ae19a9ac88aa5934265/FLAG97d691158
[2025-02-05 11:58:43,793 INFO  L384              CDTParser]: Found 1 translation units.
[2025-02-05 11:58:43,794 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label32.c
[2025-02-05 11:58:43,825 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5d45cca4b/582b767986874ae19a9ac88aa5934265/FLAG97d691158
[2025-02-05 11:58:43,841 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5d45cca4b/582b767986874ae19a9ac88aa5934265
[2025-02-05 11:58:43,845 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-02-05 11:58:43,846 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-02-05 11:58:43,848 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-02-05 11:58:43,848 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-02-05 11:58:43,852 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-02-05 11:58:43,853 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:58:43" (1/1) ...
[2025-02-05 11:58:43,855 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61cc6b3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:58:43, skipping insertion in model container
[2025-02-05 11:58:43,856 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:58:43" (1/1) ...
[2025-02-05 11:58:43,909 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-02-05 11:58:44,078 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label32.c[5121,5134]
[2025-02-05 11:58:44,337 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-05 11:58:44,347 INFO  L200         MainTranslator]: Completed pre-run
[2025-02-05 11:58:44,369 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label32.c[5121,5134]
[2025-02-05 11:58:44,517 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-05 11:58:44,535 INFO  L204         MainTranslator]: Completed translation
[2025-02-05 11:58:44,536 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:58:44 WrapperNode
[2025-02-05 11:58:44,536 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-02-05 11:58:44,538 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-02-05 11:58:44,538 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-02-05 11:58:44,539 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-02-05 11:58:44,545 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:58:44" (1/1) ...
[2025-02-05 11:58:44,574 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:58:44" (1/1) ...
[2025-02-05 11:58:44,726 INFO  L138                Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1767
[2025-02-05 11:58:44,727 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-02-05 11:58:44,727 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-02-05 11:58:44,728 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-02-05 11:58:44,728 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-02-05 11:58:44,735 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:58:44" (1/1) ...
[2025-02-05 11:58:44,737 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:58:44" (1/1) ...
[2025-02-05 11:58:44,765 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:58:44" (1/1) ...
[2025-02-05 11:58:44,826 INFO  L175           MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2025-02-05 11:58:44,827 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:58:44" (1/1) ...
[2025-02-05 11:58:44,827 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:58:44" (1/1) ...
[2025-02-05 11:58:44,871 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:58:44" (1/1) ...
[2025-02-05 11:58:44,877 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:58:44" (1/1) ...
[2025-02-05 11:58:44,888 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:58:44" (1/1) ...
[2025-02-05 11:58:44,897 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:58:44" (1/1) ...
[2025-02-05 11:58:44,915 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-02-05 11:58:44,917 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-02-05 11:58:44,918 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-02-05 11:58:44,918 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-02-05 11:58:44,919 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:58:44" (1/1) ...
[2025-02-05 11:58:44,923 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-02-05 11:58:44,934 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 11:58:44,949 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2025-02-05 11:58:44,953 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2025-02-05 11:58:44,977 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-02-05 11:58:44,977 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-02-05 11:58:44,978 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-02-05 11:58:44,978 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-02-05 11:58:45,044 INFO  L257             CfgBuilder]: Building ICFG
[2025-02-05 11:58:45,046 INFO  L287             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-02-05 11:58:47,041 INFO  L1309  $ProcedureCfgBuilder]: dead code at ProgramPoint L1501: havoc calculate_output_#t~ret7#1;
[2025-02-05 11:58:47,142 INFO  L?                        ?]: Removed 276 outVars from TransFormulas that were not future-live.
[2025-02-05 11:58:47,142 INFO  L308             CfgBuilder]: Performing block encoding
[2025-02-05 11:58:47,165 INFO  L332             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-02-05 11:58:47,169 INFO  L337             CfgBuilder]: Removed 0 assume(true) statements.
[2025-02-05 11:58:47,169 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:58:47 BoogieIcfgContainer
[2025-02-05 11:58:47,169 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-02-05 11:58:47,171 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-02-05 11:58:47,172 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-02-05 11:58:47,175 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-02-05 11:58:47,176 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 11:58:43" (1/3) ...
[2025-02-05 11:58:47,176 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a93e622 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:58:47, skipping insertion in model container
[2025-02-05 11:58:47,177 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:58:44" (2/3) ...
[2025-02-05 11:58:47,178 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a93e622 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:58:47, skipping insertion in model container
[2025-02-05 11:58:47,178 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:58:47" (3/3) ...
[2025-02-05 11:58:47,179 INFO  L128   eAbstractionObserver]: Analyzing ICFG Problem16_label32.c
[2025-02-05 11:58:47,193 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-02-05 11:58:47,195 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG Problem16_label32.c that has 1 procedures, 396 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-02-05 11:58:47,262 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-02-05 11:58:47,274 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;@54db2c0b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-02-05 11:58:47,276 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-02-05 11:58:47,281 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 396 states, 394 states have (on average 1.83248730964467) internal successors, (722), 395 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:58:47,289 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 49
[2025-02-05 11:58:47,290 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:58:47,291 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]
[2025-02-05 11:58:47,291 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:58:47,296 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:58:47,296 INFO  L85        PathProgramCache]: Analyzing trace with hash 43168191, now seen corresponding path program 1 times
[2025-02-05 11:58:47,304 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:58:47,304 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056119864]
[2025-02-05 11:58:47,305 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:58:47,306 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:58:47,369 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes.
[2025-02-05 11:58:47,417 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements.
[2025-02-05 11:58:47,418 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:58:47,418 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:58:47,655 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 11:58:47,656 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:58:47,656 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056119864]
[2025-02-05 11:58:47,657 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056119864] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:58:47,657 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:58:47,657 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-02-05 11:58:47,658 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849033435]
[2025-02-05 11:58:47,662 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:58:47,667 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:58:47,668 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:58:47,686 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:58:47,687 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:58:47,690 INFO  L87              Difference]: Start difference. First operand  has 396 states, 394 states have (on average 1.83248730964467) internal successors, (722), 395 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand  has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:58:49,288 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:58:49,289 INFO  L93              Difference]: Finished difference Result 1122 states and 2100 transitions.
[2025-02-05 11:58:49,290 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:58:49,291 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 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 48
[2025-02-05 11:58:49,291 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:58:49,304 INFO  L225             Difference]: With dead ends: 1122
[2025-02-05 11:58:49,304 INFO  L226             Difference]: Without dead ends: 662
[2025-02-05 11:58:49,308 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:58:49,310 INFO  L435           NwaCegarLoop]: 246 mSDtfsCounter, 339 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 864 mSolverCounterSat, 450 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 1314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 450 IncrementalHoareTripleChecker+Valid, 864 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time
[2025-02-05 11:58:49,311 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 254 Invalid, 1314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [450 Valid, 864 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time]
[2025-02-05 11:58:49,326 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 662 states.
[2025-02-05 11:58:49,388 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 662.
[2025-02-05 11:58:49,391 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 662 states, 661 states have (on average 1.518910741301059) internal successors, (1004), 661 states have internal predecessors, (1004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:58:49,396 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 1004 transitions.
[2025-02-05 11:58:49,399 INFO  L78                 Accepts]: Start accepts. Automaton has 662 states and 1004 transitions. Word has length 48
[2025-02-05 11:58:49,399 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:58:49,399 INFO  L471      AbstractCegarLoop]: Abstraction has 662 states and 1004 transitions.
[2025-02-05 11:58:49,400 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:58:49,400 INFO  L276                IsEmpty]: Start isEmpty. Operand 662 states and 1004 transitions.
[2025-02-05 11:58:49,403 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 117
[2025-02-05 11:58:49,404 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:58:49,404 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:58:49,405 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2025-02-05 11:58:49,405 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:58:49,406 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:58:49,406 INFO  L85        PathProgramCache]: Analyzing trace with hash -729896949, now seen corresponding path program 1 times
[2025-02-05 11:58:49,407 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:58:49,407 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110481761]
[2025-02-05 11:58:49,407 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:58:49,408 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:58:49,430 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes.
[2025-02-05 11:58:49,477 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements.
[2025-02-05 11:58:49,477 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:58:49,477 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:58:49,879 INFO  L134       CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 11:58:49,879 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:58:49,879 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110481761]
[2025-02-05 11:58:49,879 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110481761] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:58:49,880 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:58:49,880 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:58:49,880 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097769608]
[2025-02-05 11:58:49,880 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:58:49,881 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 11:58:49,881 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:58:49,882 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 11:58:49,882 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-05 11:58:49,882 INFO  L87              Difference]: Start difference. First operand 662 states and 1004 transitions. Second operand  has 4 states, 4 states have (on average 29.0) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:58:51,734 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:58:51,735 INFO  L93              Difference]: Finished difference Result 2309 states and 3414 transitions.
[2025-02-05 11:58:51,735 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 11:58:51,735 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 29.0) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 116
[2025-02-05 11:58:51,735 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:58:51,742 INFO  L225             Difference]: With dead ends: 2309
[2025-02-05 11:58:51,743 INFO  L226             Difference]: Without dead ends: 1649
[2025-02-05 11:58:51,745 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-02-05 11:58:51,747 INFO  L435           NwaCegarLoop]: 33 mSDtfsCounter, 1008 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 1496 mSolverCounterSat, 489 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1008 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 1985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 489 IncrementalHoareTripleChecker+Valid, 1496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time
[2025-02-05 11:58:51,747 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1008 Valid, 42 Invalid, 1985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [489 Valid, 1496 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time]
[2025-02-05 11:58:51,751 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1649 states.
[2025-02-05 11:58:51,792 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1649 to 1649.
[2025-02-05 11:58:51,797 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1649 states, 1648 states have (on average 1.4016990291262137) internal successors, (2310), 1648 states have internal predecessors, (2310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:58:51,806 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1649 states to 1649 states and 2310 transitions.
[2025-02-05 11:58:51,807 INFO  L78                 Accepts]: Start accepts. Automaton has 1649 states and 2310 transitions. Word has length 116
[2025-02-05 11:58:51,807 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:58:51,807 INFO  L471      AbstractCegarLoop]: Abstraction has 1649 states and 2310 transitions.
[2025-02-05 11:58:51,808 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 29.0) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:58:51,808 INFO  L276                IsEmpty]: Start isEmpty. Operand 1649 states and 2310 transitions.
[2025-02-05 11:58:51,811 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 180
[2025-02-05 11:58:51,812 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:58:51,812 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:58:51,812 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-02-05 11:58:51,812 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:58:51,812 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:58:51,813 INFO  L85        PathProgramCache]: Analyzing trace with hash 1202382957, now seen corresponding path program 1 times
[2025-02-05 11:58:51,813 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:58:51,813 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311906328]
[2025-02-05 11:58:51,813 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:58:51,813 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:58:51,837 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes.
[2025-02-05 11:58:51,857 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements.
[2025-02-05 11:58:51,857 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:58:51,857 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:58:52,046 INFO  L134       CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 11:58:52,047 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:58:52,047 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311906328]
[2025-02-05 11:58:52,047 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311906328] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:58:52,047 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:58:52,047 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-02-05 11:58:52,047 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833347978]
[2025-02-05 11:58:52,048 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:58:52,048 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:58:52,048 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:58:52,049 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:58:52,049 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:58:52,049 INFO  L87              Difference]: Start difference. First operand 1649 states and 2310 transitions. Second operand  has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 2 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:58:53,372 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:58:53,373 INFO  L93              Difference]: Finished difference Result 3625 states and 5242 transitions.
[2025-02-05 11:58:53,374 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:58:53,374 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 2 states have internal predecessors, (179), 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 179
[2025-02-05 11:58:53,376 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:58:53,386 INFO  L225             Difference]: With dead ends: 3625
[2025-02-05 11:58:53,387 INFO  L226             Difference]: Without dead ends: 2307
[2025-02-05 11:58:53,389 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:58:53,390 INFO  L435           NwaCegarLoop]: 73 mSDtfsCounter, 278 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 882 mSolverCounterSat, 380 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 1262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 380 IncrementalHoareTripleChecker+Valid, 882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time
[2025-02-05 11:58:53,390 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 77 Invalid, 1262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [380 Valid, 882 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time]
[2025-02-05 11:58:53,396 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2307 states.
[2025-02-05 11:58:53,438 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2307 to 2307.
[2025-02-05 11:58:53,442 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2307 states, 2306 states have (on average 1.349956634865568) internal successors, (3113), 2306 states have internal predecessors, (3113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:58:53,450 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2307 states to 2307 states and 3113 transitions.
[2025-02-05 11:58:53,450 INFO  L78                 Accepts]: Start accepts. Automaton has 2307 states and 3113 transitions. Word has length 179
[2025-02-05 11:58:53,451 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:58:53,451 INFO  L471      AbstractCegarLoop]: Abstraction has 2307 states and 3113 transitions.
[2025-02-05 11:58:53,451 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 2 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:58:53,451 INFO  L276                IsEmpty]: Start isEmpty. Operand 2307 states and 3113 transitions.
[2025-02-05 11:58:53,457 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 215
[2025-02-05 11:58:53,457 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:58:53,458 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:58:53,458 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-02-05 11:58:53,458 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:58:53,458 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:58:53,458 INFO  L85        PathProgramCache]: Analyzing trace with hash 2005907539, now seen corresponding path program 1 times
[2025-02-05 11:58:53,459 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:58:53,459 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269558620]
[2025-02-05 11:58:53,459 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:58:53,459 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:58:53,493 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes.
[2025-02-05 11:58:53,550 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements.
[2025-02-05 11:58:53,550 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:58:53,551 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:58:53,724 INFO  L134       CoverageAnalysis]: Checked inductivity of 169 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked.
[2025-02-05 11:58:53,724 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:58:53,724 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269558620]
[2025-02-05 11:58:53,724 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269558620] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:58:53,724 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:58:53,724 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-02-05 11:58:53,725 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384344912]
[2025-02-05 11:58:53,725 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:58:53,726 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:58:53,726 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:58:53,726 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:58:53,726 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:58:53,727 INFO  L87              Difference]: Start difference. First operand 2307 states and 3113 transitions. Second operand  has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 2 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:58:54,912 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:58:54,913 INFO  L93              Difference]: Finished difference Result 5599 states and 7699 transitions.
[2025-02-05 11:58:54,913 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:58:54,913 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 2 states have internal predecessors, (137), 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 214
[2025-02-05 11:58:54,914 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:58:54,927 INFO  L225             Difference]: With dead ends: 5599
[2025-02-05 11:58:54,927 INFO  L226             Difference]: Without dead ends: 3623
[2025-02-05 11:58:54,930 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:58:54,930 INFO  L435           NwaCegarLoop]: 151 mSDtfsCounter, 359 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 307 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 1118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 307 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time
[2025-02-05 11:58:54,931 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 155 Invalid, 1118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [307 Valid, 811 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2025-02-05 11:58:54,934 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3623 states.
[2025-02-05 11:58:54,976 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3623 to 2965.
[2025-02-05 11:58:54,980 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2965 states, 2964 states have (on average 1.2442645074224021) internal successors, (3688), 2964 states have internal predecessors, (3688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:58:54,986 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2965 states to 2965 states and 3688 transitions.
[2025-02-05 11:58:54,987 INFO  L78                 Accepts]: Start accepts. Automaton has 2965 states and 3688 transitions. Word has length 214
[2025-02-05 11:58:54,987 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:58:54,987 INFO  L471      AbstractCegarLoop]: Abstraction has 2965 states and 3688 transitions.
[2025-02-05 11:58:54,987 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 2 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:58:54,987 INFO  L276                IsEmpty]: Start isEmpty. Operand 2965 states and 3688 transitions.
[2025-02-05 11:58:54,989 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 232
[2025-02-05 11:58:54,989 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:58:54,990 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:58:54,990 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-02-05 11:58:54,990 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:58:54,990 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:58:54,990 INFO  L85        PathProgramCache]: Analyzing trace with hash 1672083745, now seen corresponding path program 1 times
[2025-02-05 11:58:54,990 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:58:54,991 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977845533]
[2025-02-05 11:58:54,991 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:58:54,991 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:58:55,017 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 231 statements into 1 equivalence classes.
[2025-02-05 11:58:55,035 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 231 of 231 statements.
[2025-02-05 11:58:55,035 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:58:55,035 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:58:55,178 INFO  L134       CoverageAnalysis]: Checked inductivity of 177 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 11:58:55,178 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:58:55,178 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977845533]
[2025-02-05 11:58:55,179 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977845533] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:58:55,179 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:58:55,179 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:58:55,179 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193284151]
[2025-02-05 11:58:55,179 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:58:55,179 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:58:55,179 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:58:55,180 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:58:55,180 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:58:55,181 INFO  L87              Difference]: Start difference. First operand 2965 states and 3688 transitions. Second operand  has 3 states, 3 states have (on average 77.0) internal successors, (231), 3 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:58:56,366 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:58:56,366 INFO  L93              Difference]: Finished difference Result 6915 states and 8657 transitions.
[2025-02-05 11:58:56,367 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:58:56,367 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 77.0) internal successors, (231), 3 states have internal predecessors, (231), 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 231
[2025-02-05 11:58:56,367 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:58:56,380 INFO  L225             Difference]: With dead ends: 6915
[2025-02-05 11:58:56,380 INFO  L226             Difference]: Without dead ends: 3623
[2025-02-05 11:58:56,385 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:58:56,386 INFO  L435           NwaCegarLoop]: 534 mSDtfsCounter, 286 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 796 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 1094 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time
[2025-02-05 11:58:56,387 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 540 Invalid, 1094 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 796 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2025-02-05 11:58:56,391 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3623 states.
[2025-02-05 11:58:56,441 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3623 to 3623.
[2025-02-05 11:58:56,446 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3623 states, 3622 states have (on average 1.0762009939260078) internal successors, (3898), 3622 states have internal predecessors, (3898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:58:56,452 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3623 states to 3623 states and 3898 transitions.
[2025-02-05 11:58:56,452 INFO  L78                 Accepts]: Start accepts. Automaton has 3623 states and 3898 transitions. Word has length 231
[2025-02-05 11:58:56,453 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:58:56,453 INFO  L471      AbstractCegarLoop]: Abstraction has 3623 states and 3898 transitions.
[2025-02-05 11:58:56,453 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 77.0) internal successors, (231), 3 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:58:56,453 INFO  L276                IsEmpty]: Start isEmpty. Operand 3623 states and 3898 transitions.
[2025-02-05 11:58:56,456 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 284
[2025-02-05 11:58:56,456 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:58:56,456 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:58:56,456 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-02-05 11:58:56,456 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:58:56,457 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:58:56,457 INFO  L85        PathProgramCache]: Analyzing trace with hash -1533178519, now seen corresponding path program 1 times
[2025-02-05 11:58:56,457 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:58:56,457 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4212300]
[2025-02-05 11:58:56,457 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:58:56,457 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:58:56,512 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 283 statements into 1 equivalence classes.
[2025-02-05 11:58:56,538 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 283 of 283 statements.
[2025-02-05 11:58:56,539 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:58:56,539 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:58:56,801 INFO  L134       CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 11:58:56,802 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:58:56,802 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4212300]
[2025-02-05 11:58:56,802 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4212300] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:58:56,802 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:58:56,803 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:58:56,803 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338382753]
[2025-02-05 11:58:56,803 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:58:56,804 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:58:56,805 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:58:56,805 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:58:56,806 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:58:56,806 INFO  L87              Difference]: Start difference. First operand 3623 states and 3898 transitions. Second operand  has 3 states, 3 states have (on average 94.33333333333333) internal successors, (283), 3 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:58:57,740 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:58:57,741 INFO  L93              Difference]: Finished difference Result 8231 states and 8905 transitions.
[2025-02-05 11:58:57,741 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:58:57,741 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 94.33333333333333) internal successors, (283), 3 states have internal predecessors, (283), 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 283
[2025-02-05 11:58:57,742 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:58:57,755 INFO  L225             Difference]: With dead ends: 8231
[2025-02-05 11:58:57,755 INFO  L226             Difference]: Without dead ends: 4939
[2025-02-05 11:58:57,758 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:58:57,760 INFO  L435           NwaCegarLoop]: 413 mSDtfsCounter, 288 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 765 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 848 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 765 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time
[2025-02-05 11:58:57,761 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 419 Invalid, 848 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 765 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2025-02-05 11:58:57,765 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 4939 states.
[2025-02-05 11:58:57,821 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 4939 to 4939.
[2025-02-05 11:58:57,828 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 4939 states, 4938 states have (on average 1.0514378290805995) internal successors, (5192), 4938 states have internal predecessors, (5192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:58:57,836 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4939 states to 4939 states and 5192 transitions.
[2025-02-05 11:58:57,836 INFO  L78                 Accepts]: Start accepts. Automaton has 4939 states and 5192 transitions. Word has length 283
[2025-02-05 11:58:57,837 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:58:57,837 INFO  L471      AbstractCegarLoop]: Abstraction has 4939 states and 5192 transitions.
[2025-02-05 11:58:57,837 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 94.33333333333333) internal successors, (283), 3 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:58:57,837 INFO  L276                IsEmpty]: Start isEmpty. Operand 4939 states and 5192 transitions.
[2025-02-05 11:58:57,842 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 388
[2025-02-05 11:58:57,843 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:58:57,843 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:58:57,843 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-02-05 11:58:57,843 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:58:57,844 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:58:57,844 INFO  L85        PathProgramCache]: Analyzing trace with hash 1508487323, now seen corresponding path program 1 times
[2025-02-05 11:58:57,844 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:58:57,844 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695083624]
[2025-02-05 11:58:57,844 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:58:57,844 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:58:57,882 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 387 statements into 1 equivalence classes.
[2025-02-05 11:58:57,916 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 387 of 387 statements.
[2025-02-05 11:58:57,917 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:58:57,917 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:58:58,190 INFO  L134       CoverageAnalysis]: Checked inductivity of 186 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked.
[2025-02-05 11:58:58,190 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:58:58,190 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695083624]
[2025-02-05 11:58:58,190 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695083624] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:58:58,190 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:58:58,190 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:58:58,190 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392614069]
[2025-02-05 11:58:58,191 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:58:58,191 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:58:58,191 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:58:58,191 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:58:58,192 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:58:58,192 INFO  L87              Difference]: Start difference. First operand 4939 states and 5192 transitions. Second operand  has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:58:59,065 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:58:59,065 INFO  L93              Difference]: Finished difference Result 10863 states and 11493 transitions.
[2025-02-05 11:58:59,065 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:58:59,066 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 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 387
[2025-02-05 11:58:59,066 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:58:59,081 INFO  L225             Difference]: With dead ends: 10863
[2025-02-05 11:58:59,081 INFO  L226             Difference]: Without dead ends: 6255
[2025-02-05 11:58:59,086 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:58:59,087 INFO  L435           NwaCegarLoop]: 33 mSDtfsCounter, 300 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 760 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time
[2025-02-05 11:58:59,087 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 38 Invalid, 857 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 760 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2025-02-05 11:58:59,093 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 6255 states.
[2025-02-05 11:58:59,153 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 6255 to 6255.
[2025-02-05 11:58:59,161 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 6255 states, 6254 states have (on average 1.0548448992644708) internal successors, (6597), 6254 states have internal predecessors, (6597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:58:59,181 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6255 states to 6255 states and 6597 transitions.
[2025-02-05 11:58:59,182 INFO  L78                 Accepts]: Start accepts. Automaton has 6255 states and 6597 transitions. Word has length 387
[2025-02-05 11:58:59,182 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:58:59,183 INFO  L471      AbstractCegarLoop]: Abstraction has 6255 states and 6597 transitions.
[2025-02-05 11:58:59,183 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:58:59,183 INFO  L276                IsEmpty]: Start isEmpty. Operand 6255 states and 6597 transitions.
[2025-02-05 11:58:59,189 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 442
[2025-02-05 11:58:59,189 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:58:59,190 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:58:59,191 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-02-05 11:58:59,191 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:58:59,192 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:58:59,192 INFO  L85        PathProgramCache]: Analyzing trace with hash 983844660, now seen corresponding path program 1 times
[2025-02-05 11:58:59,192 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:58:59,192 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964713253]
[2025-02-05 11:58:59,192 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:58:59,192 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:58:59,259 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 441 statements into 1 equivalence classes.
[2025-02-05 11:58:59,288 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 441 of 441 statements.
[2025-02-05 11:58:59,289 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:58:59,289 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:58:59,633 INFO  L134       CoverageAnalysis]: Checked inductivity of 248 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked.
[2025-02-05 11:58:59,633 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:58:59,633 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964713253]
[2025-02-05 11:58:59,633 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964713253] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:58:59,634 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:58:59,634 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:58:59,634 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436413557]
[2025-02-05 11:58:59,634 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:58:59,634 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:58:59,634 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:58:59,635 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:58:59,635 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:58:59,635 INFO  L87              Difference]: Start difference. First operand 6255 states and 6597 transitions. Second operand  has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:59:00,588 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:59:00,589 INFO  L93              Difference]: Finished difference Result 13495 states and 14303 transitions.
[2025-02-05 11:59:00,589 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:59:00,589 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 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 441
[2025-02-05 11:59:00,590 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:59:00,621 INFO  L225             Difference]: With dead ends: 13495
[2025-02-05 11:59:00,621 INFO  L226             Difference]: Without dead ends: 7571
[2025-02-05 11:59:00,628 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:59:00,629 INFO  L435           NwaCegarLoop]: 432 mSDtfsCounter, 284 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 774 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 774 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time
[2025-02-05 11:59:00,629 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 438 Invalid, 845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 774 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2025-02-05 11:59:00,637 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 7571 states.
[2025-02-05 11:59:00,723 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 7571 to 7571.
[2025-02-05 11:59:00,738 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 7571 states, 7570 states have (on average 1.0498018494055483) internal successors, (7947), 7570 states have internal predecessors, (7947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:59:00,752 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7571 states to 7571 states and 7947 transitions.
[2025-02-05 11:59:00,753 INFO  L78                 Accepts]: Start accepts. Automaton has 7571 states and 7947 transitions. Word has length 441
[2025-02-05 11:59:00,754 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:59:00,754 INFO  L471      AbstractCegarLoop]: Abstraction has 7571 states and 7947 transitions.
[2025-02-05 11:59:00,754 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:59:00,754 INFO  L276                IsEmpty]: Start isEmpty. Operand 7571 states and 7947 transitions.
[2025-02-05 11:59:00,764 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 503
[2025-02-05 11:59:00,765 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:59:00,766 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:59:00,766 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-02-05 11:59:00,767 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:59:00,767 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:59:00,767 INFO  L85        PathProgramCache]: Analyzing trace with hash -1428886617, now seen corresponding path program 1 times
[2025-02-05 11:59:00,767 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:59:00,768 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005957568]
[2025-02-05 11:59:00,768 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:59:00,768 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:59:00,821 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 502 statements into 1 equivalence classes.
[2025-02-05 11:59:00,853 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 502 of 502 statements.
[2025-02-05 11:59:00,853 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:59:00,854 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:59:01,381 INFO  L134       CoverageAnalysis]: Checked inductivity of 309 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked.
[2025-02-05 11:59:01,382 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:59:01,382 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005957568]
[2025-02-05 11:59:01,382 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005957568] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-05 11:59:01,382 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1926383665]
[2025-02-05 11:59:01,382 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:59:01,382 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 11:59:01,382 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 11:59:01,385 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-02-05 11:59:01,387 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2025-02-05 11:59:01,466 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 502 statements into 1 equivalence classes.
[2025-02-05 11:59:01,564 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 502 of 502 statements.
[2025-02-05 11:59:01,564 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:59:01,565 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:59:01,569 INFO  L256         TraceCheckSpWp]: Trace formula consists of 598 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-02-05 11:59:01,588 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-05 11:59:02,228 INFO  L134       CoverageAnalysis]: Checked inductivity of 309 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 309 trivial. 0 not checked.
[2025-02-05 11:59:02,228 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-02-05 11:59:02,228 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1926383665] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:59:02,228 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-02-05 11:59:02,229 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4
[2025-02-05 11:59:02,229 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396781]
[2025-02-05 11:59:02,229 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:59:02,229 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:59:02,230 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:59:02,230 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:59:02,230 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-05 11:59:02,230 INFO  L87              Difference]: Start difference. First operand 7571 states and 7947 transitions. Second operand  has 3 states, 3 states have (on average 80.0) internal successors, (240), 2 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:59:02,981 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:59:02,981 INFO  L93              Difference]: Finished difference Result 9218 states and 9631 transitions.
[2025-02-05 11:59:02,981 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:59:02,981 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 80.0) internal successors, (240), 2 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 502
[2025-02-05 11:59:02,982 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:59:02,995 INFO  L225             Difference]: With dead ends: 9218
[2025-02-05 11:59:02,995 INFO  L226             Difference]: Without dead ends: 9216
[2025-02-05 11:59:02,996 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 504 GetRequests, 501 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-05 11:59:02,996 INFO  L435           NwaCegarLoop]: 70 mSDtfsCounter, 116 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 740 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-02-05 11:59:02,996 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 75 Invalid, 772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 740 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-02-05 11:59:03,002 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 9216 states.
[2025-02-05 11:59:03,069 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 9216 to 7900.
[2025-02-05 11:59:03,082 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 7900 states, 7899 states have (on average 1.0493733383972654) internal successors, (8289), 7899 states have internal predecessors, (8289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:59:03,091 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7900 states to 7900 states and 8289 transitions.
[2025-02-05 11:59:03,091 INFO  L78                 Accepts]: Start accepts. Automaton has 7900 states and 8289 transitions. Word has length 502
[2025-02-05 11:59:03,092 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:59:03,092 INFO  L471      AbstractCegarLoop]: Abstraction has 7900 states and 8289 transitions.
[2025-02-05 11:59:03,093 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 80.0) internal successors, (240), 2 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:59:03,093 INFO  L276                IsEmpty]: Start isEmpty. Operand 7900 states and 8289 transitions.
[2025-02-05 11:59:03,137 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1244
[2025-02-05 11:59:03,137 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:59:03,140 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, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:59:03,149 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2025-02-05 11:59:03,340 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 11:59:03,341 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:59:03,343 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:59:03,344 INFO  L85        PathProgramCache]: Analyzing trace with hash -1515827112, now seen corresponding path program 1 times
[2025-02-05 11:59:03,344 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:59:03,344 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262974279]
[2025-02-05 11:59:03,344 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:59:03,345 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:59:03,459 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1243 statements into 1 equivalence classes.
[2025-02-05 11:59:03,542 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1243 of 1243 statements.
[2025-02-05 11:59:03,542 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:59:03,542 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:59:04,288 INFO  L134       CoverageAnalysis]: Checked inductivity of 2824 backedges. 1965 proven. 0 refuted. 0 times theorem prover too weak. 859 trivial. 0 not checked.
[2025-02-05 11:59:04,289 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:59:04,289 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262974279]
[2025-02-05 11:59:04,289 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262974279] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:59:04,289 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:59:04,289 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:59:04,289 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873229711]
[2025-02-05 11:59:04,289 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:59:04,290 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:59:04,290 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:59:04,291 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:59:04,291 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:59:04,291 INFO  L87              Difference]: Start difference. First operand 7900 states and 8289 transitions. Second operand  has 3 states, 3 states have (on average 217.0) internal successors, (651), 3 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:59:05,024 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:59:05,024 INFO  L93              Difference]: Finished difference Result 15469 states and 16245 transitions.
[2025-02-05 11:59:05,024 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:59:05,024 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 217.0) internal successors, (651), 3 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1243
[2025-02-05 11:59:05,025 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:59:05,039 INFO  L225             Difference]: With dead ends: 15469
[2025-02-05 11:59:05,039 INFO  L226             Difference]: Without dead ends: 7900
[2025-02-05 11:59:05,046 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:59:05,047 INFO  L435           NwaCegarLoop]: 422 mSDtfsCounter, 222 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 751 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-02-05 11:59:05,047 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 427 Invalid, 827 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 751 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-02-05 11:59:05,053 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 7900 states.
[2025-02-05 11:59:05,142 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 7900 to 7900.
[2025-02-05 11:59:05,147 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 7900 states, 7899 states have (on average 1.0357007216103304) internal successors, (8181), 7899 states have internal predecessors, (8181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:59:05,155 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7900 states to 7900 states and 8181 transitions.
[2025-02-05 11:59:05,155 INFO  L78                 Accepts]: Start accepts. Automaton has 7900 states and 8181 transitions. Word has length 1243
[2025-02-05 11:59:05,156 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:59:05,156 INFO  L471      AbstractCegarLoop]: Abstraction has 7900 states and 8181 transitions.
[2025-02-05 11:59:05,157 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 217.0) internal successors, (651), 3 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:59:05,157 INFO  L276                IsEmpty]: Start isEmpty. Operand 7900 states and 8181 transitions.
[2025-02-05 11:59:05,174 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1245
[2025-02-05 11:59:05,175 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:59:05,175 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, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:59:05,175 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-02-05 11:59:05,175 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:59:05,176 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:59:05,176 INFO  L85        PathProgramCache]: Analyzing trace with hash -2117566772, now seen corresponding path program 1 times
[2025-02-05 11:59:05,177 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:59:05,177 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010328778]
[2025-02-05 11:59:05,177 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:59:05,177 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:59:05,265 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1244 statements into 1 equivalence classes.
[2025-02-05 11:59:05,310 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1244 of 1244 statements.
[2025-02-05 11:59:05,310 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:59:05,311 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:59:06,724 INFO  L134       CoverageAnalysis]: Checked inductivity of 2830 backedges. 1972 proven. 0 refuted. 0 times theorem prover too weak. 858 trivial. 0 not checked.
[2025-02-05 11:59:06,724 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:59:06,724 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010328778]
[2025-02-05 11:59:06,724 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010328778] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:59:06,724 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:59:06,725 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:59:06,725 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952700250]
[2025-02-05 11:59:06,725 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:59:06,726 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:59:06,726 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:59:06,726 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:59:06,726 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:59:06,727 INFO  L87              Difference]: Start difference. First operand 7900 states and 8181 transitions. Second operand  has 3 states, 3 states have (on average 226.0) internal successors, (678), 3 states have internal predecessors, (678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:59:07,360 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:59:07,360 INFO  L93              Difference]: Finished difference Result 15469 states and 16029 transitions.
[2025-02-05 11:59:07,360 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:59:07,361 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 226.0) internal successors, (678), 3 states have internal predecessors, (678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1244
[2025-02-05 11:59:07,361 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:59:07,376 INFO  L225             Difference]: With dead ends: 15469
[2025-02-05 11:59:07,376 INFO  L226             Difference]: Without dead ends: 7900
[2025-02-05 11:59:07,384 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:59:07,385 INFO  L435           NwaCegarLoop]: 33 mSDtfsCounter, 210 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 743 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 819 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-02-05 11:59:07,386 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 37 Invalid, 819 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 743 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-02-05 11:59:07,392 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 7900 states.
[2025-02-05 11:59:07,452 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 7900 to 7900.
[2025-02-05 11:59:07,461 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 7900 states, 7899 states have (on average 1.0332953538422585) internal successors, (8162), 7899 states have internal predecessors, (8162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:59:07,469 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7900 states to 7900 states and 8162 transitions.
[2025-02-05 11:59:07,470 INFO  L78                 Accepts]: Start accepts. Automaton has 7900 states and 8162 transitions. Word has length 1244
[2025-02-05 11:59:07,471 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:59:07,471 INFO  L471      AbstractCegarLoop]: Abstraction has 7900 states and 8162 transitions.
[2025-02-05 11:59:07,471 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 226.0) internal successors, (678), 3 states have internal predecessors, (678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:59:07,471 INFO  L276                IsEmpty]: Start isEmpty. Operand 7900 states and 8162 transitions.
[2025-02-05 11:59:07,489 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1273
[2025-02-05 11:59:07,489 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:59:07,490 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, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:59:07,490 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-02-05 11:59:07,490 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:59:07,491 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:59:07,492 INFO  L85        PathProgramCache]: Analyzing trace with hash -2091320016, now seen corresponding path program 1 times
[2025-02-05 11:59:07,492 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:59:07,492 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099301427]
[2025-02-05 11:59:07,492 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:59:07,492 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:59:07,592 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1272 statements into 1 equivalence classes.
[2025-02-05 11:59:07,667 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1272 of 1272 statements.
[2025-02-05 11:59:07,667 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:59:07,667 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:59:08,724 INFO  L134       CoverageAnalysis]: Checked inductivity of 2938 backedges. 1699 proven. 0 refuted. 0 times theorem prover too weak. 1239 trivial. 0 not checked.
[2025-02-05 11:59:08,725 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:59:08,725 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099301427]
[2025-02-05 11:59:08,725 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099301427] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:59:08,725 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:59:08,726 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:59:08,726 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201689697]
[2025-02-05 11:59:08,726 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:59:08,727 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:59:08,727 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:59:08,728 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:59:08,728 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:59:08,728 INFO  L87              Difference]: Start difference. First operand 7900 states and 8162 transitions. Second operand  has 3 states, 3 states have (on average 215.33333333333334) internal successors, (646), 3 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:59:09,533 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:59:09,534 INFO  L93              Difference]: Finished difference Result 16785 states and 17326 transitions.
[2025-02-05 11:59:09,534 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:59:09,534 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 215.33333333333334) internal successors, (646), 3 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1272
[2025-02-05 11:59:09,535 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:59:09,556 INFO  L225             Difference]: With dead ends: 16785
[2025-02-05 11:59:09,556 INFO  L226             Difference]: Without dead ends: 9216
[2025-02-05 11:59:09,563 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:59:09,564 INFO  L435           NwaCegarLoop]: 432 mSDtfsCounter, 224 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 754 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 754 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-02-05 11:59:09,565 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 438 Invalid, 763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 754 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-02-05 11:59:09,575 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 9216 states.
[2025-02-05 11:59:09,641 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 9216 to 8887.
[2025-02-05 11:59:09,650 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 8887 states, 8886 states have (on average 1.0303848750844025) internal successors, (9156), 8886 states have internal predecessors, (9156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:59:09,660 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8887 states to 8887 states and 9156 transitions.
[2025-02-05 11:59:09,660 INFO  L78                 Accepts]: Start accepts. Automaton has 8887 states and 9156 transitions. Word has length 1272
[2025-02-05 11:59:09,661 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:59:09,661 INFO  L471      AbstractCegarLoop]: Abstraction has 8887 states and 9156 transitions.
[2025-02-05 11:59:09,661 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 215.33333333333334) internal successors, (646), 3 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:59:09,661 INFO  L276                IsEmpty]: Start isEmpty. Operand 8887 states and 9156 transitions.
[2025-02-05 11:59:09,678 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1291
[2025-02-05 11:59:09,678 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:59:09,679 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, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:59:09,679 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2025-02-05 11:59:09,679 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:59:09,680 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:59:09,680 INFO  L85        PathProgramCache]: Analyzing trace with hash -1394157249, now seen corresponding path program 1 times
[2025-02-05 11:59:09,680 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:59:09,680 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859574501]
[2025-02-05 11:59:09,680 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:59:09,680 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:59:09,781 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1290 statements into 1 equivalence classes.
[2025-02-05 11:59:09,834 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1290 of 1290 statements.
[2025-02-05 11:59:09,835 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:59:09,835 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:59:10,778 INFO  L134       CoverageAnalysis]: Checked inductivity of 2968 backedges. 321 proven. 0 refuted. 0 times theorem prover too weak. 2647 trivial. 0 not checked.
[2025-02-05 11:59:10,778 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:59:10,778 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859574501]
[2025-02-05 11:59:10,778 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859574501] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:59:10,778 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:59:10,779 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-02-05 11:59:10,779 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750237456]
[2025-02-05 11:59:10,780 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:59:10,780 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-02-05 11:59:10,780 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:59:10,781 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-02-05 11:59:10,781 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2025-02-05 11:59:10,781 INFO  L87              Difference]: Start difference. First operand 8887 states and 9156 transitions. Second operand  has 6 states, 6 states have (on average 57.0) internal successors, (342), 6 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:59:11,375 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:59:11,375 INFO  L93              Difference]: Finished difference Result 17502 states and 18038 transitions.
[2025-02-05 11:59:11,376 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-02-05 11:59:11,376 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 57.0) internal successors, (342), 6 states have internal predecessors, (342), 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 1290
[2025-02-05 11:59:11,377 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:59:11,389 INFO  L225             Difference]: With dead ends: 17502
[2025-02-05 11:59:11,389 INFO  L226             Difference]: Without dead ends: 8887
[2025-02-05 11:59:11,397 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2025-02-05 11:59:11,398 INFO  L435           NwaCegarLoop]: 436 mSDtfsCounter, 22 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 947 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 949 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 947 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-02-05 11:59:11,398 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 459 Invalid, 949 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 947 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-02-05 11:59:11,404 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 8887 states.
[2025-02-05 11:59:11,462 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 8887 to 8887.
[2025-02-05 11:59:11,472 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 8887 states, 8886 states have (on average 1.0297096556380825) internal successors, (9150), 8886 states have internal predecessors, (9150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:59:11,481 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8887 states to 8887 states and 9150 transitions.
[2025-02-05 11:59:11,482 INFO  L78                 Accepts]: Start accepts. Automaton has 8887 states and 9150 transitions. Word has length 1290
[2025-02-05 11:59:11,484 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:59:11,484 INFO  L471      AbstractCegarLoop]: Abstraction has 8887 states and 9150 transitions.
[2025-02-05 11:59:11,484 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 57.0) internal successors, (342), 6 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:59:11,484 INFO  L276                IsEmpty]: Start isEmpty. Operand 8887 states and 9150 transitions.
[2025-02-05 11:59:11,501 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1300
[2025-02-05 11:59:11,501 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:59:11,502 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, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:59:11,502 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2025-02-05 11:59:11,502 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:59:11,503 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:59:11,503 INFO  L85        PathProgramCache]: Analyzing trace with hash 1055344753, now seen corresponding path program 1 times
[2025-02-05 11:59:11,503 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:59:11,503 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838613684]
[2025-02-05 11:59:11,504 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:59:11,504 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:59:11,594 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1299 statements into 1 equivalence classes.
[2025-02-05 11:59:11,639 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1299 of 1299 statements.
[2025-02-05 11:59:11,639 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:59:11,639 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:59:12,937 INFO  L134       CoverageAnalysis]: Checked inductivity of 2959 backedges. 2140 proven. 0 refuted. 0 times theorem prover too weak. 819 trivial. 0 not checked.
[2025-02-05 11:59:12,937 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:59:12,937 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838613684]
[2025-02-05 11:59:12,937 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838613684] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:59:12,938 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:59:12,938 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-02-05 11:59:12,938 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378452058]
[2025-02-05 11:59:12,938 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:59:12,939 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-02-05 11:59:12,939 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:59:12,940 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-02-05 11:59:12,940 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2025-02-05 11:59:12,940 INFO  L87              Difference]: Start difference. First operand 8887 states and 9150 transitions. Second operand  has 6 states, 6 states have (on average 128.66666666666666) internal successors, (772), 6 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:59:13,825 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:59:13,825 INFO  L93              Difference]: Finished difference Result 17444 states and 17968 transitions.
[2025-02-05 11:59:13,826 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-02-05 11:59:13,826 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 128.66666666666666) internal successors, (772), 6 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1299
[2025-02-05 11:59:13,827 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:59:13,841 INFO  L225             Difference]: With dead ends: 17444
[2025-02-05 11:59:13,841 INFO  L226             Difference]: Without dead ends: 8888
[2025-02-05 11:59:13,850 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2025-02-05 11:59:13,852 INFO  L435           NwaCegarLoop]: 427 mSDtfsCounter, 505 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 1367 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 505 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 1377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time
[2025-02-05 11:59:13,852 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [505 Valid, 558 Invalid, 1377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1367 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2025-02-05 11:59:13,860 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 8888 states.
[2025-02-05 11:59:13,924 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 8888 to 8887.
[2025-02-05 11:59:13,931 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 8887 states, 8886 states have (on average 1.0289218996173757) internal successors, (9143), 8886 states have internal predecessors, (9143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:59:13,941 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8887 states to 8887 states and 9143 transitions.
[2025-02-05 11:59:13,942 INFO  L78                 Accepts]: Start accepts. Automaton has 8887 states and 9143 transitions. Word has length 1299
[2025-02-05 11:59:13,942 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:59:13,942 INFO  L471      AbstractCegarLoop]: Abstraction has 8887 states and 9143 transitions.
[2025-02-05 11:59:13,943 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 128.66666666666666) internal successors, (772), 6 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:59:13,943 INFO  L276                IsEmpty]: Start isEmpty. Operand 8887 states and 9143 transitions.
[2025-02-05 11:59:13,959 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1314
[2025-02-05 11:59:13,960 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:59:13,960 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:59:13,960 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2025-02-05 11:59:13,961 INFO  L396      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:59:13,961 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:59:13,961 INFO  L85        PathProgramCache]: Analyzing trace with hash 1066514618, now seen corresponding path program 1 times
[2025-02-05 11:59:13,962 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:59:13,962 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225830785]
[2025-02-05 11:59:13,962 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:59:13,962 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:59:14,096 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1313 statements into 1 equivalence classes.
[2025-02-05 11:59:14,149 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1313 of 1313 statements.
[2025-02-05 11:59:14,149 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:59:14,149 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:59:15,516 INFO  L134       CoverageAnalysis]: Checked inductivity of 2838 backedges. 2056 proven. 0 refuted. 0 times theorem prover too weak. 782 trivial. 0 not checked.
[2025-02-05 11:59:15,516 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:59:15,517 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225830785]
[2025-02-05 11:59:15,517 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225830785] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:59:15,517 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:59:15,517 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-05 11:59:15,518 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228581062]
[2025-02-05 11:59:15,518 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:59:15,519 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 11:59:15,519 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:59:15,520 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 11:59:15,520 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-05 11:59:15,520 INFO  L87              Difference]: Start difference. First operand 8887 states and 9143 transitions. Second operand  has 4 states, 4 states have (on average 192.75) internal successors, (771), 4 states have internal predecessors, (771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:59:16,422 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:59:16,423 INFO  L93              Difference]: Finished difference Result 17450 states and 17960 transitions.
[2025-02-05 11:59:16,423 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-05 11:59:16,423 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 192.75) internal successors, (771), 4 states have internal predecessors, (771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1313
[2025-02-05 11:59:16,423 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:59:16,433 INFO  L225             Difference]: With dead ends: 17450
[2025-02-05 11:59:16,433 INFO  L226             Difference]: Without dead ends: 8894
[2025-02-05 11:59:16,438 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-02-05 11:59:16,439 INFO  L435           NwaCegarLoop]: 427 mSDtfsCounter, 217 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 1325 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 1348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time
[2025-02-05 11:59:16,439 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 441 Invalid, 1348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1325 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2025-02-05 11:59:16,445 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 8894 states.
[2025-02-05 11:59:16,501 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 8894 to 8887.
[2025-02-05 11:59:16,507 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 8887 states, 8886 states have (on average 1.0286968264686023) internal successors, (9141), 8886 states have internal predecessors, (9141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:59:16,516 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8887 states to 8887 states and 9141 transitions.
[2025-02-05 11:59:16,516 INFO  L78                 Accepts]: Start accepts. Automaton has 8887 states and 9141 transitions. Word has length 1313
[2025-02-05 11:59:16,517 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:59:16,517 INFO  L471      AbstractCegarLoop]: Abstraction has 8887 states and 9141 transitions.
[2025-02-05 11:59:16,518 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 192.75) internal successors, (771), 4 states have internal predecessors, (771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:59:16,518 INFO  L276                IsEmpty]: Start isEmpty. Operand 8887 states and 9141 transitions.
[2025-02-05 11:59:16,536 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1463
[2025-02-05 11:59:16,536 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:59:16,537 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, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:59:16,537 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2025-02-05 11:59:16,537 INFO  L396      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:59:16,538 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:59:16,538 INFO  L85        PathProgramCache]: Analyzing trace with hash -1217505116, now seen corresponding path program 1 times
[2025-02-05 11:59:16,538 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:59:16,538 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870777356]
[2025-02-05 11:59:16,539 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:59:16,539 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:59:16,638 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1462 statements into 1 equivalence classes.
[2025-02-05 11:59:16,698 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1462 of 1462 statements.
[2025-02-05 11:59:16,698 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:59:16,699 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:59:18,265 INFO  L134       CoverageAnalysis]: Checked inductivity of 4113 backedges. 1587 proven. 1202 refuted. 0 times theorem prover too weak. 1324 trivial. 0 not checked.
[2025-02-05 11:59:18,265 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:59:18,265 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870777356]
[2025-02-05 11:59:18,265 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870777356] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-05 11:59:18,265 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [61947301]
[2025-02-05 11:59:18,266 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:59:18,266 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 11:59:18,266 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 11:59:18,268 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-02-05 11:59:18,271 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2025-02-05 11:59:18,398 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1462 statements into 1 equivalence classes.
[2025-02-05 11:59:18,648 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1462 of 1462 statements.
[2025-02-05 11:59:18,648 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:59:18,648 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:59:18,655 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1694 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-02-05 11:59:18,679 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-05 11:59:19,519 INFO  L134       CoverageAnalysis]: Checked inductivity of 4113 backedges. 2372 proven. 0 refuted. 0 times theorem prover too weak. 1741 trivial. 0 not checked.
[2025-02-05 11:59:19,519 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-02-05 11:59:19,519 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [61947301] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:59:19,519 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-02-05 11:59:19,519 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6
[2025-02-05 11:59:19,519 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190752546]
[2025-02-05 11:59:19,519 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:59:19,520 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:59:19,520 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:59:19,521 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:59:19,521 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2025-02-05 11:59:19,521 INFO  L87              Difference]: Start difference. First operand 8887 states and 9141 transitions. Second operand  has 3 states, 3 states have (on average 167.66666666666666) internal successors, (503), 3 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:59:20,142 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:59:20,142 INFO  L93              Difference]: Finished difference Result 17443 states and 17949 transitions.
[2025-02-05 11:59:20,143 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:59:20,143 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 167.66666666666666) internal successors, (503), 3 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1462
[2025-02-05 11:59:20,143 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:59:20,149 INFO  L225             Difference]: With dead ends: 17443
[2025-02-05 11:59:20,150 INFO  L226             Difference]: Without dead ends: 8887
[2025-02-05 11:59:20,154 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 1466 GetRequests, 1462 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2025-02-05 11:59:20,155 INFO  L435           NwaCegarLoop]: 371 mSDtfsCounter, 113 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 764 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 782 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 764 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-02-05 11:59:20,155 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 377 Invalid, 782 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 764 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-02-05 11:59:20,161 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 8887 states.
[2025-02-05 11:59:20,218 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 8887 to 8887.
[2025-02-05 11:59:20,224 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 8887 states, 8886 states have (on average 1.0247580463650687) internal successors, (9106), 8886 states have internal predecessors, (9106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:59:20,233 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8887 states to 8887 states and 9106 transitions.
[2025-02-05 11:59:20,234 INFO  L78                 Accepts]: Start accepts. Automaton has 8887 states and 9106 transitions. Word has length 1462
[2025-02-05 11:59:20,235 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:59:20,235 INFO  L471      AbstractCegarLoop]: Abstraction has 8887 states and 9106 transitions.
[2025-02-05 11:59:20,235 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 167.66666666666666) internal successors, (503), 3 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:59:20,235 INFO  L276                IsEmpty]: Start isEmpty. Operand 8887 states and 9106 transitions.
[2025-02-05 11:59:20,260 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1793
[2025-02-05 11:59:20,260 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:59:20,261 INFO  L218           NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:59:20,270 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2025-02-05 11:59:20,461 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15
[2025-02-05 11:59:20,462 INFO  L396      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:59:20,462 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:59:20,463 INFO  L85        PathProgramCache]: Analyzing trace with hash 1887997872, now seen corresponding path program 1 times
[2025-02-05 11:59:20,463 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:59:20,463 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456641143]
[2025-02-05 11:59:20,463 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:59:20,463 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:59:20,571 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1792 statements into 1 equivalence classes.
[2025-02-05 11:59:20,690 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1792 of 1792 statements.
[2025-02-05 11:59:20,690 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:59:20,690 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:59:21,628 INFO  L134       CoverageAnalysis]: Checked inductivity of 6580 backedges. 459 proven. 0 refuted. 0 times theorem prover too weak. 6121 trivial. 0 not checked.
[2025-02-05 11:59:21,628 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:59:21,628 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456641143]
[2025-02-05 11:59:21,628 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456641143] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:59:21,628 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:59:21,628 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:59:21,628 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566484530]
[2025-02-05 11:59:21,628 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:59:21,629 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:59:21,629 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:59:21,629 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:59:21,629 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:59:21,629 INFO  L87              Difference]: Start difference. First operand 8887 states and 9106 transitions. Second operand  has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:59:22,318 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:59:22,318 INFO  L93              Difference]: Finished difference Result 23363 states and 23966 transitions.
[2025-02-05 11:59:22,318 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:59:22,318 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 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 1792
[2025-02-05 11:59:22,319 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:59:22,319 INFO  L225             Difference]: With dead ends: 23363
[2025-02-05 11:59:22,319 INFO  L226             Difference]: Without dead ends: 0
[2025-02-05 11:59:22,327 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:59:22,328 INFO  L435           NwaCegarLoop]: 413 mSDtfsCounter, 286 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 816 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 866 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 816 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-02-05 11:59:22,328 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 418 Invalid, 866 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 816 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-02-05 11:59:22,328 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2025-02-05 11:59:22,329 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2025-02-05 11:59:22,329 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:59:22,329 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2025-02-05 11:59:22,329 INFO  L78                 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1792
[2025-02-05 11:59:22,329 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:59:22,330 INFO  L471      AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2025-02-05 11:59:22,330 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:59:22,330 INFO  L276                IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2025-02-05 11:59:22,330 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2025-02-05 11:59:22,333 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2025-02-05 11:59:22,333 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2025-02-05 11:59:22,336 INFO  L422         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:59:22,338 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.
[2025-02-05 11:59:22,940 INFO  L170   ceAbstractionStarter]: Computing trace abstraction results
[2025-02-05 11:59:22,960 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 11:59:22 BoogieIcfgContainer
[2025-02-05 11:59:22,961 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2025-02-05 11:59:22,961 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2025-02-05 11:59:22,961 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2025-02-05 11:59:22,961 INFO  L274        PluginConnector]: Witness Printer initialized
[2025-02-05 11:59:22,964 INFO  L184        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:58:47" (3/4) ...
[2025-02-05 11:59:22,966 INFO  L146         WitnessPrinter]: Generating witness for correct program
[2025-02-05 11:59:22,998 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges
[2025-02-05 11:59:23,000 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges
[2025-02-05 11:59:23,002 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges
[2025-02-05 11:59:23,003 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges
[2025-02-05 11:59:23,177 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml
[2025-02-05 11:59:23,177 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml
[2025-02-05 11:59:23,177 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2025-02-05 11:59:23,178 INFO  L158              Benchmark]: Toolchain (without parser) took 39331.74ms. Allocated memory was 142.6MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 107.4MB in the beginning and 657.3MB in the end (delta: -549.8MB). Peak memory consumption was 510.8MB. Max. memory is 16.1GB.
[2025-02-05 11:59:23,178 INFO  L158              Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 123.8MB. There was no memory consumed. Max. memory is 16.1GB.
[2025-02-05 11:59:23,178 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 688.98ms. Allocated memory is still 142.6MB. Free memory was 107.4MB in the beginning and 50.3MB in the end (delta: 57.1MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB.
[2025-02-05 11:59:23,179 INFO  L158              Benchmark]: Boogie Procedure Inliner took 188.93ms. Allocated memory is still 142.6MB. Free memory was 49.9MB in the beginning and 89.6MB in the end (delta: -39.8MB). Peak memory consumption was 29.2MB. Max. memory is 16.1GB.
[2025-02-05 11:59:23,179 INFO  L158              Benchmark]: Boogie Preprocessor took 188.65ms. Allocated memory is still 142.6MB. Free memory was 89.6MB in the beginning and 57.2MB in the end (delta: 32.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB.
[2025-02-05 11:59:23,179 INFO  L158              Benchmark]: IcfgBuilder took 2251.99ms. Allocated memory was 142.6MB in the beginning and 201.3MB in the end (delta: 58.7MB). Free memory was 57.2MB in the beginning and 70.3MB in the end (delta: -13.1MB). Peak memory consumption was 50.9MB. Max. memory is 16.1GB.
[2025-02-05 11:59:23,179 INFO  L158              Benchmark]: TraceAbstraction took 35789.14ms. Allocated memory was 201.3MB in the beginning and 1.2GB in the end (delta: 998.2MB). Free memory was 70.3MB in the beginning and 682.2MB in the end (delta: -611.9MB). Peak memory consumption was 389.1MB. Max. memory is 16.1GB.
[2025-02-05 11:59:23,180 INFO  L158              Benchmark]: Witness Printer took 216.07ms. Allocated memory is still 1.2GB. Free memory was 682.2MB in the beginning and 657.3MB in the end (delta: 25.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
[2025-02-05 11:59:23,181 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.21ms. Allocated memory is still 201.3MB. Free memory is still 123.8MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 688.98ms. Allocated memory is still 142.6MB. Free memory was 107.4MB in the beginning and 50.3MB in the end (delta: 57.1MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 188.93ms. Allocated memory is still 142.6MB. Free memory was 49.9MB in the beginning and 89.6MB in the end (delta: -39.8MB). Peak memory consumption was 29.2MB. Max. memory is 16.1GB.
 * Boogie Preprocessor took 188.65ms. Allocated memory is still 142.6MB. Free memory was 89.6MB in the beginning and 57.2MB in the end (delta: 32.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB.
 * IcfgBuilder took 2251.99ms. Allocated memory was 142.6MB in the beginning and 201.3MB in the end (delta: 58.7MB). Free memory was 57.2MB in the beginning and 70.3MB in the end (delta: -13.1MB). Peak memory consumption was 50.9MB. Max. memory is 16.1GB.
 * TraceAbstraction took 35789.14ms. Allocated memory was 201.3MB in the beginning and 1.2GB in the end (delta: 998.2MB). Free memory was 70.3MB in the beginning and 682.2MB in the end (delta: -611.9MB). Peak memory consumption was 389.1MB. Max. memory is 16.1GB.
 * Witness Printer took 216.07ms. Allocated memory is still 1.2GB. Free memory was 682.2MB in the beginning and 657.3MB in the end (delta: 25.0MB). Peak memory consumption was 25.2MB. 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: 161]: 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, 396 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 35.1s, OverallIterations: 17, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 16.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5057 SdHoareTripleChecker+Valid, 15.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5057 mSDsluCounter, 5193 SdHoareTripleChecker+Invalid, 12.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 247 mSDsCounter, 2471 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 15355 IncrementalHoareTripleChecker+Invalid, 17826 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2471 mSolverCounterUnsat, 4946 mSDtfsCounter, 15355 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2026 GetRequests, 1993 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8887occurred in iteration=12, InterpolantAutomatonStates: 60, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.3s AutomataMinimizationTime, 17 MinimizatonAttempts, 2311 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 13.4s InterpolantComputationTime, 15280 NumberOfCodeBlocks, 15280 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 15261 ConstructedInterpolants, 0 QuantifiedInterpolants, 33488 SizeOfPredicates, 0 NumberOfNonLiveVariables, 2292 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 19 InterpolantComputations, 17 PerfectInterpolantSequences, 32452/33696 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: 1783]: Location Invariant
    Derived location invariant: ((((((((((((((a16 == 10) && (a12 == 8)) && (a15 == 3)) || ((((a15 <= 3) && (a12 == 8)) && (((long long) a18 + 156) <= 0)) && (a16 <= 11))) || ((((a16 != 10) && (a12 == 8)) && (a16 <= 11)) && (4 <= a15))) || ((a12 == 6) && (a16 <= 11))) || (((a12 == 9) && (a16 != 10)) && (a16 <= 11))) || ((a15 <= 3) && (a12 <= 7))) || ((a12 == 9) && (a15 <= 3))) || ((a16 <= 8) && (a15 <= 3))) || ((a12 <= 5) && (a16 <= 11))) || (((a16 != 10) && (a12 <= 7)) && (a16 <= 11))) || ((((a15 <= 3) && (a12 == 8)) && (27 <= a18)) && (a16 <= 11))) || (((a15 <= 3) && (a12 == 8)) && (11 <= a16)))
RESULT: Ultimate proved your program to be correct!
[2025-02-05 11:59:23,200 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0
Received shutdown request...
--- End real Ultimate output ---

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