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


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


Checking for ERROR reachability
Using default analysis
Version 798a7b37
Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem03_label20.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 1405ce2683e9fc1142823331bc73f3fedb50a2caefebf44893a593622c3225ed
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-798a7b3-m
[2025-03-03 09:50:45,254 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-03-03 09:50:45,304 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2025-03-03 09:50:45,308 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-03-03 09:50:45,308 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-03-03 09:50:45,324 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-03-03 09:50:45,325 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-03-03 09:50:45,325 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-03-03 09:50:45,325 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-03-03 09:50:45,325 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-03-03 09:50:45,325 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-03-03 09:50:45,325 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-03-03 09:50:45,325 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-03-03 09:50:45,325 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-03-03 09:50:45,325 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-03-03 09:50:45,326 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-03-03 09:50:45,326 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-03-03 09:50:45,326 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-03-03 09:50:45,326 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-03-03 09:50:45,326 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-03-03 09:50:45,326 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-03-03 09:50:45,326 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-03-03 09:50:45,326 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-03-03 09:50:45,326 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-03-03 09:50:45,326 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-03-03 09:50:45,326 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-03-03 09:50:45,326 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-03-03 09:50:45,326 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-03-03 09:50:45,326 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-03-03 09:50:45,326 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-03-03 09:50:45,326 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-03-03 09:50:45,326 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-03-03 09:50:45,326 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-03 09:50:45,326 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-03-03 09:50:45,327 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-03-03 09:50:45,327 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-03-03 09:50:45,327 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-03-03 09:50:45,327 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-03-03 09:50:45,327 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-03-03 09:50:45,327 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-03-03 09:50:45,327 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-03-03 09:50:45,327 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-03-03 09:50:45,327 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-03-03 09:50:45,327 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/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 -> 1405ce2683e9fc1142823331bc73f3fedb50a2caefebf44893a593622c3225ed
[2025-03-03 09:50:45,528 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-03-03 09:50:45,535 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-03-03 09:50:45,536 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-03-03 09:50:45,537 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-03-03 09:50:45,537 INFO  L274        PluginConnector]: CDTParser initialized
[2025-03-03 09:50:45,538 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem03_label20.c
[2025-03-03 09:50:46,629 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/538b9e504/6c8dc00395f74fb5a9f3ed0f2ed3e74a/FLAGeb705a480
[2025-03-03 09:50:46,976 INFO  L384              CDTParser]: Found 1 translation units.
[2025-03-03 09:50:46,977 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label20.c
[2025-03-03 09:50:46,991 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/538b9e504/6c8dc00395f74fb5a9f3ed0f2ed3e74a/FLAGeb705a480
[2025-03-03 09:50:47,189 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/538b9e504/6c8dc00395f74fb5a9f3ed0f2ed3e74a
[2025-03-03 09:50:47,191 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-03-03 09:50:47,192 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-03-03 09:50:47,193 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-03-03 09:50:47,193 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-03-03 09:50:47,196 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-03-03 09:50:47,196 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:50:47" (1/1) ...
[2025-03-03 09:50:47,197 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e61c32e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:50:47, skipping insertion in model container
[2025-03-03 09:50:47,197 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:50:47" (1/1) ...
[2025-03-03 09:50:47,238 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-03-03 09:50:47,599 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label20.c[60555,60568]
[2025-03-03 09:50:47,626 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-03 09:50:47,635 INFO  L200         MainTranslator]: Completed pre-run
[2025-03-03 09:50:47,783 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label20.c[60555,60568]
[2025-03-03 09:50:47,791 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-03 09:50:47,802 INFO  L204         MainTranslator]: Completed translation
[2025-03-03 09:50:47,803 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:50:47 WrapperNode
[2025-03-03 09:50:47,804 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-03-03 09:50:47,805 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-03-03 09:50:47,805 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-03-03 09:50:47,805 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-03-03 09:50:47,810 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:50:47" (1/1) ...
[2025-03-03 09:50:47,830 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:50:47" (1/1) ...
[2025-03-03 09:50:47,917 INFO  L138                Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1769
[2025-03-03 09:50:47,918 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-03-03 09:50:47,918 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-03-03 09:50:47,918 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-03-03 09:50:47,919 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-03-03 09:50:47,925 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:50:47" (1/1) ...
[2025-03-03 09:50:47,925 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:50:47" (1/1) ...
[2025-03-03 09:50:47,938 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:50:47" (1/1) ...
[2025-03-03 09:50:47,980 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-03-03 09:50:47,981 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:50:47" (1/1) ...
[2025-03-03 09:50:47,981 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:50:47" (1/1) ...
[2025-03-03 09:50:48,021 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:50:47" (1/1) ...
[2025-03-03 09:50:48,028 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:50:47" (1/1) ...
[2025-03-03 09:50:48,037 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:50:47" (1/1) ...
[2025-03-03 09:50:48,043 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:50:47" (1/1) ...
[2025-03-03 09:50:48,053 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-03-03 09:50:48,054 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-03-03 09:50:48,054 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-03-03 09:50:48,055 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-03-03 09:50:48,055 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:50:47" (1/1) ...
[2025-03-03 09:50:48,060 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-03 09:50:48,068 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 09:50:48,081 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2025-03-03 09:50:48,084 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2025-03-03 09:50:48,102 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-03-03 09:50:48,102 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-03-03 09:50:48,102 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-03-03 09:50:48,102 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-03-03 09:50:48,171 INFO  L256             CfgBuilder]: Building ICFG
[2025-03-03 09:50:48,172 INFO  L286             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-03-03 09:50:49,613 INFO  L?                        ?]: Removed 147 outVars from TransFormulas that were not future-live.
[2025-03-03 09:50:49,613 INFO  L307             CfgBuilder]: Performing block encoding
[2025-03-03 09:50:49,629 INFO  L331             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-03-03 09:50:49,629 INFO  L336             CfgBuilder]: Removed 0 assume(true) statements.
[2025-03-03 09:50:49,629 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:50:49 BoogieIcfgContainer
[2025-03-03 09:50:49,629 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-03-03 09:50:49,633 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-03-03 09:50:49,633 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-03-03 09:50:49,636 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-03-03 09:50:49,637 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:50:47" (1/3) ...
[2025-03-03 09:50:49,637 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@362fa988 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:50:49, skipping insertion in model container
[2025-03-03 09:50:49,637 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:50:47" (2/3) ...
[2025-03-03 09:50:49,637 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@362fa988 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:50:49, skipping insertion in model container
[2025-03-03 09:50:49,638 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:50:49" (3/3) ...
[2025-03-03 09:50:49,639 INFO  L128   eAbstractionObserver]: Analyzing ICFG Problem03_label20.c
[2025-03-03 09:50:49,650 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-03-03 09:50:49,653 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG Problem03_label20.c that has 1 procedures, 302 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-03-03 09:50:49,710 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-03-03 09:50:49,721 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;@523a61b6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-03-03 09:50:49,722 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-03-03 09:50:49,727 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 302 states, 300 states have (on average 1.7266666666666666) internal successors, (518), 301 states have internal predecessors, (518), 0 states have call successors, (0), 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-03-03 09:50:49,741 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 196
[2025-03-03 09:50:49,742 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:50:49,743 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 09:50:49,744 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:50:49,747 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:50:49,748 INFO  L85        PathProgramCache]: Analyzing trace with hash 1148847452, now seen corresponding path program 1 times
[2025-03-03 09:50:49,754 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:50:49,756 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943988146]
[2025-03-03 09:50:49,756 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:50:49,757 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:50:49,874 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes.
[2025-03-03 09:50:49,987 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements.
[2025-03-03 09:50:49,987 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:50:49,987 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:50:50,507 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 09:50:50,507 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:50:50,507 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943988146]
[2025-03-03 09:50:50,508 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943988146] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:50:50,508 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 09:50:50,509 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-03 09:50:50,510 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333928139]
[2025-03-03 09:50:50,510 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:50:50,514 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 09:50:50,514 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:50:50,531 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 09:50:50,531 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:50:50,534 INFO  L87              Difference]: Start difference. First operand  has 302 states, 300 states have (on average 1.7266666666666666) internal successors, (518), 301 states have internal predecessors, (518), 0 states have call successors, (0), 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 65.0) internal successors, (195), 2 states have internal predecessors, (195), 0 states have call successors, (0), 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-03-03 09:50:51,406 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:50:51,407 INFO  L93              Difference]: Finished difference Result 857 states and 1495 transitions.
[2025-03-03 09:50:51,407 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 09:50:51,408 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 65.0) internal successors, (195), 2 states have internal predecessors, (195), 0 states have call successors, (0), 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 195
[2025-03-03 09:50:51,409 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:50:51,415 INFO  L225             Difference]: With dead ends: 857
[2025-03-03 09:50:51,416 INFO  L226             Difference]: Without dead ends: 462
[2025-03-03 09:50:51,420 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-03-03 09:50:51,421 INFO  L435           NwaCegarLoop]: 149 mSDtfsCounter, 93 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 690 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time
[2025-03-03 09:50:51,422 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 187 Invalid, 826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 690 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2025-03-03 09:50:51,439 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 462 states.
[2025-03-03 09:50:51,460 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 460.
[2025-03-03 09:50:51,461 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 460 states, 459 states have (on average 1.5381263616557734) internal successors, (706), 459 states have internal predecessors, (706), 0 states have call successors, (0), 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-03-03 09:50:51,466 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 706 transitions.
[2025-03-03 09:50:51,467 INFO  L78                 Accepts]: Start accepts. Automaton has 460 states and 706 transitions. Word has length 195
[2025-03-03 09:50:51,468 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:50:51,468 INFO  L471      AbstractCegarLoop]: Abstraction has 460 states and 706 transitions.
[2025-03-03 09:50:51,468 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 65.0) internal successors, (195), 2 states have internal predecessors, (195), 0 states have call successors, (0), 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-03-03 09:50:51,468 INFO  L276                IsEmpty]: Start isEmpty. Operand 460 states and 706 transitions.
[2025-03-03 09:50:51,471 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 204
[2025-03-03 09:50:51,471 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:50:51,471 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 09:50:51,471 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2025-03-03 09:50:51,471 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:50:51,472 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:50:51,472 INFO  L85        PathProgramCache]: Analyzing trace with hash -1083778490, now seen corresponding path program 1 times
[2025-03-03 09:50:51,472 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:50:51,472 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663918243]
[2025-03-03 09:50:51,472 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:50:51,472 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:50:51,507 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes.
[2025-03-03 09:50:51,520 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements.
[2025-03-03 09:50:51,521 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:50:51,521 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:50:51,660 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 09:50:51,660 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:50:51,660 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663918243]
[2025-03-03 09:50:51,661 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663918243] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:50:51,661 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 09:50:51,661 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-03 09:50:51,661 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940834107]
[2025-03-03 09:50:51,661 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:50:51,663 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 09:50:51,663 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:50:51,663 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 09:50:51,663 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:50:51,664 INFO  L87              Difference]: Start difference. First operand 460 states and 706 transitions. Second operand  has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 2 states have internal predecessors, (203), 0 states have call successors, (0), 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-03-03 09:50:52,324 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:50:52,325 INFO  L93              Difference]: Finished difference Result 1344 states and 2079 transitions.
[2025-03-03 09:50:52,325 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 09:50:52,325 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 2 states have internal predecessors, (203), 0 states have call successors, (0), 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 203
[2025-03-03 09:50:52,325 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:50:52,328 INFO  L225             Difference]: With dead ends: 1344
[2025-03-03 09:50:52,328 INFO  L226             Difference]: Without dead ends: 886
[2025-03-03 09:50:52,329 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-03-03 09:50:52,330 INFO  L435           NwaCegarLoop]: 77 mSDtfsCounter, 249 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-03 09:50:52,330 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 91 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-03 09:50:52,331 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 886 states.
[2025-03-03 09:50:52,351 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 870.
[2025-03-03 09:50:52,352 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 870 states, 869 states have (on average 1.5132336018411967) internal successors, (1315), 869 states have internal predecessors, (1315), 0 states have call successors, (0), 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-03-03 09:50:52,355 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 870 states and 1315 transitions.
[2025-03-03 09:50:52,355 INFO  L78                 Accepts]: Start accepts. Automaton has 870 states and 1315 transitions. Word has length 203
[2025-03-03 09:50:52,355 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:50:52,355 INFO  L471      AbstractCegarLoop]: Abstraction has 870 states and 1315 transitions.
[2025-03-03 09:50:52,355 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 2 states have internal predecessors, (203), 0 states have call successors, (0), 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-03-03 09:50:52,355 INFO  L276                IsEmpty]: Start isEmpty. Operand 870 states and 1315 transitions.
[2025-03-03 09:50:52,358 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 211
[2025-03-03 09:50:52,358 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:50:52,358 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 09:50:52,358 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-03-03 09:50:52,358 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:50:52,358 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:50:52,359 INFO  L85        PathProgramCache]: Analyzing trace with hash -1513111711, now seen corresponding path program 1 times
[2025-03-03 09:50:52,359 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:50:52,359 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245510768]
[2025-03-03 09:50:52,359 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:50:52,359 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:50:52,392 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes.
[2025-03-03 09:50:52,413 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements.
[2025-03-03 09:50:52,413 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:50:52,413 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:50:52,961 INFO  L134       CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2025-03-03 09:50:52,963 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:50:52,963 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245510768]
[2025-03-03 09:50:52,964 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245510768] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:50:52,964 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 09:50:52,964 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 09:50:52,964 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055018099]
[2025-03-03 09:50:52,964 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:50:52,964 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-03 09:50:52,964 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:50:52,965 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-03 09:50:52,966 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-03 09:50:52,966 INFO  L87              Difference]: Start difference. First operand 870 states and 1315 transitions. Second operand  has 4 states, 4 states have (on average 51.25) internal successors, (205), 3 states have internal predecessors, (205), 0 states have call successors, (0), 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-03-03 09:50:53,736 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:50:53,737 INFO  L93              Difference]: Finished difference Result 1884 states and 2886 transitions.
[2025-03-03 09:50:53,737 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 09:50:53,737 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 51.25) internal successors, (205), 3 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 210
[2025-03-03 09:50:53,738 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:50:53,740 INFO  L225             Difference]: With dead ends: 1884
[2025-03-03 09:50:53,740 INFO  L226             Difference]: Without dead ends: 842
[2025-03-03 09:50:53,742 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-03-03 09:50:53,742 INFO  L435           NwaCegarLoop]: 32 mSDtfsCounter, 299 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 802 mSolverCounterSat, 177 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 979 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 177 IncrementalHoareTripleChecker+Valid, 802 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-03-03 09:50:53,743 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 47 Invalid, 979 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [177 Valid, 802 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-03-03 09:50:53,743 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 842 states.
[2025-03-03 09:50:53,757 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 842.
[2025-03-03 09:50:53,758 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 842 states, 841 states have (on average 1.3650416171224733) internal successors, (1148), 841 states have internal predecessors, (1148), 0 states have call successors, (0), 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-03-03 09:50:53,760 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 842 states to 842 states and 1148 transitions.
[2025-03-03 09:50:53,761 INFO  L78                 Accepts]: Start accepts. Automaton has 842 states and 1148 transitions. Word has length 210
[2025-03-03 09:50:53,761 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:50:53,761 INFO  L471      AbstractCegarLoop]: Abstraction has 842 states and 1148 transitions.
[2025-03-03 09:50:53,761 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 51.25) internal successors, (205), 3 states have internal predecessors, (205), 0 states have call successors, (0), 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-03-03 09:50:53,761 INFO  L276                IsEmpty]: Start isEmpty. Operand 842 states and 1148 transitions.
[2025-03-03 09:50:53,763 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 219
[2025-03-03 09:50:53,763 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:50:53,763 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 09:50:53,764 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-03-03 09:50:53,764 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:50:53,764 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:50:53,764 INFO  L85        PathProgramCache]: Analyzing trace with hash 981983073, now seen corresponding path program 1 times
[2025-03-03 09:50:53,764 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:50:53,765 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471782832]
[2025-03-03 09:50:53,765 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:50:53,765 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:50:53,792 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes.
[2025-03-03 09:50:53,798 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements.
[2025-03-03 09:50:53,798 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:50:53,798 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:50:53,912 INFO  L134       CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 09:50:53,912 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:50:53,912 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471782832]
[2025-03-03 09:50:53,912 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471782832] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:50:53,912 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 09:50:53,913 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-03 09:50:53,913 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022318499]
[2025-03-03 09:50:53,913 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:50:53,913 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 09:50:53,913 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:50:53,914 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 09:50:53,914 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:50:53,914 INFO  L87              Difference]: Start difference. First operand 842 states and 1148 transitions. Second operand  has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 2 states have internal predecessors, (218), 0 states have call successors, (0), 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-03-03 09:50:54,443 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:50:54,444 INFO  L93              Difference]: Finished difference Result 2506 states and 3421 transitions.
[2025-03-03 09:50:54,444 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 09:50:54,444 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 2 states have internal predecessors, (218), 0 states have call successors, (0), 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 218
[2025-03-03 09:50:54,444 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:50:54,449 INFO  L225             Difference]: With dead ends: 2506
[2025-03-03 09:50:54,449 INFO  L226             Difference]: Without dead ends: 1666
[2025-03-03 09:50:54,450 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-03-03 09:50:54,451 INFO  L435           NwaCegarLoop]: 53 mSDtfsCounter, 229 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-03 09:50:54,451 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 70 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 564 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-03 09:50:54,453 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1666 states.
[2025-03-03 09:50:54,471 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1666 to 1663.
[2025-03-03 09:50:54,473 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1663 states, 1662 states have (on average 1.325511432009627) internal successors, (2203), 1662 states have internal predecessors, (2203), 0 states have call successors, (0), 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-03-03 09:50:54,477 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1663 states to 1663 states and 2203 transitions.
[2025-03-03 09:50:54,478 INFO  L78                 Accepts]: Start accepts. Automaton has 1663 states and 2203 transitions. Word has length 218
[2025-03-03 09:50:54,478 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:50:54,478 INFO  L471      AbstractCegarLoop]: Abstraction has 1663 states and 2203 transitions.
[2025-03-03 09:50:54,478 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 2 states have internal predecessors, (218), 0 states have call successors, (0), 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-03-03 09:50:54,478 INFO  L276                IsEmpty]: Start isEmpty. Operand 1663 states and 2203 transitions.
[2025-03-03 09:50:54,482 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 224
[2025-03-03 09:50:54,482 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:50:54,482 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 09:50:54,482 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-03-03 09:50:54,482 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:50:54,483 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:50:54,483 INFO  L85        PathProgramCache]: Analyzing trace with hash -113871781, now seen corresponding path program 1 times
[2025-03-03 09:50:54,483 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:50:54,483 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822340400]
[2025-03-03 09:50:54,483 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:50:54,483 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:50:54,508 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 223 statements into 1 equivalence classes.
[2025-03-03 09:50:54,513 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 223 of 223 statements.
[2025-03-03 09:50:54,513 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:50:54,513 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:50:54,656 INFO  L134       CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 09:50:54,656 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:50:54,656 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822340400]
[2025-03-03 09:50:54,656 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822340400] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:50:54,656 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 09:50:54,656 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-03 09:50:54,656 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230063584]
[2025-03-03 09:50:54,656 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:50:54,657 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 09:50:54,657 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:50:54,657 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 09:50:54,657 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:50:54,658 INFO  L87              Difference]: Start difference. First operand 1663 states and 2203 transitions. Second operand  has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 2 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:50:55,212 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:50:55,212 INFO  L93              Difference]: Finished difference Result 4156 states and 5494 transitions.
[2025-03-03 09:50:55,212 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 09:50:55,213 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 2 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 223
[2025-03-03 09:50:55,213 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:50:55,220 INFO  L225             Difference]: With dead ends: 4156
[2025-03-03 09:50:55,220 INFO  L226             Difference]: Without dead ends: 2495
[2025-03-03 09:50:55,222 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-03-03 09:50:55,222 INFO  L435           NwaCegarLoop]: 44 mSDtfsCounter, 203 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 565 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-03 09:50:55,222 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 57 Invalid, 630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 565 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-03 09:50:55,224 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2495 states.
[2025-03-03 09:50:55,251 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2495 to 2492.
[2025-03-03 09:50:55,254 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2492 states, 2491 states have (on average 1.3167402649538338) internal successors, (3280), 2491 states have internal predecessors, (3280), 0 states have call successors, (0), 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-03-03 09:50:55,261 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2492 states to 2492 states and 3280 transitions.
[2025-03-03 09:50:55,261 INFO  L78                 Accepts]: Start accepts. Automaton has 2492 states and 3280 transitions. Word has length 223
[2025-03-03 09:50:55,261 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:50:55,261 INFO  L471      AbstractCegarLoop]: Abstraction has 2492 states and 3280 transitions.
[2025-03-03 09:50:55,262 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 2 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:50:55,262 INFO  L276                IsEmpty]: Start isEmpty. Operand 2492 states and 3280 transitions.
[2025-03-03 09:50:55,266 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 227
[2025-03-03 09:50:55,266 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:50:55,266 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 09:50:55,266 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-03-03 09:50:55,267 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:50:55,267 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:50:55,267 INFO  L85        PathProgramCache]: Analyzing trace with hash 656054517, now seen corresponding path program 1 times
[2025-03-03 09:50:55,267 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:50:55,267 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723051576]
[2025-03-03 09:50:55,267 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:50:55,267 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:50:55,295 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes.
[2025-03-03 09:50:55,312 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements.
[2025-03-03 09:50:55,312 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:50:55,315 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:50:55,640 INFO  L134       CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 09:50:55,641 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:50:55,641 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723051576]
[2025-03-03 09:50:55,641 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723051576] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:50:55,641 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 09:50:55,641 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 09:50:55,641 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614416695]
[2025-03-03 09:50:55,641 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:50:55,642 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-03 09:50:55,642 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:50:55,642 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-03 09:50:55,642 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-03 09:50:55,642 INFO  L87              Difference]: Start difference. First operand 2492 states and 3280 transitions. Second operand  has 4 states, 4 states have (on average 56.5) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 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-03-03 09:50:56,557 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:50:56,558 INFO  L93              Difference]: Finished difference Result 6979 states and 9220 transitions.
[2025-03-03 09:50:56,558 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 09:50:56,559 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 56.5) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 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 226
[2025-03-03 09:50:56,559 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:50:56,571 INFO  L225             Difference]: With dead ends: 6979
[2025-03-03 09:50:56,571 INFO  L226             Difference]: Without dead ends: 4141
[2025-03-03 09:50:56,574 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-03-03 09:50:56,575 INFO  L435           NwaCegarLoop]: 98 mSDtfsCounter, 194 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 1009 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 1157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 1009 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time
[2025-03-03 09:50:56,575 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 121 Invalid, 1157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 1009 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2025-03-03 09:50:56,578 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 4141 states.
[2025-03-03 09:50:56,638 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 4141 to 4140.
[2025-03-03 09:50:56,644 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 4140 states, 4139 states have (on average 1.2974148345010872) internal successors, (5370), 4139 states have internal predecessors, (5370), 0 states have call successors, (0), 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-03-03 09:50:56,656 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4140 states to 4140 states and 5370 transitions.
[2025-03-03 09:50:56,656 INFO  L78                 Accepts]: Start accepts. Automaton has 4140 states and 5370 transitions. Word has length 226
[2025-03-03 09:50:56,657 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:50:56,657 INFO  L471      AbstractCegarLoop]: Abstraction has 4140 states and 5370 transitions.
[2025-03-03 09:50:56,657 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 56.5) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 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-03-03 09:50:56,657 INFO  L276                IsEmpty]: Start isEmpty. Operand 4140 states and 5370 transitions.
[2025-03-03 09:50:56,665 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 231
[2025-03-03 09:50:56,665 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:50:56,665 INFO  L218           NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 09:50:56,665 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-03-03 09:50:56,666 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:50:56,666 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:50:56,666 INFO  L85        PathProgramCache]: Analyzing trace with hash -1017332234, now seen corresponding path program 1 times
[2025-03-03 09:50:56,666 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:50:56,666 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990651541]
[2025-03-03 09:50:56,666 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:50:56,666 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:50:56,704 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes.
[2025-03-03 09:50:56,712 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements.
[2025-03-03 09:50:56,713 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:50:56,713 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:50:56,930 INFO  L134       CoverageAnalysis]: Checked inductivity of 40 backedges. 34 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 09:50:56,930 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:50:56,930 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990651541]
[2025-03-03 09:50:56,930 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990651541] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 09:50:56,931 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [30697683]
[2025-03-03 09:50:56,931 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:50:56,931 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 09:50:56,931 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 09:50:56,934 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-03 09:50:56,935 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2025-03-03 09:50:56,996 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes.
[2025-03-03 09:50:57,082 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements.
[2025-03-03 09:50:57,083 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:50:57,083 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:50:57,086 INFO  L256         TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 3 conjuncts are in the unsatisfiable core
[2025-03-03 09:50:57,092 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 09:50:57,267 INFO  L134       CoverageAnalysis]: Checked inductivity of 40 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2025-03-03 09:50:57,268 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-03 09:50:57,268 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [30697683] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:50:57,268 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-03 09:50:57,268 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5
[2025-03-03 09:50:57,268 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665564475]
[2025-03-03 09:50:57,268 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:50:57,269 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 09:50:57,269 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:50:57,269 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 09:50:57,269 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-03 09:50:57,270 INFO  L87              Difference]: Start difference. First operand 4140 states and 5370 transitions. Second operand  has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 0 states have call successors, (0), 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-03-03 09:50:57,816 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:50:57,816 INFO  L93              Difference]: Finished difference Result 12365 states and 16050 transitions.
[2025-03-03 09:50:57,816 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 09:50:57,817 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 0 states have call successors, (0), 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 230
[2025-03-03 09:50:57,817 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:50:57,839 INFO  L225             Difference]: With dead ends: 12365
[2025-03-03 09:50:57,840 INFO  L226             Difference]: Without dead ends: 8227
[2025-03-03 09:50:57,846 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-03 09:50:57,847 INFO  L435           NwaCegarLoop]: 318 mSDtfsCounter, 34 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-03 09:50:57,848 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 343 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 496 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-03 09:50:57,855 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 8227 states.
[2025-03-03 09:50:57,963 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 8227 to 8200.
[2025-03-03 09:50:57,974 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 8200 states, 8199 states have (on average 1.275033540675692) internal successors, (10454), 8199 states have internal predecessors, (10454), 0 states have call successors, (0), 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-03-03 09:50:57,989 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8200 states to 8200 states and 10454 transitions.
[2025-03-03 09:50:57,990 INFO  L78                 Accepts]: Start accepts. Automaton has 8200 states and 10454 transitions. Word has length 230
[2025-03-03 09:50:57,990 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:50:57,990 INFO  L471      AbstractCegarLoop]: Abstraction has 8200 states and 10454 transitions.
[2025-03-03 09:50:57,990 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 0 states have call successors, (0), 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-03-03 09:50:57,990 INFO  L276                IsEmpty]: Start isEmpty. Operand 8200 states and 10454 transitions.
[2025-03-03 09:50:58,001 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 237
[2025-03-03 09:50:58,001 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:50:58,002 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 09:50:58,009 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2025-03-03 09:50:58,202 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 09:50:58,203 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:50:58,203 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:50:58,204 INFO  L85        PathProgramCache]: Analyzing trace with hash -1093764549, now seen corresponding path program 1 times
[2025-03-03 09:50:58,204 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:50:58,204 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188137239]
[2025-03-03 09:50:58,204 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:50:58,204 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:50:58,233 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 236 statements into 1 equivalence classes.
[2025-03-03 09:50:58,241 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 236 of 236 statements.
[2025-03-03 09:50:58,242 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:50:58,242 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:50:58,444 INFO  L134       CoverageAnalysis]: Checked inductivity of 57 backedges. 45 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2025-03-03 09:50:58,445 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:50:58,445 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188137239]
[2025-03-03 09:50:58,445 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188137239] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 09:50:58,445 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [721598646]
[2025-03-03 09:50:58,445 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:50:58,445 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 09:50:58,445 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 09:50:58,447 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-03 09:50:58,448 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2025-03-03 09:50:58,514 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 236 statements into 1 equivalence classes.
[2025-03-03 09:50:58,576 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 236 of 236 statements.
[2025-03-03 09:50:58,576 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:50:58,576 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:50:58,579 INFO  L256         TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-03-03 09:50:58,582 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 09:50:58,605 INFO  L134       CoverageAnalysis]: Checked inductivity of 57 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2025-03-03 09:50:58,606 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-03 09:50:58,606 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [721598646] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:50:58,606 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-03 09:50:58,606 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5
[2025-03-03 09:50:58,606 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175421216]
[2025-03-03 09:50:58,606 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:50:58,607 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 09:50:58,607 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:50:58,607 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 09:50:58,608 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-03 09:50:58,609 INFO  L87              Difference]: Start difference. First operand 8200 states and 10454 transitions. Second operand  has 3 states, 3 states have (on average 77.0) internal successors, (231), 3 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:50:59,189 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:50:59,189 INFO  L93              Difference]: Finished difference Result 24118 states and 30781 transitions.
[2025-03-03 09:50:59,190 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 09:50:59,191 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 77.0) internal successors, (231), 3 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 236
[2025-03-03 09:50:59,191 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:50:59,276 INFO  L225             Difference]: With dead ends: 24118
[2025-03-03 09:50:59,277 INFO  L226             Difference]: Without dead ends: 15920
[2025-03-03 09:50:59,286 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 235 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-03 09:50:59,286 INFO  L435           NwaCegarLoop]: 322 mSDtfsCounter, 212 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-03 09:50:59,286 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 342 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 495 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-03 09:50:59,299 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 15920 states.
[2025-03-03 09:50:59,482 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 15920 to 15508.
[2025-03-03 09:50:59,504 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 15508 states, 15507 states have (on average 1.173018636744696) internal successors, (18190), 15507 states have internal predecessors, (18190), 0 states have call successors, (0), 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-03-03 09:50:59,528 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 15508 states to 15508 states and 18190 transitions.
[2025-03-03 09:50:59,528 INFO  L78                 Accepts]: Start accepts. Automaton has 15508 states and 18190 transitions. Word has length 236
[2025-03-03 09:50:59,528 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:50:59,528 INFO  L471      AbstractCegarLoop]: Abstraction has 15508 states and 18190 transitions.
[2025-03-03 09:50:59,529 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 77.0) internal successors, (231), 3 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:50:59,529 INFO  L276                IsEmpty]: Start isEmpty. Operand 15508 states and 18190 transitions.
[2025-03-03 09:50:59,545 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 244
[2025-03-03 09:50:59,546 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:50:59,546 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 09:50:59,554 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2025-03-03 09:50:59,746 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7
[2025-03-03 09:50:59,746 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:50:59,747 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:50:59,747 INFO  L85        PathProgramCache]: Analyzing trace with hash -1607530442, now seen corresponding path program 1 times
[2025-03-03 09:50:59,747 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:50:59,747 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654234974]
[2025-03-03 09:50:59,747 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:50:59,747 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:50:59,775 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 243 statements into 1 equivalence classes.
[2025-03-03 09:50:59,783 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 243 of 243 statements.
[2025-03-03 09:50:59,784 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:50:59,784 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:51:00,107 INFO  L134       CoverageAnalysis]: Checked inductivity of 53 backedges. 47 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 09:51:00,107 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:51:00,108 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654234974]
[2025-03-03 09:51:00,108 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654234974] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 09:51:00,108 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [567669457]
[2025-03-03 09:51:00,108 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:51:00,108 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 09:51:00,108 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 09:51:00,110 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-03 09:51:00,111 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2025-03-03 09:51:00,166 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 243 statements into 1 equivalence classes.
[2025-03-03 09:51:00,218 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 243 of 243 statements.
[2025-03-03 09:51:00,218 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:51:00,218 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:51:00,221 INFO  L256         TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-03-03 09:51:00,224 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 09:51:00,422 INFO  L134       CoverageAnalysis]: Checked inductivity of 53 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2025-03-03 09:51:00,422 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-03 09:51:00,422 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [567669457] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:51:00,423 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-03 09:51:00,423 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5
[2025-03-03 09:51:00,423 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203947369]
[2025-03-03 09:51:00,423 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:51:00,423 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 09:51:00,423 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:51:00,424 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 09:51:00,424 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20
[2025-03-03 09:51:00,425 INFO  L87              Difference]: Start difference. First operand 15508 states and 18190 transitions. Second operand  has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 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-03-03 09:51:00,941 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:51:00,941 INFO  L93              Difference]: Finished difference Result 31020 states and 36388 transitions.
[2025-03-03 09:51:00,941 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 09:51:00,942 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 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 243
[2025-03-03 09:51:00,942 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:51:00,966 INFO  L225             Difference]: With dead ends: 31020
[2025-03-03 09:51:00,966 INFO  L226             Difference]: Without dead ends: 15514
[2025-03-03 09:51:00,982 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20
[2025-03-03 09:51:00,985 INFO  L435           NwaCegarLoop]: 40 mSDtfsCounter, 73 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-03 09:51:00,986 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 47 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 530 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-03 09:51:01,000 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 15514 states.
[2025-03-03 09:51:01,176 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 15514 to 15508.
[2025-03-03 09:51:01,196 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 15508 states, 15507 states have (on average 1.1710840265686464) internal successors, (18160), 15507 states have internal predecessors, (18160), 0 states have call successors, (0), 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-03-03 09:51:01,212 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 15508 states to 15508 states and 18160 transitions.
[2025-03-03 09:51:01,213 INFO  L78                 Accepts]: Start accepts. Automaton has 15508 states and 18160 transitions. Word has length 243
[2025-03-03 09:51:01,213 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:51:01,213 INFO  L471      AbstractCegarLoop]: Abstraction has 15508 states and 18160 transitions.
[2025-03-03 09:51:01,214 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 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-03-03 09:51:01,214 INFO  L276                IsEmpty]: Start isEmpty. Operand 15508 states and 18160 transitions.
[2025-03-03 09:51:01,232 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 278
[2025-03-03 09:51:01,233 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:51:01,233 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 09:51:01,240 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0
[2025-03-03 09:51:01,437 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 09:51:01,437 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:51:01,438 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:51:01,438 INFO  L85        PathProgramCache]: Analyzing trace with hash 1535769869, now seen corresponding path program 1 times
[2025-03-03 09:51:01,438 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:51:01,438 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496659910]
[2025-03-03 09:51:01,438 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:51:01,438 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:51:01,468 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 277 statements into 1 equivalence classes.
[2025-03-03 09:51:01,481 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 277 of 277 statements.
[2025-03-03 09:51:01,481 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:51:01,481 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:51:01,614 INFO  L134       CoverageAnalysis]: Checked inductivity of 81 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 09:51:01,615 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:51:01,615 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496659910]
[2025-03-03 09:51:01,615 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496659910] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:51:01,615 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 09:51:01,615 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-03 09:51:01,615 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957882090]
[2025-03-03 09:51:01,615 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:51:01,616 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 09:51:01,616 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:51:01,616 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 09:51:01,617 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:51:01,618 INFO  L87              Difference]: Start difference. First operand 15508 states and 18160 transitions. Second operand  has 3 states, 3 states have (on average 92.33333333333333) internal successors, (277), 2 states have internal predecessors, (277), 0 states have call successors, (0), 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-03-03 09:51:02,241 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:51:02,241 INFO  L93              Difference]: Finished difference Result 38119 states and 45399 transitions.
[2025-03-03 09:51:02,241 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 09:51:02,241 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 92.33333333333333) internal successors, (277), 2 states have internal predecessors, (277), 0 states have call successors, (0), 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-03-03 09:51:02,241 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:51:02,274 INFO  L225             Difference]: With dead ends: 38119
[2025-03-03 09:51:02,275 INFO  L226             Difference]: Without dead ends: 22613
[2025-03-03 09:51:02,289 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-03-03 09:51:02,289 INFO  L435           NwaCegarLoop]: 107 mSDtfsCounter, 134 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 504 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-03 09:51:02,290 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 127 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 504 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-03 09:51:02,304 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 22613 states.
[2025-03-03 09:51:02,471 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 22613 to 22613.
[2025-03-03 09:51:02,499 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 22613 states, 22612 states have (on average 1.1365204316292234) internal successors, (25699), 22612 states have internal predecessors, (25699), 0 states have call successors, (0), 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-03-03 09:51:02,520 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 22613 states to 22613 states and 25699 transitions.
[2025-03-03 09:51:02,521 INFO  L78                 Accepts]: Start accepts. Automaton has 22613 states and 25699 transitions. Word has length 277
[2025-03-03 09:51:02,522 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:51:02,523 INFO  L471      AbstractCegarLoop]: Abstraction has 22613 states and 25699 transitions.
[2025-03-03 09:51:02,523 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 92.33333333333333) internal successors, (277), 2 states have internal predecessors, (277), 0 states have call successors, (0), 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-03-03 09:51:02,523 INFO  L276                IsEmpty]: Start isEmpty. Operand 22613 states and 25699 transitions.
[2025-03-03 09:51:02,548 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 298
[2025-03-03 09:51:02,549 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:51:02,549 INFO  L218           NwaCegarLoop]: trace histogram [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, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 09:51:02,549 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-03-03 09:51:02,550 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:51:02,550 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:51:02,550 INFO  L85        PathProgramCache]: Analyzing trace with hash 349482764, now seen corresponding path program 1 times
[2025-03-03 09:51:02,550 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:51:02,550 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473497703]
[2025-03-03 09:51:02,551 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:51:02,551 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:51:02,579 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 297 statements into 1 equivalence classes.
[2025-03-03 09:51:02,585 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 297 of 297 statements.
[2025-03-03 09:51:02,586 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:51:02,586 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:51:03,514 INFO  L134       CoverageAnalysis]: Checked inductivity of 210 backedges. 110 proven. 6 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked.
[2025-03-03 09:51:03,515 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:51:03,515 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473497703]
[2025-03-03 09:51:03,515 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473497703] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 09:51:03,515 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [566071319]
[2025-03-03 09:51:03,515 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:51:03,515 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 09:51:03,515 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 09:51:03,520 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-03 09:51:03,521 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2025-03-03 09:51:03,580 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 297 statements into 1 equivalence classes.
[2025-03-03 09:51:03,646 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 297 of 297 statements.
[2025-03-03 09:51:03,646 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:51:03,646 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:51:03,649 INFO  L256         TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 3 conjuncts are in the unsatisfiable core
[2025-03-03 09:51:03,652 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 09:51:03,689 INFO  L134       CoverageAnalysis]: Checked inductivity of 210 backedges. 174 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked.
[2025-03-03 09:51:03,689 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-03 09:51:03,689 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [566071319] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:51:03,689 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-03 09:51:03,689 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6
[2025-03-03 09:51:03,689 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855256693]
[2025-03-03 09:51:03,689 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:51:03,690 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 09:51:03,690 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:51:03,690 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 09:51:03,690 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-03-03 09:51:03,691 INFO  L87              Difference]: Start difference. First operand 22613 states and 25699 transitions. Second operand  has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 0 states have call successors, (0), 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-03-03 09:51:04,346 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:51:04,346 INFO  L93              Difference]: Finished difference Result 56822 states and 64874 transitions.
[2025-03-03 09:51:04,346 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 09:51:04,347 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 0 states have call successors, (0), 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 297
[2025-03-03 09:51:04,347 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:51:04,401 INFO  L225             Difference]: With dead ends: 56822
[2025-03-03 09:51:04,402 INFO  L226             Difference]: Without dead ends: 34211
[2025-03-03 09:51:04,417 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 296 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-03-03 09:51:04,418 INFO  L435           NwaCegarLoop]: 328 mSDtfsCounter, 191 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-03 09:51:04,419 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 349 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 552 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-03 09:51:04,441 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 34211 states.
[2025-03-03 09:51:04,665 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 34211 to 33187.
[2025-03-03 09:51:04,690 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 33187 states, 33186 states have (on average 1.1318025673476768) internal successors, (37560), 33186 states have internal predecessors, (37560), 0 states have call successors, (0), 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-03-03 09:51:04,723 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 33187 states to 33187 states and 37560 transitions.
[2025-03-03 09:51:04,723 INFO  L78                 Accepts]: Start accepts. Automaton has 33187 states and 37560 transitions. Word has length 297
[2025-03-03 09:51:04,723 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:51:04,724 INFO  L471      AbstractCegarLoop]: Abstraction has 33187 states and 37560 transitions.
[2025-03-03 09:51:04,724 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 0 states have call successors, (0), 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-03-03 09:51:04,724 INFO  L276                IsEmpty]: Start isEmpty. Operand 33187 states and 37560 transitions.
[2025-03-03 09:51:04,748 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 318
[2025-03-03 09:51:04,748 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:51:04,748 INFO  L218           NwaCegarLoop]: trace histogram [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, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 09:51:04,755 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0
[2025-03-03 09:51:04,948 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 09:51:04,949 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:51:04,949 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:51:04,949 INFO  L85        PathProgramCache]: Analyzing trace with hash -487879803, now seen corresponding path program 1 times
[2025-03-03 09:51:04,949 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:51:04,949 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488886042]
[2025-03-03 09:51:04,949 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:51:04,949 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:51:04,982 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 317 statements into 1 equivalence classes.
[2025-03-03 09:51:04,991 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 317 of 317 statements.
[2025-03-03 09:51:04,991 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:51:04,991 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:51:05,775 INFO  L134       CoverageAnalysis]: Checked inductivity of 230 backedges. 110 proven. 6 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked.
[2025-03-03 09:51:05,775 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:51:05,775 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488886042]
[2025-03-03 09:51:05,775 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488886042] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 09:51:05,775 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2117128286]
[2025-03-03 09:51:05,775 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:51:05,775 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 09:51:05,776 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 09:51:05,777 INFO  L229       MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-03 09:51:05,779 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2025-03-03 09:51:05,837 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 317 statements into 1 equivalence classes.
[2025-03-03 09:51:05,906 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 317 of 317 statements.
[2025-03-03 09:51:05,906 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:51:05,906 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:51:05,909 INFO  L256         TraceCheckSpWp]: Trace formula consists of 584 conjuncts, 4 conjuncts are in the unsatisfiable core
[2025-03-03 09:51:05,913 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 09:51:06,196 INFO  L134       CoverageAnalysis]: Checked inductivity of 230 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked.
[2025-03-03 09:51:06,196 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-03 09:51:06,453 INFO  L134       CoverageAnalysis]: Checked inductivity of 230 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked.
[2025-03-03 09:51:06,453 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2117128286] provided 0 perfect and 2 imperfect interpolant sequences
[2025-03-03 09:51:06,453 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-03-03 09:51:06,453 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 6
[2025-03-03 09:51:06,455 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649697810]
[2025-03-03 09:51:06,455 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-03-03 09:51:06,455 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-03-03 09:51:06,455 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:51:06,456 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-03-03 09:51:06,456 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2025-03-03 09:51:06,456 INFO  L87              Difference]: Start difference. First operand 33187 states and 37560 transitions. Second operand  has 7 states, 7 states have (on average 69.57142857142857) internal successors, (487), 6 states have internal predecessors, (487), 0 states have call successors, (0), 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-03-03 09:51:08,632 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:51:08,632 INFO  L93              Difference]: Finished difference Result 100182 states and 113405 transitions.
[2025-03-03 09:51:08,635 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2025-03-03 09:51:08,636 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 69.57142857142857) internal successors, (487), 6 states have internal predecessors, (487), 0 states have call successors, (0), 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 317
[2025-03-03 09:51:08,636 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:51:08,747 INFO  L225             Difference]: With dead ends: 100182
[2025-03-03 09:51:08,748 INFO  L226             Difference]: Without dead ends: 66997
[2025-03-03 09:51:08,763 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 640 GetRequests, 631 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110
[2025-03-03 09:51:08,764 INFO  L435           NwaCegarLoop]: 67 mSDtfsCounter, 1032 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 3435 mSolverCounterSat, 305 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1032 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 3740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 305 IncrementalHoareTripleChecker+Valid, 3435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time
[2025-03-03 09:51:08,764 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1032 Valid, 233 Invalid, 3740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [305 Valid, 3435 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time]
[2025-03-03 09:51:08,802 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 66997 states.
[2025-03-03 09:51:09,442 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 66997 to 61461.
[2025-03-03 09:51:09,496 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 61461 states, 61460 states have (on average 1.1291734461438334) internal successors, (69399), 61460 states have internal predecessors, (69399), 0 states have call successors, (0), 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-03-03 09:51:09,581 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 61461 states to 61461 states and 69399 transitions.
[2025-03-03 09:51:09,582 INFO  L78                 Accepts]: Start accepts. Automaton has 61461 states and 69399 transitions. Word has length 317
[2025-03-03 09:51:09,582 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:51:09,582 INFO  L471      AbstractCegarLoop]: Abstraction has 61461 states and 69399 transitions.
[2025-03-03 09:51:09,583 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 69.57142857142857) internal successors, (487), 6 states have internal predecessors, (487), 0 states have call successors, (0), 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-03-03 09:51:09,583 INFO  L276                IsEmpty]: Start isEmpty. Operand 61461 states and 69399 transitions.
[2025-03-03 09:51:09,623 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 353
[2025-03-03 09:51:09,624 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:51:09,624 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 09:51:09,630 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0
[2025-03-03 09:51:09,824 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11
[2025-03-03 09:51:09,825 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:51:09,825 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:51:09,825 INFO  L85        PathProgramCache]: Analyzing trace with hash 1484913602, now seen corresponding path program 1 times
[2025-03-03 09:51:09,825 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:51:09,825 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589253523]
[2025-03-03 09:51:09,825 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:51:09,825 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:51:09,878 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 352 statements into 1 equivalence classes.
[2025-03-03 09:51:09,891 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 352 of 352 statements.
[2025-03-03 09:51:09,891 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:51:09,891 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:51:10,066 INFO  L134       CoverageAnalysis]: Checked inductivity of 230 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked.
[2025-03-03 09:51:10,067 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:51:10,067 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589253523]
[2025-03-03 09:51:10,067 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589253523] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:51:10,067 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 09:51:10,067 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-03 09:51:10,067 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221066128]
[2025-03-03 09:51:10,067 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:51:10,067 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 09:51:10,067 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:51:10,067 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 09:51:10,067 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:51:10,068 INFO  L87              Difference]: Start difference. First operand 61461 states and 69399 transitions. Second operand  has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 2 states have internal predecessors, (271), 0 states have call successors, (0), 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-03-03 09:51:10,902 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:51:10,903 INFO  L93              Difference]: Finished difference Result 159361 states and 180077 transitions.
[2025-03-03 09:51:10,907 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 09:51:10,907 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 2 states have internal predecessors, (271), 0 states have call successors, (0), 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 352
[2025-03-03 09:51:10,907 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:51:11,031 INFO  L225             Difference]: With dead ends: 159361
[2025-03-03 09:51:11,032 INFO  L226             Difference]: Without dead ends: 99120
[2025-03-03 09:51:11,064 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-03-03 09:51:11,066 INFO  L435           NwaCegarLoop]: 52 mSDtfsCounter, 157 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 636 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-03 09:51:11,066 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 67 Invalid, 636 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-03 09:51:11,129 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 99120 states.
[2025-03-03 09:51:11,825 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 99120 to 98710.
[2025-03-03 09:51:11,902 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 98710 states, 98709 states have (on average 1.1283570900323172) internal successors, (111379), 98709 states have internal predecessors, (111379), 0 states have call successors, (0), 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-03-03 09:51:12,462 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 98710 states to 98710 states and 111379 transitions.
[2025-03-03 09:51:12,464 INFO  L78                 Accepts]: Start accepts. Automaton has 98710 states and 111379 transitions. Word has length 352
[2025-03-03 09:51:12,464 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:51:12,464 INFO  L471      AbstractCegarLoop]: Abstraction has 98710 states and 111379 transitions.
[2025-03-03 09:51:12,464 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 2 states have internal predecessors, (271), 0 states have call successors, (0), 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-03-03 09:51:12,464 INFO  L276                IsEmpty]: Start isEmpty. Operand 98710 states and 111379 transitions.
[2025-03-03 09:51:12,507 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 374
[2025-03-03 09:51:12,507 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:51:12,507 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 09:51:12,507 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2025-03-03 09:51:12,507 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:51:12,508 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:51:12,508 INFO  L85        PathProgramCache]: Analyzing trace with hash -1163044795, now seen corresponding path program 1 times
[2025-03-03 09:51:12,508 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:51:12,508 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219244976]
[2025-03-03 09:51:12,508 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:51:12,508 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:51:12,544 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 373 statements into 1 equivalence classes.
[2025-03-03 09:51:12,559 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 373 of 373 statements.
[2025-03-03 09:51:12,559 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:51:12,559 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:51:12,657 INFO  L134       CoverageAnalysis]: Checked inductivity of 258 backedges. 258 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 09:51:12,657 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:51:12,657 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219244976]
[2025-03-03 09:51:12,657 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219244976] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:51:12,657 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 09:51:12,658 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 09:51:12,658 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972209966]
[2025-03-03 09:51:12,658 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:51:12,658 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 09:51:12,658 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:51:12,658 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 09:51:12,658 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:51:12,659 INFO  L87              Difference]: Start difference. First operand 98710 states and 111379 transitions. Second operand  has 3 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 0 states have call successors, (0), 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-03-03 09:51:13,410 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:51:13,410 INFO  L93              Difference]: Finished difference Result 185588 states and 209154 transitions.
[2025-03-03 09:51:13,411 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 09:51:13,411 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 0 states have call successors, (0), 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 373
[2025-03-03 09:51:13,411 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:51:13,544 INFO  L225             Difference]: With dead ends: 185588
[2025-03-03 09:51:13,545 INFO  L226             Difference]: Without dead ends: 88098
[2025-03-03 09:51:13,613 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-03-03 09:51:13,613 INFO  L435           NwaCegarLoop]: 300 mSDtfsCounter, 159 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-03 09:51:13,613 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 316 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-03 09:51:13,851 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 88098 states.
[2025-03-03 09:51:14,695 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 88098 to 88087.
[2025-03-03 09:51:14,760 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 88087 states, 88086 states have (on average 1.101684717208183) internal successors, (97043), 88086 states have internal predecessors, (97043), 0 states have call successors, (0), 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-03-03 09:51:14,877 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 88087 states to 88087 states and 97043 transitions.
[2025-03-03 09:51:14,878 INFO  L78                 Accepts]: Start accepts. Automaton has 88087 states and 97043 transitions. Word has length 373
[2025-03-03 09:51:14,878 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:51:14,879 INFO  L471      AbstractCegarLoop]: Abstraction has 88087 states and 97043 transitions.
[2025-03-03 09:51:14,879 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 0 states have call successors, (0), 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-03-03 09:51:14,879 INFO  L276                IsEmpty]: Start isEmpty. Operand 88087 states and 97043 transitions.
[2025-03-03 09:51:15,110 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 482
[2025-03-03 09:51:15,111 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:51:15,111 INFO  L218           NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 09:51:15,111 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2025-03-03 09:51:15,111 INFO  L396      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:51:15,111 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:51:15,111 INFO  L85        PathProgramCache]: Analyzing trace with hash -1227073490, now seen corresponding path program 1 times
[2025-03-03 09:51:15,111 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:51:15,112 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983000711]
[2025-03-03 09:51:15,112 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:51:15,112 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:51:15,170 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 481 statements into 1 equivalence classes.
[2025-03-03 09:51:15,178 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 481 of 481 statements.
[2025-03-03 09:51:15,178 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:51:15,178 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:51:15,446 INFO  L134       CoverageAnalysis]: Checked inductivity of 650 backedges. 199 proven. 0 refuted. 0 times theorem prover too weak. 451 trivial. 0 not checked.
[2025-03-03 09:51:15,446 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:51:15,446 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983000711]
[2025-03-03 09:51:15,446 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983000711] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:51:15,446 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 09:51:15,447 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 09:51:15,447 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974472639]
[2025-03-03 09:51:15,447 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:51:15,447 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-03 09:51:15,447 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:51:15,448 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-03 09:51:15,448 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-03 09:51:15,448 INFO  L87              Difference]: Start difference. First operand 88087 states and 97043 transitions. Second operand  has 4 states, 4 states have (on average 60.0) internal successors, (240), 3 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:51:16,546 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:51:16,546 INFO  L93              Difference]: Finished difference Result 254808 states and 279899 transitions.
[2025-03-03 09:51:16,546 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 09:51:16,546 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 60.0) internal successors, (240), 3 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 481
[2025-03-03 09:51:16,546 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:51:16,745 INFO  L225             Difference]: With dead ends: 254808
[2025-03-03 09:51:16,745 INFO  L226             Difference]: Without dead ends: 166723
[2025-03-03 09:51:16,811 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-03-03 09:51:16,811 INFO  L435           NwaCegarLoop]: 96 mSDtfsCounter, 460 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 652 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 460 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-03 09:51:16,811 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [460 Valid, 335 Invalid, 746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 652 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-03 09:51:16,938 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 166723 states.
[2025-03-03 09:51:18,384 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 166723 to 150253.
[2025-03-03 09:51:18,474 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 150253 states, 150252 states have (on average 1.0953065516598781) internal successors, (164572), 150252 states have internal predecessors, (164572), 0 states have call successors, (0), 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-03-03 09:51:18,627 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 150253 states to 150253 states and 164572 transitions.
[2025-03-03 09:51:18,630 INFO  L78                 Accepts]: Start accepts. Automaton has 150253 states and 164572 transitions. Word has length 481
[2025-03-03 09:51:18,630 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:51:18,630 INFO  L471      AbstractCegarLoop]: Abstraction has 150253 states and 164572 transitions.
[2025-03-03 09:51:18,630 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 60.0) internal successors, (240), 3 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:51:18,630 INFO  L276                IsEmpty]: Start isEmpty. Operand 150253 states and 164572 transitions.
[2025-03-03 09:51:18,729 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 482
[2025-03-03 09:51:18,729 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:51:18,730 INFO  L218           NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 09:51:18,730 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2025-03-03 09:51:18,730 INFO  L396      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:51:18,730 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:51:18,730 INFO  L85        PathProgramCache]: Analyzing trace with hash 2096634826, now seen corresponding path program 2 times
[2025-03-03 09:51:18,730 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:51:18,730 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756508030]
[2025-03-03 09:51:18,730 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-03-03 09:51:18,730 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:51:18,971 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 481 statements into 2 equivalence classes.
[2025-03-03 09:51:19,016 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 481 of 481 statements.
[2025-03-03 09:51:19,016 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-03-03 09:51:19,016 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:51:19,473 INFO  L134       CoverageAnalysis]: Checked inductivity of 650 backedges. 416 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked.
[2025-03-03 09:51:19,473 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:51:19,473 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756508030]
[2025-03-03 09:51:19,473 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756508030] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:51:19,473 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 09:51:19,473 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 09:51:19,474 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96474380]
[2025-03-03 09:51:19,474 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:51:19,474 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 09:51:19,474 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:51:19,475 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 09:51:19,475 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:51:19,475 INFO  L87              Difference]: Start difference. First operand 150253 states and 164572 transitions. Second operand  has 3 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 0 states have call successors, (0), 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-03-03 09:51:20,481 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:51:20,481 INFO  L93              Difference]: Finished difference Result 307882 states and 337792 transitions.
[2025-03-03 09:51:20,482 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 09:51:20,482 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 481
[2025-03-03 09:51:20,482 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:51:20,699 INFO  L225             Difference]: With dead ends: 307882
[2025-03-03 09:51:20,699 INFO  L226             Difference]: Without dead ends: 158849
[2025-03-03 09:51:20,799 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-03-03 09:51:20,799 INFO  L435           NwaCegarLoop]: 304 mSDtfsCounter, 187 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-03 09:51:20,800 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 318 Invalid, 591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 519 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-03 09:51:20,912 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 158849 states.
[2025-03-03 09:51:22,289 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 158849 to 148020.
[2025-03-03 09:51:22,409 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 148020 states, 148019 states have (on average 1.0934474628257183) internal successors, (161851), 148019 states have internal predecessors, (161851), 0 states have call successors, (0), 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-03-03 09:51:22,802 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 148020 states to 148020 states and 161851 transitions.
[2025-03-03 09:51:22,805 INFO  L78                 Accepts]: Start accepts. Automaton has 148020 states and 161851 transitions. Word has length 481
[2025-03-03 09:51:22,805 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:51:22,805 INFO  L471      AbstractCegarLoop]: Abstraction has 148020 states and 161851 transitions.
[2025-03-03 09:51:22,805 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 0 states have call successors, (0), 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-03-03 09:51:22,805 INFO  L276                IsEmpty]: Start isEmpty. Operand 148020 states and 161851 transitions.
[2025-03-03 09:51:22,901 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 587
[2025-03-03 09:51:22,902 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:51:22,902 INFO  L218           NwaCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 09:51:22,902 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2025-03-03 09:51:22,902 INFO  L396      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:51:22,902 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:51:22,902 INFO  L85        PathProgramCache]: Analyzing trace with hash 1750366316, now seen corresponding path program 1 times
[2025-03-03 09:51:22,902 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:51:22,903 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030743410]
[2025-03-03 09:51:22,903 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:51:22,903 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:51:22,953 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 586 statements into 1 equivalence classes.
[2025-03-03 09:51:22,970 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 586 of 586 statements.
[2025-03-03 09:51:22,970 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:51:22,970 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:51:23,589 INFO  L134       CoverageAnalysis]: Checked inductivity of 942 backedges. 385 proven. 0 refuted. 0 times theorem prover too weak. 557 trivial. 0 not checked.
[2025-03-03 09:51:23,589 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:51:23,589 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030743410]
[2025-03-03 09:51:23,589 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030743410] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:51:23,589 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 09:51:23,590 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-03 09:51:23,590 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229858042]
[2025-03-03 09:51:23,590 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:51:23,590 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 09:51:23,590 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:51:23,591 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 09:51:23,591 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:51:23,591 INFO  L87              Difference]: Start difference. First operand 148020 states and 161851 transitions. Second operand  has 3 states, 3 states have (on average 110.0) internal successors, (330), 2 states have internal predecessors, (330), 0 states have call successors, (0), 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-03-03 09:51:24,772 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:51:24,772 INFO  L93              Difference]: Finished difference Result 306226 states and 335803 transitions.
[2025-03-03 09:51:24,773 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 09:51:24,773 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 110.0) internal successors, (330), 2 states have internal predecessors, (330), 0 states have call successors, (0), 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 586
[2025-03-03 09:51:24,773 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:51:24,952 INFO  L225             Difference]: With dead ends: 306226
[2025-03-03 09:51:24,952 INFO  L226             Difference]: Without dead ends: 159426
[2025-03-03 09:51:25,016 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-03-03 09:51:25,016 INFO  L435           NwaCegarLoop]: 93 mSDtfsCounter, 89 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 554 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-03 09:51:25,016 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 107 Invalid, 600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 554 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-03 09:51:25,125 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 159426 states.
[2025-03-03 09:51:26,516 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 159426 to 159383.
[2025-03-03 09:51:26,633 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 159383 states, 159382 states have (on average 1.080655281022951) internal successors, (172237), 159382 states have internal predecessors, (172237), 0 states have call successors, (0), 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-03-03 09:51:26,796 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 159383 states to 159383 states and 172237 transitions.
[2025-03-03 09:51:26,799 INFO  L78                 Accepts]: Start accepts. Automaton has 159383 states and 172237 transitions. Word has length 586
[2025-03-03 09:51:26,799 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:51:26,799 INFO  L471      AbstractCegarLoop]: Abstraction has 159383 states and 172237 transitions.
[2025-03-03 09:51:26,799 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 110.0) internal successors, (330), 2 states have internal predecessors, (330), 0 states have call successors, (0), 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-03-03 09:51:26,799 INFO  L276                IsEmpty]: Start isEmpty. Operand 159383 states and 172237 transitions.
[2025-03-03 09:51:27,289 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 622
[2025-03-03 09:51:27,289 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:51:27,289 INFO  L218           NwaCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 09:51:27,290 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2025-03-03 09:51:27,290 INFO  L396      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:51:27,290 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:51:27,290 INFO  L85        PathProgramCache]: Analyzing trace with hash 1255054994, now seen corresponding path program 1 times
[2025-03-03 09:51:27,290 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:51:27,290 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337103870]
[2025-03-03 09:51:27,290 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:51:27,290 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:51:27,374 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 621 statements into 1 equivalence classes.
[2025-03-03 09:51:27,384 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 621 of 621 statements.
[2025-03-03 09:51:27,384 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:51:27,384 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:51:28,168 INFO  L134       CoverageAnalysis]: Checked inductivity of 1167 backedges. 213 proven. 6 refuted. 0 times theorem prover too weak. 948 trivial. 0 not checked.
[2025-03-03 09:51:28,169 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:51:28,169 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337103870]
[2025-03-03 09:51:28,169 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337103870] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 09:51:28,169 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [920557598]
[2025-03-03 09:51:28,169 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:51:28,169 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 09:51:28,169 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 09:51:28,172 INFO  L229       MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-03 09:51:28,173 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process
[2025-03-03 09:51:28,266 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 621 statements into 1 equivalence classes.
[2025-03-03 09:51:28,394 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 621 of 621 statements.
[2025-03-03 09:51:28,394 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:51:28,394 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:51:28,398 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1043 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-03-03 09:51:28,404 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 09:51:28,642 INFO  L134       CoverageAnalysis]: Checked inductivity of 1167 backedges. 671 proven. 0 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked.
[2025-03-03 09:51:28,642 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-03 09:51:28,642 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [920557598] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:51:28,642 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-03 09:51:28,642 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4
[2025-03-03 09:51:28,643 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521398884]
[2025-03-03 09:51:28,643 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:51:28,643 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 09:51:28,643 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:51:28,646 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 09:51:28,646 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-03 09:51:28,646 INFO  L87              Difference]: Start difference. First operand 159383 states and 172237 transitions. Second operand  has 3 states, 3 states have (on average 111.0) internal successors, (333), 2 states have internal predecessors, (333), 0 states have call successors, (0), 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-03-03 09:51:29,859 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:51:29,859 INFO  L93              Difference]: Finished difference Result 446668 states and 483162 transitions.
[2025-03-03 09:51:29,859 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 09:51:29,859 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 111.0) internal successors, (333), 2 states have internal predecessors, (333), 0 states have call successors, (0), 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 621
[2025-03-03 09:51:29,860 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:51:30,189 INFO  L225             Difference]: With dead ends: 446668
[2025-03-03 09:51:30,190 INFO  L226             Difference]: Without dead ends: 288505
[2025-03-03 09:51:30,276 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 623 GetRequests, 620 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-03 09:51:30,276 INFO  L435           NwaCegarLoop]: 268 mSDtfsCounter, 169 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-03 09:51:30,276 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 513 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-03 09:51:30,467 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 288505 states.
[2025-03-03 09:51:33,418 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 288505 to 288503.
[2025-03-03 09:51:33,628 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 288503 states, 288502 states have (on average 1.081638948776785) internal successors, (312055), 288502 states have internal predecessors, (312055), 0 states have call successors, (0), 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-03-03 09:51:34,376 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 288503 states to 288503 states and 312055 transitions.
[2025-03-03 09:51:34,381 INFO  L78                 Accepts]: Start accepts. Automaton has 288503 states and 312055 transitions. Word has length 621
[2025-03-03 09:51:34,382 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:51:34,382 INFO  L471      AbstractCegarLoop]: Abstraction has 288503 states and 312055 transitions.
[2025-03-03 09:51:34,382 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 111.0) internal successors, (333), 2 states have internal predecessors, (333), 0 states have call successors, (0), 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-03-03 09:51:34,382 INFO  L276                IsEmpty]: Start isEmpty. Operand 288503 states and 312055 transitions.
[2025-03-03 09:51:34,569 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 629
[2025-03-03 09:51:34,569 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:51:34,569 INFO  L218           NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 09:51:34,577 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0
[2025-03-03 09:51:34,770 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17
[2025-03-03 09:51:34,770 INFO  L396      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:51:34,771 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:51:34,771 INFO  L85        PathProgramCache]: Analyzing trace with hash 1581108809, now seen corresponding path program 1 times
[2025-03-03 09:51:34,771 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:51:34,771 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899393318]
[2025-03-03 09:51:34,771 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:51:34,771 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:51:34,825 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 628 statements into 1 equivalence classes.
[2025-03-03 09:51:34,833 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 628 of 628 statements.
[2025-03-03 09:51:34,833 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:51:34,833 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:51:35,501 INFO  L134       CoverageAnalysis]: Checked inductivity of 1108 backedges. 204 proven. 6 refuted. 0 times theorem prover too weak. 898 trivial. 0 not checked.
[2025-03-03 09:51:35,502 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:51:35,502 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899393318]
[2025-03-03 09:51:35,502 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899393318] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 09:51:35,502 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [481601572]
[2025-03-03 09:51:35,502 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:51:35,502 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 09:51:35,502 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 09:51:35,504 INFO  L229       MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-03 09:51:35,506 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process
[2025-03-03 09:51:35,596 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 628 statements into 1 equivalence classes.
[2025-03-03 09:51:35,725 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 628 of 628 statements.
[2025-03-03 09:51:35,725 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:51:35,725 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:51:35,730 INFO  L256         TraceCheckSpWp]: Trace formula consists of 996 conjuncts, 3 conjuncts are in the unsatisfiable core
[2025-03-03 09:51:35,740 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 09:51:35,854 INFO  L134       CoverageAnalysis]: Checked inductivity of 1108 backedges. 600 proven. 0 refuted. 0 times theorem prover too weak. 508 trivial. 0 not checked.
[2025-03-03 09:51:35,855 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-03 09:51:35,855 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [481601572] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:51:35,855 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-03 09:51:35,855 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5
[2025-03-03 09:51:35,855 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331515088]
[2025-03-03 09:51:35,856 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:51:35,856 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 09:51:35,857 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:51:35,857 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 09:51:35,857 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-03 09:51:35,857 INFO  L87              Difference]: Start difference. First operand 288503 states and 312055 transitions. Second operand  has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 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-03-03 09:51:37,528 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:51:37,528 INFO  L93              Difference]: Finished difference Result 531536 states and 575670 transitions.
[2025-03-03 09:51:37,528 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 09:51:37,529 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 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 628
[2025-03-03 09:51:37,529 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:51:37,874 INFO  L225             Difference]: With dead ends: 531536
[2025-03-03 09:51:37,874 INFO  L226             Difference]: Without dead ends: 243238
[2025-03-03 09:51:38,051 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 630 GetRequests, 627 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-03 09:51:38,051 INFO  L435           NwaCegarLoop]: 271 mSDtfsCounter, 111 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 510 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-03 09:51:38,051 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 285 Invalid, 583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 510 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-03 09:51:38,577 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 243238 states.
[2025-03-03 09:51:40,631 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 243238 to 192834.
[2025-03-03 09:51:40,742 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 192834 states, 192833 states have (on average 1.0767659062504862) internal successors, (207636), 192833 states have internal predecessors, (207636), 0 states have call successors, (0), 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-03-03 09:51:40,941 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 192834 states to 192834 states and 207636 transitions.
[2025-03-03 09:51:40,946 INFO  L78                 Accepts]: Start accepts. Automaton has 192834 states and 207636 transitions. Word has length 628
[2025-03-03 09:51:40,947 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:51:40,947 INFO  L471      AbstractCegarLoop]: Abstraction has 192834 states and 207636 transitions.
[2025-03-03 09:51:40,947 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 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-03-03 09:51:40,947 INFO  L276                IsEmpty]: Start isEmpty. Operand 192834 states and 207636 transitions.
[2025-03-03 09:51:41,078 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 639
[2025-03-03 09:51:41,078 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:51:41,078 INFO  L218           NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 09:51:41,085 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0
[2025-03-03 09:51:41,279 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 09:51:41,279 INFO  L396      AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:51:41,280 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:51:41,280 INFO  L85        PathProgramCache]: Analyzing trace with hash 1107334552, now seen corresponding path program 1 times
[2025-03-03 09:51:41,280 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:51:41,280 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669996711]
[2025-03-03 09:51:41,280 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:51:41,280 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:51:41,335 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 638 statements into 1 equivalence classes.
[2025-03-03 09:51:41,344 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 638 of 638 statements.
[2025-03-03 09:51:41,344 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:51:41,344 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat