./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem17_label02.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/Problem17_label02.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 adb370abe9a266817aee227dfaf2ff5e2cfdcfe49f97cfc66a125d7a6f5fbb19
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-c00e63d-m
[2025-02-05 12:01:03,106 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-02-05 12:01:03,171 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2025-02-05 12:01:03,175 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-02-05 12:01:03,175 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-02-05 12:01:03,207 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-02-05 12:01:03,208 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-02-05 12:01:03,208 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-02-05 12:01:03,208 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-02-05 12:01:03,208 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-02-05 12:01:03,208 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-02-05 12:01:03,208 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-02-05 12:01:03,208 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-02-05 12:01:03,212 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-02-05 12:01:03,213 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-02-05 12:01:03,213 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-02-05 12:01:03,213 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-02-05 12:01:03,213 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-02-05 12:01:03,213 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-02-05 12:01:03,213 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-02-05 12:01:03,213 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-02-05 12:01:03,213 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-02-05 12:01:03,213 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-02-05 12:01:03,213 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-02-05 12:01:03,213 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-02-05 12:01:03,213 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-02-05 12:01:03,213 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-02-05 12:01:03,213 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-02-05 12:01:03,214 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-02-05 12:01:03,214 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-02-05 12:01:03,214 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-02-05 12:01:03,214 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-02-05 12:01:03,214 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-02-05 12:01:03,214 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-02-05 12:01:03,214 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-02-05 12:01:03,214 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-02-05 12:01:03,214 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-02-05 12:01:03,214 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-02-05 12:01:03,214 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-02-05 12:01:03,214 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-02-05 12:01:03,214 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-02-05 12:01:03,214 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-02-05 12:01:03,214 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-02-05 12:01:03,214 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 -> adb370abe9a266817aee227dfaf2ff5e2cfdcfe49f97cfc66a125d7a6f5fbb19
[2025-02-05 12:01:03,432 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-02-05 12:01:03,437 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-02-05 12:01:03,438 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-02-05 12:01:03,439 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-02-05 12:01:03,439 INFO  L274        PluginConnector]: CDTParser initialized
[2025-02-05 12:01:03,439 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem17_label02.c
[2025-02-05 12:01:04,673 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fad4e04fd/33e8436122444ebda67aa86b62a6fb80/FLAG45713afe2
[2025-02-05 12:01:05,254 INFO  L384              CDTParser]: Found 1 translation units.
[2025-02-05 12:01:05,259 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label02.c
[2025-02-05 12:01:05,286 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fad4e04fd/33e8436122444ebda67aa86b62a6fb80/FLAG45713afe2
[2025-02-05 12:01:05,773 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fad4e04fd/33e8436122444ebda67aa86b62a6fb80
[2025-02-05 12:01:05,775 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-02-05 12:01:05,777 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-02-05 12:01:05,778 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-02-05 12:01:05,778 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-02-05 12:01:05,782 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-02-05 12:01:05,783 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 12:01:05" (1/1) ...
[2025-02-05 12:01:05,784 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47a85c73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:01:05, skipping insertion in model container
[2025-02-05 12:01:05,784 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 12:01:05" (1/1) ...
[2025-02-05 12:01:05,841 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-02-05 12:01:06,070 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/Problem17_label02.c[7859,7872]
[2025-02-05 12:01:06,402 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-05 12:01:06,410 INFO  L200         MainTranslator]: Completed pre-run
[2025-02-05 12:01:06,434 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/Problem17_label02.c[7859,7872]
[2025-02-05 12:01:06,636 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-05 12:01:06,652 INFO  L204         MainTranslator]: Completed translation
[2025-02-05 12:01:06,653 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:01:06 WrapperNode
[2025-02-05 12:01:06,653 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-02-05 12:01:06,654 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-02-05 12:01:06,654 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-02-05 12:01:06,654 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-02-05 12:01:06,658 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:01:06" (1/1) ...
[2025-02-05 12:01:06,699 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:01:06" (1/1) ...
[2025-02-05 12:01:06,926 INFO  L138                Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 2610
[2025-02-05 12:01:06,927 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-02-05 12:01:06,927 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-02-05 12:01:06,927 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-02-05 12:01:06,927 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-02-05 12:01:06,935 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:01:06" (1/1) ...
[2025-02-05 12:01:06,936 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:01:06" (1/1) ...
[2025-02-05 12:01:07,042 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:01:06" (1/1) ...
[2025-02-05 12:01:07,206 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 12:01:07,206 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:01:06" (1/1) ...
[2025-02-05 12:01:07,206 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:01:06" (1/1) ...
[2025-02-05 12:01:07,360 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:01:06" (1/1) ...
[2025-02-05 12:01:07,381 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:01:06" (1/1) ...
[2025-02-05 12:01:07,406 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:01:06" (1/1) ...
[2025-02-05 12:01:07,424 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:01:06" (1/1) ...
[2025-02-05 12:01:07,475 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-02-05 12:01:07,477 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-02-05 12:01:07,477 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-02-05 12:01:07,477 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-02-05 12:01:07,480 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:01:06" (1/1) ...
[2025-02-05 12:01:07,485 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-02-05 12:01:07,498 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 12:01:07,518 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 12:01:07,532 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 12:01:07,562 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-02-05 12:01:07,562 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-02-05 12:01:07,562 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-02-05 12:01:07,562 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-02-05 12:01:07,621 INFO  L257             CfgBuilder]: Building ICFG
[2025-02-05 12:01:07,622 INFO  L287             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-02-05 12:01:10,630 INFO  L1309  $ProcedureCfgBuilder]: dead code at ProgramPoint L1653: havoc calculate_output_#t~ret7#1;
[2025-02-05 12:01:10,883 INFO  L?                        ?]: Removed 372 outVars from TransFormulas that were not future-live.
[2025-02-05 12:01:10,883 INFO  L308             CfgBuilder]: Performing block encoding
[2025-02-05 12:01:10,905 INFO  L332             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-02-05 12:01:10,906 INFO  L337             CfgBuilder]: Removed 0 assume(true) statements.
[2025-02-05 12:01:10,906 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 12:01:10 BoogieIcfgContainer
[2025-02-05 12:01:10,907 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-02-05 12:01:10,909 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-02-05 12:01:10,909 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-02-05 12:01:10,913 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-02-05 12:01:10,914 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 12:01:05" (1/3) ...
[2025-02-05 12:01:10,914 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@157d4fb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 12:01:10, skipping insertion in model container
[2025-02-05 12:01:10,914 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:01:06" (2/3) ...
[2025-02-05 12:01:10,915 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@157d4fb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 12:01:10, skipping insertion in model container
[2025-02-05 12:01:10,915 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 12:01:10" (3/3) ...
[2025-02-05 12:01:10,916 INFO  L128   eAbstractionObserver]: Analyzing ICFG Problem17_label02.c
[2025-02-05 12:01:10,929 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-02-05 12:01:10,931 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG Problem17_label02.c that has 1 procedures, 590 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-02-05 12:01:10,989 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-02-05 12:01:10,999 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;@47c924da, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-02-05 12:01:10,999 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-02-05 12:01:11,005 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 590 states, 588 states have (on average 1.804421768707483) internal successors, (1061), 589 states have internal predecessors, (1061), 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 12:01:11,011 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 54
[2025-02-05 12:01:11,012 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:01:11,013 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 12:01:11,013 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:01:11,017 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:01:11,018 INFO  L85        PathProgramCache]: Analyzing trace with hash -156949145, now seen corresponding path program 1 times
[2025-02-05 12:01:11,024 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:01:11,025 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491208180]
[2025-02-05 12:01:11,025 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:01:11,026 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:01:11,095 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes.
[2025-02-05 12:01:11,126 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements.
[2025-02-05 12:01:11,126 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:01:11,126 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:01:11,307 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 12:01:11,307 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:01:11,308 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491208180]
[2025-02-05 12:01:11,308 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491208180] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 12:01:11,308 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 12:01:11,309 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-02-05 12:01:11,310 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203906696]
[2025-02-05 12:01:11,310 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:01:11,313 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 12:01:11,314 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:01:11,328 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 12:01:11,329 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 12:01:11,332 INFO  L87              Difference]: Start difference. First operand  has 590 states, 588 states have (on average 1.804421768707483) internal successors, (1061), 589 states have internal predecessors, (1061), 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 17.666666666666668) internal successors, (53), 2 states have internal predecessors, (53), 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 12:01:13,781 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:01:13,782 INFO  L93              Difference]: Finished difference Result 1644 states and 3026 transitions.
[2025-02-05 12:01:13,783 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 12:01:13,784 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 2 states have internal predecessors, (53), 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 53
[2025-02-05 12:01:13,785 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:01:13,798 INFO  L225             Difference]: With dead ends: 1644
[2025-02-05 12:01:13,798 INFO  L226             Difference]: Without dead ends: 977
[2025-02-05 12:01:13,802 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 12:01:13,804 INFO  L435           NwaCegarLoop]: 425 mSDtfsCounter, 435 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 1470 mSolverCounterSat, 332 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 435 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 1802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 332 IncrementalHoareTripleChecker+Valid, 1470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time
[2025-02-05 12:01:13,805 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [435 Valid, 503 Invalid, 1802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [332 Valid, 1470 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time]
[2025-02-05 12:01:13,819 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 977 states.
[2025-02-05 12:01:13,865 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 971.
[2025-02-05 12:01:13,868 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 971 states, 970 states have (on average 1.5536082474226804) internal successors, (1507), 970 states have internal predecessors, (1507), 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 12:01:13,875 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 971 states to 971 states and 1507 transitions.
[2025-02-05 12:01:13,876 INFO  L78                 Accepts]: Start accepts. Automaton has 971 states and 1507 transitions. Word has length 53
[2025-02-05 12:01:13,877 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:01:13,877 INFO  L471      AbstractCegarLoop]: Abstraction has 971 states and 1507 transitions.
[2025-02-05 12:01:13,877 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 2 states have internal predecessors, (53), 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 12:01:13,877 INFO  L276                IsEmpty]: Start isEmpty. Operand 971 states and 1507 transitions.
[2025-02-05 12:01:13,880 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 121
[2025-02-05 12:01:13,880 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:01:13,881 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 12:01:13,881 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2025-02-05 12:01:13,881 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:01:13,882 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:01:13,882 INFO  L85        PathProgramCache]: Analyzing trace with hash -1814424858, now seen corresponding path program 1 times
[2025-02-05 12:01:13,882 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:01:13,882 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330097208]
[2025-02-05 12:01:13,882 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:01:13,883 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:01:13,906 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes.
[2025-02-05 12:01:13,937 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements.
[2025-02-05 12:01:13,937 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:01:13,937 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:01:14,112 INFO  L134       CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 12:01:14,113 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:01:14,113 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330097208]
[2025-02-05 12:01:14,113 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330097208] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 12:01:14,113 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 12:01:14,113 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-02-05 12:01:14,113 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810180868]
[2025-02-05 12:01:14,113 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:01:14,115 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 12:01:14,116 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:01:14,116 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 12:01:14,116 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 12:01:14,117 INFO  L87              Difference]: Start difference. First operand 971 states and 1507 transitions. Second operand  has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 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 12:01:16,248 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:01:16,248 INFO  L93              Difference]: Finished difference Result 2813 states and 4381 transitions.
[2025-02-05 12:01:16,248 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 12:01:16,249 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 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 120
[2025-02-05 12:01:16,249 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:01:16,254 INFO  L225             Difference]: With dead ends: 2813
[2025-02-05 12:01:16,255 INFO  L226             Difference]: Without dead ends: 1844
[2025-02-05 12:01:16,256 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 12:01:16,256 INFO  L435           NwaCegarLoop]: 507 mSDtfsCounter, 405 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 1381 mSolverCounterSat, 325 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 1706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 325 IncrementalHoareTripleChecker+Valid, 1381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time
[2025-02-05 12:01:16,256 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [405 Valid, 580 Invalid, 1706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [325 Valid, 1381 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time]
[2025-02-05 12:01:16,258 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1844 states.
[2025-02-05 12:01:16,290 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1844 to 1841.
[2025-02-05 12:01:16,293 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1841 states, 1840 states have (on average 1.35) internal successors, (2484), 1840 states have internal predecessors, (2484), 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 12:01:16,298 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1841 states to 1841 states and 2484 transitions.
[2025-02-05 12:01:16,299 INFO  L78                 Accepts]: Start accepts. Automaton has 1841 states and 2484 transitions. Word has length 120
[2025-02-05 12:01:16,299 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:01:16,299 INFO  L471      AbstractCegarLoop]: Abstraction has 1841 states and 2484 transitions.
[2025-02-05 12:01:16,299 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 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 12:01:16,300 INFO  L276                IsEmpty]: Start isEmpty. Operand 1841 states and 2484 transitions.
[2025-02-05 12:01:16,303 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 124
[2025-02-05 12:01:16,304 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:01:16,304 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 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 12:01:16,305 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-02-05 12:01:16,305 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:01:16,306 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:01:16,308 INFO  L85        PathProgramCache]: Analyzing trace with hash -46201250, now seen corresponding path program 1 times
[2025-02-05 12:01:16,308 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:01:16,309 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407338021]
[2025-02-05 12:01:16,309 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:01:16,309 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:01:16,329 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes.
[2025-02-05 12:01:16,356 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements.
[2025-02-05 12:01:16,357 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:01:16,357 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:01:16,723 INFO  L134       CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 12:01:16,724 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:01:16,724 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407338021]
[2025-02-05 12:01:16,724 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407338021] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 12:01:16,724 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 12:01:16,725 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 12:01:16,725 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305616288]
[2025-02-05 12:01:16,726 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:01:16,726 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 12:01:16,726 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:01:16,726 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 12:01:16,726 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-02-05 12:01:16,727 INFO  L87              Difference]: Start difference. First operand 1841 states and 2484 transitions. Second operand  has 4 states, 4 states have (on average 30.75) internal successors, (123), 3 states have internal predecessors, (123), 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 12:01:19,588 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:01:19,588 INFO  L93              Difference]: Finished difference Result 6765 states and 9258 transitions.
[2025-02-05 12:01:19,589 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 12:01:19,589 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 30.75) internal successors, (123), 3 states have internal predecessors, (123), 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 123
[2025-02-05 12:01:19,589 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:01:19,603 INFO  L225             Difference]: With dead ends: 6765
[2025-02-05 12:01:19,603 INFO  L226             Difference]: Without dead ends: 4926
[2025-02-05 12:01:19,605 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-02-05 12:01:19,606 INFO  L435           NwaCegarLoop]: 201 mSDtfsCounter, 859 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 2789 mSolverCounterSat, 594 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 859 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 3383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 594 IncrementalHoareTripleChecker+Valid, 2789 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time
[2025-02-05 12:01:19,606 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [859 Valid, 328 Invalid, 3383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [594 Valid, 2789 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time]
[2025-02-05 12:01:19,609 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 4926 states.
[2025-02-05 12:01:19,656 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 4926 to 4875.
[2025-02-05 12:01:19,661 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 4875 states, 4874 states have (on average 1.286417726713172) internal successors, (6270), 4874 states have internal predecessors, (6270), 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 12:01:19,670 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4875 states to 4875 states and 6270 transitions.
[2025-02-05 12:01:19,671 INFO  L78                 Accepts]: Start accepts. Automaton has 4875 states and 6270 transitions. Word has length 123
[2025-02-05 12:01:19,671 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:01:19,671 INFO  L471      AbstractCegarLoop]: Abstraction has 4875 states and 6270 transitions.
[2025-02-05 12:01:19,671 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 30.75) internal successors, (123), 3 states have internal predecessors, (123), 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 12:01:19,672 INFO  L276                IsEmpty]: Start isEmpty. Operand 4875 states and 6270 transitions.
[2025-02-05 12:01:19,674 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 195
[2025-02-05 12:01:19,674 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:01:19,674 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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]
[2025-02-05 12:01:19,674 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-02-05 12:01:19,674 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:01:19,675 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:01:19,675 INFO  L85        PathProgramCache]: Analyzing trace with hash 161187097, now seen corresponding path program 1 times
[2025-02-05 12:01:19,675 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:01:19,675 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577716243]
[2025-02-05 12:01:19,675 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:01:19,675 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:01:19,705 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes.
[2025-02-05 12:01:19,734 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements.
[2025-02-05 12:01:19,735 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:01:19,735 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:01:20,020 INFO  L134       CoverageAnalysis]: Checked inductivity of 170 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked.
[2025-02-05 12:01:20,020 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:01:20,020 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577716243]
[2025-02-05 12:01:20,020 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577716243] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 12:01:20,020 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 12:01:20,020 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-02-05 12:01:20,020 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115825642]
[2025-02-05 12:01:20,020 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:01:20,020 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 12:01:20,020 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:01:20,021 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 12:01:20,021 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 12:01:20,021 INFO  L87              Difference]: Start difference. First operand 4875 states and 6270 transitions. Second operand  has 3 states, 3 states have (on average 42.0) internal successors, (126), 2 states have internal predecessors, (126), 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 12:01:22,383 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:01:22,384 INFO  L93              Difference]: Finished difference Result 14436 states and 18541 transitions.
[2025-02-05 12:01:22,385 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 12:01:22,385 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 42.0) internal successors, (126), 2 states have internal predecessors, (126), 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 194
[2025-02-05 12:01:22,385 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:01:22,434 INFO  L225             Difference]: With dead ends: 14436
[2025-02-05 12:01:22,434 INFO  L226             Difference]: Without dead ends: 8277
[2025-02-05 12:01:22,446 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 12:01:22,449 INFO  L435           NwaCegarLoop]: 514 mSDtfsCounter, 386 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 1629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 548 IncrementalHoareTripleChecker+Valid, 1081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time
[2025-02-05 12:01:22,450 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 589 Invalid, 1629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 1081 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time]
[2025-02-05 12:01:22,460 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 8277 states.
[2025-02-05 12:01:22,570 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 8277 to 6147.
[2025-02-05 12:01:22,580 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 6147 states, 6146 states have (on average 1.1906931337455255) internal successors, (7318), 6146 states have internal predecessors, (7318), 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 12:01:22,595 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6147 states to 6147 states and 7318 transitions.
[2025-02-05 12:01:22,596 INFO  L78                 Accepts]: Start accepts. Automaton has 6147 states and 7318 transitions. Word has length 194
[2025-02-05 12:01:22,596 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:01:22,596 INFO  L471      AbstractCegarLoop]: Abstraction has 6147 states and 7318 transitions.
[2025-02-05 12:01:22,596 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 42.0) internal successors, (126), 2 states have internal predecessors, (126), 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 12:01:22,596 INFO  L276                IsEmpty]: Start isEmpty. Operand 6147 states and 7318 transitions.
[2025-02-05 12:01:22,598 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 208
[2025-02-05 12:01:22,600 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:01:22,600 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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]
[2025-02-05 12:01:22,600 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-02-05 12:01:22,600 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:01:22,601 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:01:22,601 INFO  L85        PathProgramCache]: Analyzing trace with hash 875758791, now seen corresponding path program 1 times
[2025-02-05 12:01:22,601 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:01:22,601 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157352287]
[2025-02-05 12:01:22,601 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:01:22,601 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:01:22,624 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes.
[2025-02-05 12:01:22,639 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements.
[2025-02-05 12:01:22,640 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:01:22,640 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:01:22,763 INFO  L134       CoverageAnalysis]: Checked inductivity of 171 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked.
[2025-02-05 12:01:22,764 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:01:22,764 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157352287]
[2025-02-05 12:01:22,764 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157352287] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 12:01:22,764 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 12:01:22,764 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 12:01:22,764 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548404116]
[2025-02-05 12:01:22,765 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:01:22,765 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 12:01:22,765 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:01:22,765 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 12:01:22,765 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 12:01:22,766 INFO  L87              Difference]: Start difference. First operand 6147 states and 7318 transitions. Second operand  has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 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 12:01:24,997 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:01:24,997 INFO  L93              Difference]: Finished difference Result 15692 states and 18897 transitions.
[2025-02-05 12:01:24,998 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 12:01:24,998 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 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 207
[2025-02-05 12:01:24,999 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:01:25,028 INFO  L225             Difference]: With dead ends: 15692
[2025-02-05 12:01:25,028 INFO  L226             Difference]: Without dead ends: 9547
[2025-02-05 12:01:25,038 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 12:01:25,039 INFO  L435           NwaCegarLoop]: 413 mSDtfsCounter, 407 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 1274 mSolverCounterSat, 318 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 1592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 318 IncrementalHoareTripleChecker+Valid, 1274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time
[2025-02-05 12:01:25,039 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 477 Invalid, 1592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [318 Valid, 1274 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time]
[2025-02-05 12:01:25,050 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 9547 states.
[2025-02-05 12:01:25,152 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 9547 to 6124.
[2025-02-05 12:01:25,162 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 6124 states, 6123 states have (on average 1.1894496162012085) internal successors, (7283), 6123 states have internal predecessors, (7283), 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 12:01:25,178 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6124 states to 6124 states and 7283 transitions.
[2025-02-05 12:01:25,178 INFO  L78                 Accepts]: Start accepts. Automaton has 6124 states and 7283 transitions. Word has length 207
[2025-02-05 12:01:25,178 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:01:25,178 INFO  L471      AbstractCegarLoop]: Abstraction has 6124 states and 7283 transitions.
[2025-02-05 12:01:25,179 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 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 12:01:25,179 INFO  L276                IsEmpty]: Start isEmpty. Operand 6124 states and 7283 transitions.
[2025-02-05 12:01:25,181 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 215
[2025-02-05 12:01:25,181 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:01:25,182 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 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 12:01:25,182 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-02-05 12:01:25,182 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:01:25,183 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:01:25,183 INFO  L85        PathProgramCache]: Analyzing trace with hash -296155943, now seen corresponding path program 1 times
[2025-02-05 12:01:25,183 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:01:25,183 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154662472]
[2025-02-05 12:01:25,183 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:01:25,183 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:01:25,203 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes.
[2025-02-05 12:01:25,219 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements.
[2025-02-05 12:01:25,220 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:01:25,220 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:01:25,433 INFO  L134       CoverageAnalysis]: Checked inductivity of 176 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 12:01:25,433 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:01:25,433 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154662472]
[2025-02-05 12:01:25,433 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154662472] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 12:01:25,433 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 12:01:25,433 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 12:01:25,434 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912514514]
[2025-02-05 12:01:25,436 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:01:25,437 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 12:01:25,437 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:01:25,437 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 12:01:25,437 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 12:01:25,438 INFO  L87              Difference]: Start difference. First operand 6124 states and 7283 transitions. Second operand  has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 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 12:01:27,399 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:01:27,399 INFO  L93              Difference]: Finished difference Result 16078 states and 19444 transitions.
[2025-02-05 12:01:27,400 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 12:01:27,400 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 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 12:01:27,400 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:01:27,429 INFO  L225             Difference]: With dead ends: 16078
[2025-02-05 12:01:27,429 INFO  L226             Difference]: Without dead ends: 9956
[2025-02-05 12:01:27,437 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 12:01:27,438 INFO  L435           NwaCegarLoop]: 734 mSDtfsCounter, 487 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 1224 mSolverCounterSat, 320 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 487 SdHoareTripleChecker+Valid, 788 SdHoareTripleChecker+Invalid, 1544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 320 IncrementalHoareTripleChecker+Valid, 1224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time
[2025-02-05 12:01:27,438 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [487 Valid, 788 Invalid, 1544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [320 Valid, 1224 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time]
[2025-02-05 12:01:27,446 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 9956 states.
[2025-02-05 12:01:27,599 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 9956 to 9956.
[2025-02-05 12:01:27,617 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 9956 states, 9955 states have (on average 1.171672526368659) internal successors, (11664), 9955 states have internal predecessors, (11664), 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 12:01:27,643 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9956 states to 9956 states and 11664 transitions.
[2025-02-05 12:01:27,644 INFO  L78                 Accepts]: Start accepts. Automaton has 9956 states and 11664 transitions. Word has length 214
[2025-02-05 12:01:27,644 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:01:27,644 INFO  L471      AbstractCegarLoop]: Abstraction has 9956 states and 11664 transitions.
[2025-02-05 12:01:27,645 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 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 12:01:27,646 INFO  L276                IsEmpty]: Start isEmpty. Operand 9956 states and 11664 transitions.
[2025-02-05 12:01:27,653 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 278
[2025-02-05 12:01:27,653 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:01:27,653 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 12:01:27,654 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-02-05 12:01:27,654 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:01:27,654 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:01:27,654 INFO  L85        PathProgramCache]: Analyzing trace with hash 1989467582, now seen corresponding path program 1 times
[2025-02-05 12:01:27,655 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:01:27,655 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304214416]
[2025-02-05 12:01:27,655 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:01:27,655 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:01:27,683 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 277 statements into 1 equivalence classes.
[2025-02-05 12:01:27,715 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 277 of 277 statements.
[2025-02-05 12:01:27,715 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:01:27,716 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:01:28,104 INFO  L134       CoverageAnalysis]: Checked inductivity of 361 backedges. 240 proven. 70 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked.
[2025-02-05 12:01:28,105 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:01:28,105 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304214416]
[2025-02-05 12:01:28,105 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304214416] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-05 12:01:28,105 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [144331459]
[2025-02-05 12:01:28,105 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:01:28,106 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 12:01:28,106 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 12:01:28,111 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 12:01:28,113 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 12:01:28,158 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 277 statements into 1 equivalence classes.
[2025-02-05 12:01:28,207 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 277 of 277 statements.
[2025-02-05 12:01:28,207 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:01:28,207 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:01:28,210 INFO  L256         TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 4 conjuncts are in the unsatisfiable core
[2025-02-05 12:01:28,218 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-05 12:01:28,475 INFO  L134       CoverageAnalysis]: Checked inductivity of 361 backedges. 240 proven. 70 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked.
[2025-02-05 12:01:28,476 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-02-05 12:01:28,799 INFO  L134       CoverageAnalysis]: Checked inductivity of 361 backedges. 310 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked.
[2025-02-05 12:01:28,799 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [144331459] provided 1 perfect and 1 imperfect interpolant sequences
[2025-02-05 12:01:28,799 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences.
[2025-02-05 12:01:28,799 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5
[2025-02-05 12:01:28,800 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381098469]
[2025-02-05 12:01:28,800 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:01:28,800 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 12:01:28,800 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:01:28,801 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 12:01:28,801 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-02-05 12:01:28,801 INFO  L87              Difference]: Start difference. First operand 9956 states and 11664 transitions. Second operand  has 4 states, 4 states have (on average 56.75) internal successors, (227), 3 states have internal predecessors, (227), 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 12:01:31,803 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:01:31,803 INFO  L93              Difference]: Finished difference Result 30575 states and 36167 transitions.
[2025-02-05 12:01:31,804 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 12:01:31,805 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 56.75) internal successors, (227), 3 states have internal predecessors, (227), 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 277
[2025-02-05 12:01:31,805 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:01:31,832 INFO  L225             Difference]: With dead ends: 30575
[2025-02-05 12:01:31,833 INFO  L226             Difference]: Without dead ends: 19763
[2025-02-05 12:01:31,843 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 555 GetRequests, 551 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-02-05 12:01:31,844 INFO  L435           NwaCegarLoop]: 84 mSDtfsCounter, 889 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 2266 mSolverCounterSat, 734 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 889 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 3000 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 734 IncrementalHoareTripleChecker+Valid, 2266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time
[2025-02-05 12:01:31,844 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [889 Valid, 161 Invalid, 3000 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [734 Valid, 2266 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time]
[2025-02-05 12:01:31,854 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 19763 states.
[2025-02-05 12:01:32,020 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 19763 to 19760.
[2025-02-05 12:01:32,049 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 19760 states, 19759 states have (on average 1.1599777316665822) internal successors, (22920), 19759 states have internal predecessors, (22920), 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 12:01:32,076 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 19760 states to 19760 states and 22920 transitions.
[2025-02-05 12:01:32,077 INFO  L78                 Accepts]: Start accepts. Automaton has 19760 states and 22920 transitions. Word has length 277
[2025-02-05 12:01:32,078 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:01:32,078 INFO  L471      AbstractCegarLoop]: Abstraction has 19760 states and 22920 transitions.
[2025-02-05 12:01:32,079 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 56.75) internal successors, (227), 3 states have internal predecessors, (227), 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 12:01:32,079 INFO  L276                IsEmpty]: Start isEmpty. Operand 19760 states and 22920 transitions.
[2025-02-05 12:01:32,082 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 291
[2025-02-05 12:01:32,082 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:01:32,082 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 12:01:32,090 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2025-02-05 12:01:32,286 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 12:01:32,286 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:01:32,287 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:01:32,287 INFO  L85        PathProgramCache]: Analyzing trace with hash 1625610500, now seen corresponding path program 1 times
[2025-02-05 12:01:32,287 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:01:32,287 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025930357]
[2025-02-05 12:01:32,287 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:01:32,287 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:01:32,315 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 290 statements into 1 equivalence classes.
[2025-02-05 12:01:32,328 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 290 of 290 statements.
[2025-02-05 12:01:32,329 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:01:32,329 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:01:32,447 INFO  L134       CoverageAnalysis]: Checked inductivity of 376 backedges. 295 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked.
[2025-02-05 12:01:32,448 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:01:32,448 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025930357]
[2025-02-05 12:01:32,448 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025930357] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 12:01:32,448 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 12:01:32,448 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 12:01:32,448 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600389428]
[2025-02-05 12:01:32,448 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:01:32,449 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 12:01:32,449 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:01:32,449 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 12:01:32,449 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 12:01:32,449 INFO  L87              Difference]: Start difference. First operand 19760 states and 22920 transitions. Second operand  has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:01:34,506 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:01:34,507 INFO  L93              Difference]: Finished difference Result 42909 states and 49989 transitions.
[2025-02-05 12:01:34,510 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 12:01:34,511 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 290
[2025-02-05 12:01:34,511 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:01:34,547 INFO  L225             Difference]: With dead ends: 42909
[2025-02-05 12:01:34,548 INFO  L226             Difference]: Without dead ends: 23151
[2025-02-05 12:01:34,567 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 12:01:34,568 INFO  L435           NwaCegarLoop]: 826 mSDtfsCounter, 374 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 1237 mSolverCounterSat, 220 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 896 SdHoareTripleChecker+Invalid, 1457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 220 IncrementalHoareTripleChecker+Valid, 1237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time
[2025-02-05 12:01:34,568 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [374 Valid, 896 Invalid, 1457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [220 Valid, 1237 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time]
[2025-02-05 12:01:34,584 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 23151 states.
[2025-02-05 12:01:34,724 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 23151 to 22725.
[2025-02-05 12:01:34,744 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 22725 states, 22724 states have (on average 1.1456169688435134) internal successors, (26033), 22724 states have internal predecessors, (26033), 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 12:01:34,862 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 22725 states to 22725 states and 26033 transitions.
[2025-02-05 12:01:34,863 INFO  L78                 Accepts]: Start accepts. Automaton has 22725 states and 26033 transitions. Word has length 290
[2025-02-05 12:01:34,863 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:01:34,863 INFO  L471      AbstractCegarLoop]: Abstraction has 22725 states and 26033 transitions.
[2025-02-05 12:01:34,864 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:01:34,864 INFO  L276                IsEmpty]: Start isEmpty. Operand 22725 states and 26033 transitions.
[2025-02-05 12:01:34,868 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 314
[2025-02-05 12:01:34,868 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:01:34,868 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 12:01:34,868 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-02-05 12:01:34,868 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:01:34,869 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:01:34,869 INFO  L85        PathProgramCache]: Analyzing trace with hash -1054859329, now seen corresponding path program 1 times
[2025-02-05 12:01:34,869 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:01:34,869 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720286154]
[2025-02-05 12:01:34,869 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:01:34,869 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:01:34,899 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 313 statements into 1 equivalence classes.
[2025-02-05 12:01:34,925 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 313 of 313 statements.
[2025-02-05 12:01:34,925 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:01:34,926 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:01:35,201 INFO  L134       CoverageAnalysis]: Checked inductivity of 377 backedges. 295 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked.
[2025-02-05 12:01:35,201 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:01:35,201 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720286154]
[2025-02-05 12:01:35,201 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720286154] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 12:01:35,201 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 12:01:35,201 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-05 12:01:35,201 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893049414]
[2025-02-05 12:01:35,201 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:01:35,202 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 12:01:35,202 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:01:35,202 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 12:01:35,202 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-02-05 12:01:35,202 INFO  L87              Difference]: Start difference. First operand 22725 states and 26033 transitions. Second operand  has 4 states, 4 states have (on average 58.0) internal successors, (232), 4 states have internal predecessors, (232), 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 12:01:38,811 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:01:38,812 INFO  L93              Difference]: Finished difference Result 64237 states and 73654 transitions.
[2025-02-05 12:01:38,812 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 12:01:38,812 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 58.0) internal successors, (232), 4 states have internal predecessors, (232), 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 313
[2025-02-05 12:01:38,813 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:01:38,855 INFO  L225             Difference]: With dead ends: 64237
[2025-02-05 12:01:38,855 INFO  L226             Difference]: Without dead ends: 38101
[2025-02-05 12:01:38,937 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-02-05 12:01:38,939 INFO  L435           NwaCegarLoop]: 250 mSDtfsCounter, 854 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 2908 mSolverCounterSat, 469 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 854 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 3377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 469 IncrementalHoareTripleChecker+Valid, 2908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time
[2025-02-05 12:01:38,939 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [854 Valid, 371 Invalid, 3377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [469 Valid, 2908 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time]
[2025-02-05 12:01:38,959 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 38101 states.
[2025-02-05 12:01:39,186 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 38101 to 37204.
[2025-02-05 12:01:39,218 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 37204 states, 37203 states have (on average 1.137462032631777) internal successors, (42317), 37203 states have internal predecessors, (42317), 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 12:01:39,260 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 37204 states to 37204 states and 42317 transitions.
[2025-02-05 12:01:39,261 INFO  L78                 Accepts]: Start accepts. Automaton has 37204 states and 42317 transitions. Word has length 313
[2025-02-05 12:01:39,262 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:01:39,262 INFO  L471      AbstractCegarLoop]: Abstraction has 37204 states and 42317 transitions.
[2025-02-05 12:01:39,262 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 58.0) internal successors, (232), 4 states have internal predecessors, (232), 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 12:01:39,262 INFO  L276                IsEmpty]: Start isEmpty. Operand 37204 states and 42317 transitions.
[2025-02-05 12:01:39,267 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 329
[2025-02-05 12:01:39,267 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:01:39,267 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:01:39,267 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-02-05 12:01:39,267 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:01:39,268 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:01:39,268 INFO  L85        PathProgramCache]: Analyzing trace with hash -306310242, now seen corresponding path program 1 times
[2025-02-05 12:01:39,268 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:01:39,268 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004072131]
[2025-02-05 12:01:39,268 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:01:39,268 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:01:39,293 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 328 statements into 1 equivalence classes.
[2025-02-05 12:01:39,313 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 328 of 328 statements.
[2025-02-05 12:01:39,313 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:01:39,313 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:01:39,543 INFO  L134       CoverageAnalysis]: Checked inductivity of 377 backedges. 326 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked.
[2025-02-05 12:01:39,543 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:01:39,543 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004072131]
[2025-02-05 12:01:39,543 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004072131] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 12:01:39,543 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 12:01:39,543 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 12:01:39,544 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049396106]
[2025-02-05 12:01:39,544 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:01:39,545 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 12:01:39,545 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:01:39,545 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 12:01:39,545 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 12:01:39,546 INFO  L87              Difference]: Start difference. First operand 37204 states and 42317 transitions. Second operand  has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 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 12:01:41,288 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:01:41,288 INFO  L93              Difference]: Finished difference Result 90182 states and 102746 transitions.
[2025-02-05 12:01:41,288 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 12:01:41,290 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 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 328
[2025-02-05 12:01:41,290 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:01:41,377 INFO  L225             Difference]: With dead ends: 90182
[2025-02-05 12:01:41,378 INFO  L226             Difference]: Without dead ends: 51278
[2025-02-05 12:01:41,433 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 12:01:41,434 INFO  L435           NwaCegarLoop]: 752 mSDtfsCounter, 363 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 1227 mSolverCounterSat, 250 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 824 SdHoareTripleChecker+Invalid, 1477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 250 IncrementalHoareTripleChecker+Valid, 1227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time
[2025-02-05 12:01:41,434 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 824 Invalid, 1477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [250 Valid, 1227 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time]
[2025-02-05 12:01:41,516 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 51278 states.
[2025-02-05 12:01:42,097 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 51278 to 49991.
[2025-02-05 12:01:42,127 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 49991 states, 49990 states have (on average 1.1124624924984996) internal successors, (55612), 49990 states have internal predecessors, (55612), 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 12:01:42,177 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 49991 states to 49991 states and 55612 transitions.
[2025-02-05 12:01:42,178 INFO  L78                 Accepts]: Start accepts. Automaton has 49991 states and 55612 transitions. Word has length 328
[2025-02-05 12:01:42,178 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:01:42,178 INFO  L471      AbstractCegarLoop]: Abstraction has 49991 states and 55612 transitions.
[2025-02-05 12:01:42,179 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 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 12:01:42,179 INFO  L276                IsEmpty]: Start isEmpty. Operand 49991 states and 55612 transitions.
[2025-02-05 12:01:42,183 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 352
[2025-02-05 12:01:42,184 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:01:42,184 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 12:01:42,184 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-02-05 12:01:42,184 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:01:42,185 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:01:42,185 INFO  L85        PathProgramCache]: Analyzing trace with hash 993636061, now seen corresponding path program 1 times
[2025-02-05 12:01:42,185 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:01:42,185 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855353944]
[2025-02-05 12:01:42,185 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:01:42,185 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:01:42,208 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 351 statements into 1 equivalence classes.
[2025-02-05 12:01:42,230 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 351 of 351 statements.
[2025-02-05 12:01:42,233 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:01:42,233 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:01:42,583 INFO  L134       CoverageAnalysis]: Checked inductivity of 626 backedges. 361 proven. 214 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked.
[2025-02-05 12:01:42,585 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:01:42,585 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855353944]
[2025-02-05 12:01:42,585 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855353944] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-05 12:01:42,585 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1418714296]
[2025-02-05 12:01:42,585 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:01:42,585 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 12:01:42,586 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 12:01:42,591 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 12:01:42,592 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 12:01:42,637 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 351 statements into 1 equivalence classes.
[2025-02-05 12:01:42,686 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 351 of 351 statements.
[2025-02-05 12:01:42,686 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:01:42,686 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:01:42,688 INFO  L256         TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 4 conjuncts are in the unsatisfiable core
[2025-02-05 12:01:42,695 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-05 12:01:42,860 INFO  L134       CoverageAnalysis]: Checked inductivity of 626 backedges. 381 proven. 73 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked.
[2025-02-05 12:01:42,860 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-02-05 12:01:43,265 INFO  L134       CoverageAnalysis]: Checked inductivity of 626 backedges. 454 proven. 0 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked.
[2025-02-05 12:01:43,265 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1418714296] provided 1 perfect and 1 imperfect interpolant sequences
[2025-02-05 12:01:43,265 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences.
[2025-02-05 12:01:43,265 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 3] total 6
[2025-02-05 12:01:43,265 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463036641]
[2025-02-05 12:01:43,265 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:01:43,266 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 12:01:43,266 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:01:43,266 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 12:01:43,266 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2025-02-05 12:01:43,267 INFO  L87              Difference]: Start difference. First operand 49991 states and 55612 transitions. Second operand  has 4 states, 4 states have (on average 58.0) internal successors, (232), 3 states have internal predecessors, (232), 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 12:01:46,217 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:01:46,217 INFO  L93              Difference]: Finished difference Result 118728 states and 132318 transitions.
[2025-02-05 12:01:46,218 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 12:01:46,218 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 58.0) internal successors, (232), 3 states have internal predecessors, (232), 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 351
[2025-02-05 12:01:46,218 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:01:46,295 INFO  L225             Difference]: With dead ends: 118728
[2025-02-05 12:01:46,295 INFO  L226             Difference]: Without dead ends: 68739
[2025-02-05 12:01:46,325 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 704 GetRequests, 699 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2025-02-05 12:01:46,326 INFO  L435           NwaCegarLoop]: 86 mSDtfsCounter, 860 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 2356 mSolverCounterSat, 559 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 860 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 2915 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 559 IncrementalHoareTripleChecker+Valid, 2356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time
[2025-02-05 12:01:46,326 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [860 Valid, 199 Invalid, 2915 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [559 Valid, 2356 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time]
[2025-02-05 12:01:46,440 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 68739 states.
[2025-02-05 12:01:46,925 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 68739 to 64908.
[2025-02-05 12:01:46,977 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 64908 states, 64907 states have (on average 1.1170597932426394) internal successors, (72505), 64907 states have internal predecessors, (72505), 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 12:01:47,181 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 64908 states to 64908 states and 72505 transitions.
[2025-02-05 12:01:47,183 INFO  L78                 Accepts]: Start accepts. Automaton has 64908 states and 72505 transitions. Word has length 351
[2025-02-05 12:01:47,183 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:01:47,183 INFO  L471      AbstractCegarLoop]: Abstraction has 64908 states and 72505 transitions.
[2025-02-05 12:01:47,183 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 58.0) internal successors, (232), 3 states have internal predecessors, (232), 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 12:01:47,183 INFO  L276                IsEmpty]: Start isEmpty. Operand 64908 states and 72505 transitions.
[2025-02-05 12:01:47,191 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 366
[2025-02-05 12:01:47,195 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:01:47,196 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 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 12:01:47,211 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 12:01:47,396 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 12:01:47,396 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:01:47,397 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:01:47,397 INFO  L85        PathProgramCache]: Analyzing trace with hash 253444783, now seen corresponding path program 1 times
[2025-02-05 12:01:47,397 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:01:47,397 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552212496]
[2025-02-05 12:01:47,397 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:01:47,397 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:01:47,469 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 365 statements into 1 equivalence classes.
[2025-02-05 12:01:47,496 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 365 of 365 statements.
[2025-02-05 12:01:47,496 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:01:47,497 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:01:47,901 INFO  L134       CoverageAnalysis]: Checked inductivity of 421 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked.
[2025-02-05 12:01:47,901 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:01:47,902 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552212496]
[2025-02-05 12:01:47,902 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552212496] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 12:01:47,902 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 12:01:47,902 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 12:01:47,902 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204730978]
[2025-02-05 12:01:47,902 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:01:47,903 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 12:01:47,907 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:01:47,908 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 12:01:47,908 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 12:01:47,908 INFO  L87              Difference]: Start difference. First operand 64908 states and 72505 transitions. Second operand  has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 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 12:01:50,279 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:01:50,279 INFO  L93              Difference]: Finished difference Result 142175 states and 159014 transitions.
[2025-02-05 12:01:50,279 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 12:01:50,280 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 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 365
[2025-02-05 12:01:50,280 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:01:50,405 INFO  L225             Difference]: With dead ends: 142175
[2025-02-05 12:01:50,405 INFO  L226             Difference]: Without dead ends: 76833
[2025-02-05 12:01:50,462 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 12:01:50,463 INFO  L435           NwaCegarLoop]: 252 mSDtfsCounter, 470 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 1269 mSolverCounterSat, 279 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 470 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 1548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 279 IncrementalHoareTripleChecker+Valid, 1269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time
[2025-02-05 12:01:50,463 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [470 Valid, 301 Invalid, 1548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [279 Valid, 1269 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time]
[2025-02-05 12:01:50,532 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 76833 states.
[2025-02-05 12:01:51,375 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 76833 to 73419.
[2025-02-05 12:01:51,434 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 73419 states, 73418 states have (on average 1.1121250919393064) internal successors, (81650), 73418 states have internal predecessors, (81650), 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 12:01:51,542 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 73419 states to 73419 states and 81650 transitions.
[2025-02-05 12:01:51,543 INFO  L78                 Accepts]: Start accepts. Automaton has 73419 states and 81650 transitions. Word has length 365
[2025-02-05 12:01:51,543 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:01:51,543 INFO  L471      AbstractCegarLoop]: Abstraction has 73419 states and 81650 transitions.
[2025-02-05 12:01:51,544 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 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 12:01:51,544 INFO  L276                IsEmpty]: Start isEmpty. Operand 73419 states and 81650 transitions.
[2025-02-05 12:01:51,549 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 382
[2025-02-05 12:01:51,549 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:01:51,549 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 12:01:51,550 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2025-02-05 12:01:51,550 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:01:51,550 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:01:51,550 INFO  L85        PathProgramCache]: Analyzing trace with hash 409348945, now seen corresponding path program 1 times
[2025-02-05 12:01:51,550 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:01:51,550 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590521435]
[2025-02-05 12:01:51,550 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:01:51,551 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:01:51,585 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 381 statements into 1 equivalence classes.
[2025-02-05 12:01:51,604 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 381 of 381 statements.
[2025-02-05 12:01:51,604 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:01:51,604 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:01:51,857 INFO  L134       CoverageAnalysis]: Checked inductivity of 631 backedges. 414 proven. 0 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked.
[2025-02-05 12:01:51,857 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:01:51,857 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590521435]
[2025-02-05 12:01:51,857 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590521435] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 12:01:51,857 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 12:01:51,857 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 12:01:51,857 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182191230]
[2025-02-05 12:01:51,857 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:01:51,858 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 12:01:51,858 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:01:51,858 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 12:01:51,858 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 12:01:51,859 INFO  L87              Difference]: Start difference. First operand 73419 states and 81650 transitions. Second operand  has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 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 12:01:53,772 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:01:53,773 INFO  L93              Difference]: Finished difference Result 163003 states and 181528 transitions.
[2025-02-05 12:01:53,773 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 12:01:53,773 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 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 381
[2025-02-05 12:01:53,774 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:01:53,872 INFO  L225             Difference]: With dead ends: 163003
[2025-02-05 12:01:53,872 INFO  L226             Difference]: Without dead ends: 88309
[2025-02-05 12:01:53,925 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 12:01:53,926 INFO  L435           NwaCegarLoop]: 762 mSDtfsCounter, 388 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 1182 mSolverCounterSat, 259 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 388 SdHoareTripleChecker+Valid, 819 SdHoareTripleChecker+Invalid, 1441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 259 IncrementalHoareTripleChecker+Valid, 1182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time
[2025-02-05 12:01:53,926 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [388 Valid, 819 Invalid, 1441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [259 Valid, 1182 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time]
[2025-02-05 12:01:53,990 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 88309 states.
[2025-02-05 12:01:54,905 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 88309 to 72958.
[2025-02-05 12:01:54,956 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 72958 states, 72957 states have (on average 1.110955768466357) internal successors, (81052), 72957 states have internal predecessors, (81052), 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 12:01:55,062 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 72958 states to 72958 states and 81052 transitions.
[2025-02-05 12:01:55,063 INFO  L78                 Accepts]: Start accepts. Automaton has 72958 states and 81052 transitions. Word has length 381
[2025-02-05 12:01:55,064 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:01:55,065 INFO  L471      AbstractCegarLoop]: Abstraction has 72958 states and 81052 transitions.
[2025-02-05 12:01:55,065 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 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 12:01:55,065 INFO  L276                IsEmpty]: Start isEmpty. Operand 72958 states and 81052 transitions.
[2025-02-05 12:01:55,071 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 400
[2025-02-05 12:01:55,072 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:01:55,072 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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 12:01:55,072 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2025-02-05 12:01:55,072 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:01:55,073 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:01:55,073 INFO  L85        PathProgramCache]: Analyzing trace with hash -1481909436, now seen corresponding path program 1 times
[2025-02-05 12:01:55,073 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:01:55,074 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934581099]
[2025-02-05 12:01:55,074 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:01:55,074 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:01:55,110 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 399 statements into 1 equivalence classes.
[2025-02-05 12:01:55,135 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 399 of 399 statements.
[2025-02-05 12:01:55,135 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:01:55,135 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:01:55,352 INFO  L134       CoverageAnalysis]: Checked inductivity of 693 backedges. 561 proven. 0 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked.
[2025-02-05 12:01:55,352 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:01:55,352 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934581099]
[2025-02-05 12:01:55,352 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934581099] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 12:01:55,352 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 12:01:55,353 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 12:01:55,353 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212832692]
[2025-02-05 12:01:55,353 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:01:55,353 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 12:01:55,353 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:01:55,353 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 12:01:55,354 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 12:01:55,354 INFO  L87              Difference]: Start difference. First operand 72958 states and 81052 transitions. Second operand  has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 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 12:01:57,350 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:01:57,351 INFO  L93              Difference]: Finished difference Result 166355 states and 185074 transitions.
[2025-02-05 12:01:57,352 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 12:01:57,352 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 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 399
[2025-02-05 12:01:57,353 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:01:57,457 INFO  L225             Difference]: With dead ends: 166355
[2025-02-05 12:01:57,458 INFO  L226             Difference]: Without dead ends: 92969
[2025-02-05 12:01:57,503 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 12:01:57,503 INFO  L435           NwaCegarLoop]: 307 mSDtfsCounter, 409 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 1253 mSolverCounterSat, 204 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 1457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 204 IncrementalHoareTripleChecker+Valid, 1253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time
[2025-02-05 12:01:57,504 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [409 Valid, 362 Invalid, 1457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [204 Valid, 1253 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time]
[2025-02-05 12:01:57,568 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 92969 states.
[2025-02-05 12:01:58,550 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 92969 to 88271.
[2025-02-05 12:01:58,606 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 88271 states, 88270 states have (on average 1.1049280616290926) internal successors, (97532), 88270 states have internal predecessors, (97532), 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 12:01:58,694 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 88271 states to 88271 states and 97532 transitions.
[2025-02-05 12:01:58,695 INFO  L78                 Accepts]: Start accepts. Automaton has 88271 states and 97532 transitions. Word has length 399
[2025-02-05 12:01:58,695 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:01:58,695 INFO  L471      AbstractCegarLoop]: Abstraction has 88271 states and 97532 transitions.
[2025-02-05 12:01:58,695 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 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 12:01:58,695 INFO  L276                IsEmpty]: Start isEmpty. Operand 88271 states and 97532 transitions.
[2025-02-05 12:01:58,700 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 404
[2025-02-05 12:01:58,700 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:01:58,700 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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]
[2025-02-05 12:01:58,700 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2025-02-05 12:01:58,701 INFO  L396      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:01:58,701 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:01:58,701 INFO  L85        PathProgramCache]: Analyzing trace with hash 2036501454, now seen corresponding path program 1 times
[2025-02-05 12:01:58,701 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:01:58,701 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155338002]
[2025-02-05 12:01:58,701 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:01:58,701 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:01:58,730 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 403 statements into 1 equivalence classes.
[2025-02-05 12:01:58,745 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 403 of 403 statements.
[2025-02-05 12:01:58,745 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:01:58,745 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:01:58,817 INFO  L134       CoverageAnalysis]: Checked inductivity of 664 backedges. 447 proven. 0 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked.
[2025-02-05 12:01:58,818 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:01:58,818 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155338002]
[2025-02-05 12:01:58,818 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155338002] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 12:01:58,818 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 12:01:58,818 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 12:01:58,818 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110131903]
[2025-02-05 12:01:58,818 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:01:58,818 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 12:01:58,818 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:01:58,819 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 12:01:58,819 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 12:01:58,819 INFO  L87              Difference]: Start difference. First operand 88271 states and 97532 transitions. Second operand  has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 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 12:02:00,611 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:02:00,612 INFO  L93              Difference]: Finished difference Result 185045 states and 204010 transitions.
[2025-02-05 12:02:00,612 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 12:02:00,612 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 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 403
[2025-02-05 12:02:00,613 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:02:00,737 INFO  L225             Difference]: With dead ends: 185045
[2025-02-05 12:02:00,737 INFO  L226             Difference]: Without dead ends: 96775
[2025-02-05 12:02:00,790 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 12:02:00,792 INFO  L435           NwaCegarLoop]: 270 mSDtfsCounter, 388 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 1180 mSolverCounterSat, 199 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 388 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 1379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 199 IncrementalHoareTripleChecker+Valid, 1180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time
[2025-02-05 12:02:00,793 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [388 Valid, 315 Invalid, 1379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [199 Valid, 1180 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time]
[2025-02-05 12:02:00,881 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 96775 states.
[2025-02-05 12:02:01,870 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 96775 to 91669.
[2025-02-05 12:02:01,922 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 91669 states, 91668 states have (on average 1.1009076231618449) internal successors, (100918), 91668 states have internal predecessors, (100918), 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 12:02:02,008 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 91669 states to 91669 states and 100918 transitions.
[2025-02-05 12:02:02,009 INFO  L78                 Accepts]: Start accepts. Automaton has 91669 states and 100918 transitions. Word has length 403
[2025-02-05 12:02:02,009 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:02:02,010 INFO  L471      AbstractCegarLoop]: Abstraction has 91669 states and 100918 transitions.
[2025-02-05 12:02:02,010 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 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 12:02:02,010 INFO  L276                IsEmpty]: Start isEmpty. Operand 91669 states and 100918 transitions.
[2025-02-05 12:02:02,015 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 434
[2025-02-05 12:02:02,015 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:02:02,015 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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]
[2025-02-05 12:02:02,015 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2025-02-05 12:02:02,015 INFO  L396      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:02:02,018 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:02:02,018 INFO  L85        PathProgramCache]: Analyzing trace with hash -324727151, now seen corresponding path program 1 times
[2025-02-05 12:02:02,018 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:02:02,018 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318482560]
[2025-02-05 12:02:02,018 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:02:02,019 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:02:02,048 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 433 statements into 1 equivalence classes.
[2025-02-05 12:02:02,065 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 433 of 433 statements.
[2025-02-05 12:02:02,065 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:02:02,065 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:02:02,603 INFO  L134       CoverageAnalysis]: Checked inductivity of 687 backedges. 367 proven. 51 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked.
[2025-02-05 12:02:02,603 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:02:02,603 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318482560]
[2025-02-05 12:02:02,603 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318482560] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-05 12:02:02,603 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1436503300]
[2025-02-05 12:02:02,603 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:02:02,603 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 12:02:02,603 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 12:02:02,605 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-02-05 12:02:02,607 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2025-02-05 12:02:02,653 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 433 statements into 1 equivalence classes.
[2025-02-05 12:02:02,714 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 433 of 433 statements.
[2025-02-05 12:02:02,714 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:02:02,714 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:02:02,716 INFO  L256         TraceCheckSpWp]: Trace formula consists of 579 conjuncts, 5 conjuncts are in the unsatisfiable core
[2025-02-05 12:02:02,719 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-05 12:02:03,108 INFO  L134       CoverageAnalysis]: Checked inductivity of 687 backedges. 431 proven. 82 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked.
[2025-02-05 12:02:03,108 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-02-05 12:02:03,841 INFO  L134       CoverageAnalysis]: Checked inductivity of 687 backedges. 431 proven. 82 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked.
[2025-02-05 12:02:03,841 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1436503300] provided 0 perfect and 2 imperfect interpolant sequences
[2025-02-05 12:02:03,842 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-02-05 12:02:03,842 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 9
[2025-02-05 12:02:03,842 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339028294]
[2025-02-05 12:02:03,842 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-02-05 12:02:03,843 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2025-02-05 12:02:03,843 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:02:03,844 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2025-02-05 12:02:03,844 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72
[2025-02-05 12:02:03,844 INFO  L87              Difference]: Start difference. First operand 91669 states and 100918 transitions. Second operand  has 9 states, 9 states have (on average 83.11111111111111) internal successors, (748), 9 states have internal predecessors, (748), 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 12:02:12,655 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:02:12,655 INFO  L93              Difference]: Finished difference Result 237420 states and 260035 transitions.
[2025-02-05 12:02:12,656 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. 
[2025-02-05 12:02:12,656 INFO  L78                 Accepts]: Start accepts. Automaton has  has 9 states, 9 states have (on average 83.11111111111111) internal successors, (748), 9 states have internal predecessors, (748), 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 433
[2025-02-05 12:02:12,656 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:02:12,845 INFO  L225             Difference]: With dead ends: 237420
[2025-02-05 12:02:12,845 INFO  L226             Difference]: Without dead ends: 139369
[2025-02-05 12:02:12,886 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 886 GetRequests, 870 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=206, Unknown=0, NotChecked=0, Total=306
[2025-02-05 12:02:12,887 INFO  L435           NwaCegarLoop]: 75 mSDtfsCounter, 9066 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 7665 mSolverCounterSat, 2920 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9066 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 10585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2920 IncrementalHoareTripleChecker+Valid, 7665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.7s IncrementalHoareTripleChecker+Time
[2025-02-05 12:02:12,887 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [9066 Valid, 306 Invalid, 10585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2920 Valid, 7665 Invalid, 0 Unknown, 0 Unchecked, 7.7s Time]
[2025-02-05 12:02:12,989 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 139369 states.
[2025-02-05 12:02:14,273 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 139369 to 116301.
[2025-02-05 12:02:14,365 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 116301 states, 116300 states have (on average 1.0760705073086845) internal successors, (125147), 116300 states have internal predecessors, (125147), 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 12:02:14,516 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 116301 states to 116301 states and 125147 transitions.
[2025-02-05 12:02:14,518 INFO  L78                 Accepts]: Start accepts. Automaton has 116301 states and 125147 transitions. Word has length 433
[2025-02-05 12:02:14,519 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:02:14,519 INFO  L471      AbstractCegarLoop]: Abstraction has 116301 states and 125147 transitions.
[2025-02-05 12:02:14,519 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 83.11111111111111) internal successors, (748), 9 states have internal predecessors, (748), 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 12:02:14,519 INFO  L276                IsEmpty]: Start isEmpty. Operand 116301 states and 125147 transitions.
[2025-02-05 12:02:14,529 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 499
[2025-02-05 12:02:14,529 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:02:14,530 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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]
[2025-02-05 12:02:14,537 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2025-02-05 12:02:14,730 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 12:02:14,730 INFO  L396      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:02:14,731 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:02:14,732 INFO  L85        PathProgramCache]: Analyzing trace with hash -625443690, now seen corresponding path program 1 times
[2025-02-05 12:02:14,732 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:02:14,733 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324736413]
[2025-02-05 12:02:14,733 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:02:14,733 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:02:14,770 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 498 statements into 1 equivalence classes.
[2025-02-05 12:02:14,795 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 498 of 498 statements.
[2025-02-05 12:02:14,796 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:02:14,796 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:02:14,963 INFO  L134       CoverageAnalysis]: Checked inductivity of 755 backedges. 473 proven. 0 refuted. 0 times theorem prover too weak. 282 trivial. 0 not checked.
[2025-02-05 12:02:14,964 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:02:14,964 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324736413]
[2025-02-05 12:02:14,964 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324736413] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 12:02:14,964 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 12:02:14,964 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 12:02:14,965 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187902326]
[2025-02-05 12:02:14,965 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:02:14,965 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 12:02:14,965 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:02:14,966 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 12:02:14,966 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 12:02:14,966 INFO  L87              Difference]: Start difference. First operand 116301 states and 125147 transitions. Second operand  has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 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 12:02:17,089 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:02:17,089 INFO  L93              Difference]: Finished difference Result 235578 states and 253447 transitions.
[2025-02-05 12:02:17,090 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 12:02:17,090 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 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 498
[2025-02-05 12:02:17,090 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:02:17,612 INFO  L225             Difference]: With dead ends: 235578
[2025-02-05 12:02:17,612 INFO  L226             Difference]: Without dead ends: 119279
[2025-02-05 12:02:17,644 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 12:02:17,645 INFO  L435           NwaCegarLoop]: 279 mSDtfsCounter, 366 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 1189 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 1390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 1189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time
[2025-02-05 12:02:17,645 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 325 Invalid, 1390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 1189 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time]
[2025-02-05 12:02:17,720 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 119279 states.
[2025-02-05 12:02:19,162 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 119279 to 108205.
[2025-02-05 12:02:19,239 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 108205 states, 108204 states have (on average 1.0754593175853018) internal successors, (116369), 108204 states have internal predecessors, (116369), 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 12:02:19,343 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 108205 states to 108205 states and 116369 transitions.
[2025-02-05 12:02:19,345 INFO  L78                 Accepts]: Start accepts. Automaton has 108205 states and 116369 transitions. Word has length 498
[2025-02-05 12:02:19,345 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:02:19,345 INFO  L471      AbstractCegarLoop]: Abstraction has 108205 states and 116369 transitions.
[2025-02-05 12:02:19,346 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 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 12:02:19,346 INFO  L276                IsEmpty]: Start isEmpty. Operand 108205 states and 116369 transitions.
[2025-02-05 12:02:19,353 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 512
[2025-02-05 12:02:19,353 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:02:19,354 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:02:19,354 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2025-02-05 12:02:19,354 INFO  L396      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:02:19,355 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:02:19,355 INFO  L85        PathProgramCache]: Analyzing trace with hash -315622745, now seen corresponding path program 1 times
[2025-02-05 12:02:19,355 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:02:19,355 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470498203]
[2025-02-05 12:02:19,355 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:02:19,355 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:02:19,391 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 511 statements into 1 equivalence classes.
[2025-02-05 12:02:19,418 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 511 of 511 statements.
[2025-02-05 12:02:19,419 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:02:19,419 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:02:19,931 INFO  L134       CoverageAnalysis]: Checked inductivity of 397 backedges. 265 proven. 51 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked.
[2025-02-05 12:02:19,931 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:02:19,931 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470498203]
[2025-02-05 12:02:19,931 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470498203] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-05 12:02:19,931 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1482464842]
[2025-02-05 12:02:19,932 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:02:19,932 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 12:02:19,932 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 12:02:19,935 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-02-05 12:02:19,936 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2025-02-05 12:02:19,991 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 511 statements into 1 equivalence classes.
[2025-02-05 12:02:20,077 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 511 of 511 statements.
[2025-02-05 12:02:20,077 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:02:20,077 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:02:20,080 INFO  L256         TraceCheckSpWp]: Trace formula consists of 641 conjuncts, 3 conjuncts are in the unsatisfiable core
[2025-02-05 12:02:20,084 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-05 12:02:20,399 INFO  L134       CoverageAnalysis]: Checked inductivity of 397 backedges. 265 proven. 51 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked.
[2025-02-05 12:02:20,399 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-02-05 12:02:21,948 INFO  L134       CoverageAnalysis]: Checked inductivity of 397 backedges. 265 proven. 51 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked.
[2025-02-05 12:02:21,949 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1482464842] provided 0 perfect and 2 imperfect interpolant sequences
[2025-02-05 12:02:21,949 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-02-05 12:02:21,949 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8
[2025-02-05 12:02:21,949 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078367237]
[2025-02-05 12:02:21,949 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-02-05 12:02:21,950 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-02-05 12:02:21,950 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:02:21,951 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-02-05 12:02:21,951 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56
[2025-02-05 12:02:21,952 INFO  L87              Difference]: Start difference. First operand 108205 states and 116369 transitions. Second operand  has 8 states, 8 states have (on average 140.125) internal successors, (1121), 8 states have internal predecessors, (1121), 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)