./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.bakery.8.prop1-back-serstep.c --full-output --architecture 64bit


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


Checking for ERROR reachability
Using default analysis
Version 8fc3dc66
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/hardware-verification-bv/btor2c-lazyMod.bakery.8.prop1-back-serstep.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash 16f1da9b238db892f8a1f989bae0a4cd8e29a71db96a6af0e901236bbc9485bf
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-8fc3dc6-m
[2025-03-16 21:01:30,967 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-03-16 21:01:31,013 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf
[2025-03-16 21:01:31,019 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-03-16 21:01:31,022 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-03-16 21:01:31,046 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-03-16 21:01:31,046 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-03-16 21:01:31,047 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-03-16 21:01:31,047 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-03-16 21:01:31,047 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-03-16 21:01:31,047 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-03-16 21:01:31,048 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-03-16 21:01:31,048 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-03-16 21:01:31,048 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-03-16 21:01:31,048 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-03-16 21:01:31,048 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-03-16 21:01:31,048 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-03-16 21:01:31,049 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-03-16 21:01:31,049 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-03-16 21:01:31,049 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-03-16 21:01:31,049 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-03-16 21:01:31,049 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-03-16 21:01:31,049 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-03-16 21:01:31,049 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-03-16 21:01:31,050 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-03-16 21:01:31,050 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-03-16 21:01:31,050 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-03-16 21:01:31,050 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-03-16 21:01:31,050 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-03-16 21:01:31,050 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-16 21:01:31,050 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-03-16 21:01:31,050 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-03-16 21:01:31,050 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-03-16 21:01:31,050 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-03-16 21:01:31,051 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-03-16 21:01:31,051 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-03-16 21:01:31,051 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-03-16 21:01:31,051 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-03-16 21:01:31,051 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-03-16 21:01:31,051 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-03-16 21:01:31,051 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 -> 64bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 16f1da9b238db892f8a1f989bae0a4cd8e29a71db96a6af0e901236bbc9485bf
[2025-03-16 21:01:31,270 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-03-16 21:01:31,278 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-03-16 21:01:31,281 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-03-16 21:01:31,281 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-03-16 21:01:31,282 INFO  L274        PluginConnector]: CDTParser initialized
[2025-03-16 21:01:31,283 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.bakery.8.prop1-back-serstep.c
[2025-03-16 21:01:32,451 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be18a5e0f/5185163a33c04d0586d1c0bb097d18d6/FLAGf6ea2d3a8
[2025-03-16 21:01:32,760 INFO  L384              CDTParser]: Found 1 translation units.
[2025-03-16 21:01:32,760 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.bakery.8.prop1-back-serstep.c
[2025-03-16 21:01:32,782 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be18a5e0f/5185163a33c04d0586d1c0bb097d18d6/FLAGf6ea2d3a8
[2025-03-16 21:01:32,793 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be18a5e0f/5185163a33c04d0586d1c0bb097d18d6
[2025-03-16 21:01:32,795 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-03-16 21:01:32,796 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-03-16 21:01:32,797 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-03-16 21:01:32,797 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-03-16 21:01:32,800 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-03-16 21:01:32,800 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 09:01:32" (1/1) ...
[2025-03-16 21:01:32,801 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cfb2a19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:01:32, skipping insertion in model container
[2025-03-16 21:01:32,801 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 09:01:32" (1/1) ...
[2025-03-16 21:01:32,849 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-03-16 21:01:33,020 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/hardware-verification-bv/btor2c-lazyMod.bakery.8.prop1-back-serstep.c[1174,1187]
[2025-03-16 21:01:33,402 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-16 21:01:33,414 INFO  L200         MainTranslator]: Completed pre-run
[2025-03-16 21:01:33,421 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/hardware-verification-bv/btor2c-lazyMod.bakery.8.prop1-back-serstep.c[1174,1187]
[2025-03-16 21:01:33,616 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-16 21:01:33,629 INFO  L204         MainTranslator]: Completed translation
[2025-03-16 21:01:33,629 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:01:33 WrapperNode
[2025-03-16 21:01:33,629 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-03-16 21:01:33,630 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-03-16 21:01:33,630 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-03-16 21:01:33,630 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-03-16 21:01:33,635 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:01:33" (1/1) ...
[2025-03-16 21:01:33,699 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:01:33" (1/1) ...
[2025-03-16 21:01:34,778 INFO  L138                Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 11079
[2025-03-16 21:01:34,779 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-03-16 21:01:34,779 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-03-16 21:01:34,779 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-03-16 21:01:34,780 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-03-16 21:01:34,786 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:01:33" (1/1) ...
[2025-03-16 21:01:34,786 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:01:33" (1/1) ...
[2025-03-16 21:01:34,907 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:01:33" (1/1) ...
[2025-03-16 21:01:35,049 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-16 21:01:35,050 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:01:33" (1/1) ...
[2025-03-16 21:01:35,050 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:01:33" (1/1) ...
[2025-03-16 21:01:35,298 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:01:33" (1/1) ...
[2025-03-16 21:01:35,327 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:01:33" (1/1) ...
[2025-03-16 21:01:35,364 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:01:33" (1/1) ...
[2025-03-16 21:01:35,405 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:01:33" (1/1) ...
[2025-03-16 21:01:35,607 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-03-16 21:01:35,607 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-03-16 21:01:35,608 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-03-16 21:01:35,608 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-03-16 21:01:35,608 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:01:33" (1/1) ...
[2025-03-16 21:01:35,612 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-16 21:01:35,620 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-16 21:01:35,631 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-16 21:01:35,634 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-16 21:01:35,648 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-03-16 21:01:35,649 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-03-16 21:01:35,649 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-03-16 21:01:35,649 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-03-16 21:01:36,122 INFO  L256             CfgBuilder]: Building ICFG
[2025-03-16 21:01:36,123 INFO  L286             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-03-16 21:01:48,054 INFO  L?                        ?]: Removed 6239 outVars from TransFormulas that were not future-live.
[2025-03-16 21:01:48,055 INFO  L307             CfgBuilder]: Performing block encoding
[2025-03-16 21:01:48,289 INFO  L331             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-03-16 21:01:48,292 INFO  L336             CfgBuilder]: Removed 0 assume(true) statements.
[2025-03-16 21:01:48,292 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 09:01:48 BoogieIcfgContainer
[2025-03-16 21:01:48,293 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-03-16 21:01:48,295 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-03-16 21:01:48,295 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-03-16 21:01:48,298 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-03-16 21:01:48,298 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 09:01:32" (1/3) ...
[2025-03-16 21:01:48,299 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bf7e953 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 09:01:48, skipping insertion in model container
[2025-03-16 21:01:48,299 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:01:33" (2/3) ...
[2025-03-16 21:01:48,300 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bf7e953 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 09:01:48, skipping insertion in model container
[2025-03-16 21:01:48,300 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 09:01:48" (3/3) ...
[2025-03-16 21:01:48,300 INFO  L128   eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.bakery.8.prop1-back-serstep.c
[2025-03-16 21:01:48,315 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-03-16 21:01:48,317 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.bakery.8.prop1-back-serstep.c that has 1 procedures, 3628 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-03-16 21:01:48,403 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-03-16 21:01:48,413 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;@4d17cbff, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-03-16 21:01:48,413 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-03-16 21:01:48,425 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 3628 states, 3626 states have (on average 1.5) internal successors, (5439), 3627 states have internal predecessors, (5439), 0 states have call successors, (0), 0 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-16 21:01:48,441 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 381
[2025-03-16 21:01:48,442 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 21:01:48,442 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 21:01:48,443 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 21:01:48,447 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 21:01:48,448 INFO  L85        PathProgramCache]: Analyzing trace with hash -1847409544, now seen corresponding path program 1 times
[2025-03-16 21:01:48,453 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 21:01:48,453 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3056072]
[2025-03-16 21:01:48,454 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 21:01:48,454 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 21:01:48,597 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 380 statements into 1 equivalence classes.
[2025-03-16 21:01:48,889 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 380 of 380 statements.
[2025-03-16 21:01:48,889 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 21:01:48,889 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 21:01:50,283 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-16 21:01:50,284 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 21:01:50,284 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3056072]
[2025-03-16 21:01:50,285 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3056072] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 21:01:50,285 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 21:01:50,285 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-16 21:01:50,286 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425697017]
[2025-03-16 21:01:50,286 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 21:01:50,289 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-16 21:01:50,289 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 21:01:50,323 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-16 21:01:50,323 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-16 21:01:50,338 INFO  L87              Difference]: Start difference. First operand  has 3628 states, 3626 states have (on average 1.5) internal successors, (5439), 3627 states have internal predecessors, (5439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand  has 4 states, 4 states have (on average 95.0) internal successors, (380), 4 states have internal predecessors, (380), 0 states have call successors, (0), 0 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-16 21:01:51,939 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 21:01:51,940 INFO  L93              Difference]: Finished difference Result 7067 states and 10597 transitions.
[2025-03-16 21:01:51,941 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-16 21:01:51,942 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 95.0) internal successors, (380), 4 states have internal predecessors, (380), 0 states have call successors, (0), 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 380
[2025-03-16 21:01:51,943 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 21:01:51,967 INFO  L225             Difference]: With dead ends: 7067
[2025-03-16 21:01:51,967 INFO  L226             Difference]: Without dead ends: 3628
[2025-03-16 21:01:51,976 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-16 21:01:51,978 INFO  L435           NwaCegarLoop]: 4529 mSDtfsCounter, 0 mSDsluCounter, 9053 mSDsCounter, 0 mSdLazyCounter, 2725 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 13582 SdHoareTripleChecker+Invalid, 2725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time
[2025-03-16 21:01:51,981 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 13582 Invalid, 2725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2725 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time]
[2025-03-16 21:01:51,994 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3628 states.
[2025-03-16 21:01:52,068 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3628 to 3628.
[2025-03-16 21:01:52,074 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3628 states, 3627 states have (on average 1.4993107251171767) internal successors, (5438), 3627 states have internal predecessors, (5438), 0 states have call successors, (0), 0 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-16 21:01:52,086 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3628 states to 3628 states and 5438 transitions.
[2025-03-16 21:01:52,088 INFO  L78                 Accepts]: Start accepts. Automaton has 3628 states and 5438 transitions. Word has length 380
[2025-03-16 21:01:52,090 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 21:01:52,091 INFO  L471      AbstractCegarLoop]: Abstraction has 3628 states and 5438 transitions.
[2025-03-16 21:01:52,091 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 95.0) internal successors, (380), 4 states have internal predecessors, (380), 0 states have call successors, (0), 0 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-16 21:01:52,091 INFO  L276                IsEmpty]: Start isEmpty. Operand 3628 states and 5438 transitions.
[2025-03-16 21:01:52,097 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 382
[2025-03-16 21:01:52,097 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 21:01:52,097 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 21:01:52,098 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2025-03-16 21:01:52,098 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 21:01:52,099 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 21:01:52,099 INFO  L85        PathProgramCache]: Analyzing trace with hash -1430436854, now seen corresponding path program 1 times
[2025-03-16 21:01:52,099 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 21:01:52,099 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901367996]
[2025-03-16 21:01:52,099 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 21:01:52,099 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 21:01:52,187 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 381 statements into 1 equivalence classes.
[2025-03-16 21:01:52,285 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 381 of 381 statements.
[2025-03-16 21:01:52,286 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 21:01:52,286 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 21:01:52,866 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-16 21:01:52,867 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 21:01:52,867 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901367996]
[2025-03-16 21:01:52,867 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901367996] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 21:01:52,868 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 21:01:52,868 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-16 21:01:52,868 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334638787]
[2025-03-16 21:01:52,868 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 21:01:52,869 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-16 21:01:52,870 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 21:01:52,871 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-16 21:01:52,871 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-16 21:01:52,871 INFO  L87              Difference]: Start difference. First operand 3628 states and 5438 transitions. Second operand  has 4 states, 4 states have (on average 95.25) internal successors, (381), 4 states have internal predecessors, (381), 0 states have call successors, (0), 0 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-16 21:01:54,168 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 21:01:54,168 INFO  L93              Difference]: Finished difference Result 7069 states and 10596 transitions.
[2025-03-16 21:01:54,169 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-16 21:01:54,169 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 95.25) internal successors, (381), 4 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 381
[2025-03-16 21:01:54,170 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 21:01:54,181 INFO  L225             Difference]: With dead ends: 7069
[2025-03-16 21:01:54,182 INFO  L226             Difference]: Without dead ends: 3630
[2025-03-16 21:01:54,186 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-16 21:01:54,187 INFO  L435           NwaCegarLoop]: 4529 mSDtfsCounter, 0 mSDsluCounter, 9050 mSDsCounter, 0 mSdLazyCounter, 2728 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 13579 SdHoareTripleChecker+Invalid, 2728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time
[2025-03-16 21:01:54,188 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 13579 Invalid, 2728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2728 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time]
[2025-03-16 21:01:54,193 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3630 states.
[2025-03-16 21:01:54,231 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3630 to 3630.
[2025-03-16 21:01:54,236 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3630 states, 3629 states have (on average 1.4990355469826397) internal successors, (5440), 3629 states have internal predecessors, (5440), 0 states have call successors, (0), 0 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-16 21:01:54,243 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3630 states to 3630 states and 5440 transitions.
[2025-03-16 21:01:54,244 INFO  L78                 Accepts]: Start accepts. Automaton has 3630 states and 5440 transitions. Word has length 381
[2025-03-16 21:01:54,245 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 21:01:54,245 INFO  L471      AbstractCegarLoop]: Abstraction has 3630 states and 5440 transitions.
[2025-03-16 21:01:54,245 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 95.25) internal successors, (381), 4 states have internal predecessors, (381), 0 states have call successors, (0), 0 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-16 21:01:54,245 INFO  L276                IsEmpty]: Start isEmpty. Operand 3630 states and 5440 transitions.
[2025-03-16 21:01:54,249 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 383
[2025-03-16 21:01:54,249 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 21:01:54,249 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 21:01:54,249 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-03-16 21:01:54,249 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 21:01:54,250 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 21:01:54,250 INFO  L85        PathProgramCache]: Analyzing trace with hash 537644723, now seen corresponding path program 1 times
[2025-03-16 21:01:54,251 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 21:01:54,251 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536954264]
[2025-03-16 21:01:54,251 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 21:01:54,251 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 21:01:54,314 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 382 statements into 1 equivalence classes.
[2025-03-16 21:01:54,383 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 382 of 382 statements.
[2025-03-16 21:01:54,384 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 21:01:54,384 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 21:01:54,878 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-16 21:01:54,878 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 21:01:54,878 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536954264]
[2025-03-16 21:01:54,878 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536954264] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 21:01:54,878 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 21:01:54,878 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-16 21:01:54,879 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381231958]
[2025-03-16 21:01:54,879 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 21:01:54,879 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-16 21:01:54,879 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 21:01:54,880 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-16 21:01:54,880 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-16 21:01:54,880 INFO  L87              Difference]: Start difference. First operand 3630 states and 5440 transitions. Second operand  has 4 states, 4 states have (on average 95.5) internal successors, (382), 4 states have internal predecessors, (382), 0 states have call successors, (0), 0 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-16 21:01:56,178 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 21:01:56,178 INFO  L93              Difference]: Finished difference Result 7073 states and 10600 transitions.
[2025-03-16 21:01:56,178 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-16 21:01:56,179 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 95.5) internal successors, (382), 4 states have internal predecessors, (382), 0 states have call successors, (0), 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 382
[2025-03-16 21:01:56,179 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 21:01:56,189 INFO  L225             Difference]: With dead ends: 7073
[2025-03-16 21:01:56,189 INFO  L226             Difference]: Without dead ends: 3632
[2025-03-16 21:01:56,193 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-16 21:01:56,195 INFO  L435           NwaCegarLoop]: 4529 mSDtfsCounter, 0 mSDsluCounter, 9050 mSDsCounter, 0 mSdLazyCounter, 2728 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 13579 SdHoareTripleChecker+Invalid, 2728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time
[2025-03-16 21:01:56,196 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 13579 Invalid, 2728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2728 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time]
[2025-03-16 21:01:56,200 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3632 states.
[2025-03-16 21:01:56,235 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3632 to 3632.
[2025-03-16 21:01:56,239 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3632 states, 3631 states have (on average 1.498760671991187) internal successors, (5442), 3631 states have internal predecessors, (5442), 0 states have call successors, (0), 0 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-16 21:01:56,244 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3632 states to 3632 states and 5442 transitions.
[2025-03-16 21:01:56,245 INFO  L78                 Accepts]: Start accepts. Automaton has 3632 states and 5442 transitions. Word has length 382
[2025-03-16 21:01:56,245 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 21:01:56,245 INFO  L471      AbstractCegarLoop]: Abstraction has 3632 states and 5442 transitions.
[2025-03-16 21:01:56,245 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 95.5) internal successors, (382), 4 states have internal predecessors, (382), 0 states have call successors, (0), 0 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-16 21:01:56,246 INFO  L276                IsEmpty]: Start isEmpty. Operand 3632 states and 5442 transitions.
[2025-03-16 21:01:56,252 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 384
[2025-03-16 21:01:56,252 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 21:01:56,253 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 21:01:56,253 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-03-16 21:01:56,253 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 21:01:56,253 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 21:01:56,253 INFO  L85        PathProgramCache]: Analyzing trace with hash 1375484751, now seen corresponding path program 1 times
[2025-03-16 21:01:56,253 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 21:01:56,253 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803101686]
[2025-03-16 21:01:56,253 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 21:01:56,254 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 21:01:56,306 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 383 statements into 1 equivalence classes.
[2025-03-16 21:01:56,349 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 383 of 383 statements.
[2025-03-16 21:01:56,350 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 21:01:56,350 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 21:01:56,772 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-16 21:01:56,773 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 21:01:56,773 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803101686]
[2025-03-16 21:01:56,773 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803101686] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 21:01:56,773 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 21:01:56,773 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-16 21:01:56,773 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55281501]
[2025-03-16 21:01:56,773 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 21:01:56,774 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-16 21:01:56,774 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 21:01:56,774 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-16 21:01:56,774 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-16 21:01:56,775 INFO  L87              Difference]: Start difference. First operand 3632 states and 5442 transitions. Second operand  has 4 states, 4 states have (on average 95.75) internal successors, (383), 4 states have internal predecessors, (383), 0 states have call successors, (0), 0 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-16 21:01:57,983 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 21:01:57,983 INFO  L93              Difference]: Finished difference Result 7077 states and 10604 transitions.
[2025-03-16 21:01:57,986 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-16 21:01:57,987 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 95.75) internal successors, (383), 4 states have internal predecessors, (383), 0 states have call successors, (0), 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 383
[2025-03-16 21:01:57,987 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 21:01:58,006 INFO  L225             Difference]: With dead ends: 7077
[2025-03-16 21:01:58,007 INFO  L226             Difference]: Without dead ends: 3634
[2025-03-16 21:01:58,009 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-16 21:01:58,011 INFO  L435           NwaCegarLoop]: 4529 mSDtfsCounter, 0 mSDsluCounter, 9050 mSDsCounter, 0 mSdLazyCounter, 2728 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 13579 SdHoareTripleChecker+Invalid, 2728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time
[2025-03-16 21:01:58,011 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 13579 Invalid, 2728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2728 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2025-03-16 21:01:58,016 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3634 states.
[2025-03-16 21:01:58,047 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3634 to 3634.
[2025-03-16 21:01:58,052 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3634 states, 3633 states have (on average 1.498486099642169) internal successors, (5444), 3633 states have internal predecessors, (5444), 0 states have call successors, (0), 0 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-16 21:01:58,058 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3634 states to 3634 states and 5444 transitions.
[2025-03-16 21:01:58,058 INFO  L78                 Accepts]: Start accepts. Automaton has 3634 states and 5444 transitions. Word has length 383
[2025-03-16 21:01:58,059 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 21:01:58,059 INFO  L471      AbstractCegarLoop]: Abstraction has 3634 states and 5444 transitions.
[2025-03-16 21:01:58,059 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 95.75) internal successors, (383), 4 states have internal predecessors, (383), 0 states have call successors, (0), 0 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-16 21:01:58,059 INFO  L276                IsEmpty]: Start isEmpty. Operand 3634 states and 5444 transitions.
[2025-03-16 21:01:58,061 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 385
[2025-03-16 21:01:58,061 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 21:01:58,062 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 21:01:58,062 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-03-16 21:01:58,062 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 21:01:58,062 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 21:01:58,063 INFO  L85        PathProgramCache]: Analyzing trace with hash 390156782, now seen corresponding path program 1 times
[2025-03-16 21:01:58,063 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 21:01:58,063 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700645800]
[2025-03-16 21:01:58,063 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 21:01:58,064 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 21:01:58,194 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 384 statements into 1 equivalence classes.
[2025-03-16 21:01:58,261 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 384 of 384 statements.
[2025-03-16 21:01:58,261 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 21:01:58,261 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 21:01:58,876 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-16 21:01:58,877 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 21:01:58,877 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700645800]
[2025-03-16 21:01:58,877 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700645800] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 21:01:58,878 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 21:01:58,878 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-16 21:01:58,878 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249313608]
[2025-03-16 21:01:58,878 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 21:01:58,878 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-16 21:01:58,878 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 21:01:58,879 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-16 21:01:58,879 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-16 21:01:58,879 INFO  L87              Difference]: Start difference. First operand 3634 states and 5444 transitions. Second operand  has 5 states, 5 states have (on average 76.8) internal successors, (384), 5 states have internal predecessors, (384), 0 states have call successors, (0), 0 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-16 21:02:00,267 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 21:02:00,268 INFO  L93              Difference]: Finished difference Result 7081 states and 10608 transitions.
[2025-03-16 21:02:00,268 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-16 21:02:00,268 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 76.8) internal successors, (384), 5 states have internal predecessors, (384), 0 states have call successors, (0), 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 384
[2025-03-16 21:02:00,269 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 21:02:00,276 INFO  L225             Difference]: With dead ends: 7081
[2025-03-16 21:02:00,277 INFO  L226             Difference]: Without dead ends: 3636
[2025-03-16 21:02:00,284 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-16 21:02:00,285 INFO  L435           NwaCegarLoop]: 4529 mSDtfsCounter, 0 mSDsluCounter, 13574 mSDsCounter, 0 mSdLazyCounter, 3640 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 18103 SdHoareTripleChecker+Invalid, 3641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3640 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time
[2025-03-16 21:02:00,285 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 18103 Invalid, 3641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3640 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time]
[2025-03-16 21:02:00,289 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3636 states.
[2025-03-16 21:02:00,322 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3636 to 3636.
[2025-03-16 21:02:00,327 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3636 states, 3635 states have (on average 1.4982118294360385) internal successors, (5446), 3635 states have internal predecessors, (5446), 0 states have call successors, (0), 0 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-16 21:02:00,331 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3636 states to 3636 states and 5446 transitions.
[2025-03-16 21:02:00,332 INFO  L78                 Accepts]: Start accepts. Automaton has 3636 states and 5446 transitions. Word has length 384
[2025-03-16 21:02:00,332 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 21:02:00,332 INFO  L471      AbstractCegarLoop]: Abstraction has 3636 states and 5446 transitions.
[2025-03-16 21:02:00,332 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 76.8) internal successors, (384), 5 states have internal predecessors, (384), 0 states have call successors, (0), 0 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-16 21:02:00,332 INFO  L276                IsEmpty]: Start isEmpty. Operand 3636 states and 5446 transitions.
[2025-03-16 21:02:00,370 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 386
[2025-03-16 21:02:00,371 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 21:02:00,371 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 21:02:00,371 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-03-16 21:02:00,371 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 21:02:00,372 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 21:02:00,373 INFO  L85        PathProgramCache]: Analyzing trace with hash -921583212, now seen corresponding path program 1 times
[2025-03-16 21:02:00,373 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 21:02:00,373 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851910897]
[2025-03-16 21:02:00,373 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 21:02:00,373 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 21:02:00,428 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 385 statements into 1 equivalence classes.
[2025-03-16 21:02:00,472 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 385 of 385 statements.
[2025-03-16 21:02:00,473 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 21:02:00,473 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 21:02:00,768 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-16 21:02:00,768 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 21:02:00,769 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851910897]
[2025-03-16 21:02:00,769 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851910897] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 21:02:00,769 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 21:02:00,769 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-16 21:02:00,769 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710116803]
[2025-03-16 21:02:00,769 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 21:02:00,769 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-16 21:02:00,770 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 21:02:00,770 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-16 21:02:00,770 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-16 21:02:00,770 INFO  L87              Difference]: Start difference. First operand 3636 states and 5446 transitions. Second operand  has 4 states, 4 states have (on average 96.25) internal successors, (385), 4 states have internal predecessors, (385), 0 states have call successors, (0), 0 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-16 21:02:01,784 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 21:02:01,784 INFO  L93              Difference]: Finished difference Result 7085 states and 10612 transitions.
[2025-03-16 21:02:01,785 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-16 21:02:01,785 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 96.25) internal successors, (385), 4 states have internal predecessors, (385), 0 states have call successors, (0), 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 385
[2025-03-16 21:02:01,785 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 21:02:01,792 INFO  L225             Difference]: With dead ends: 7085
[2025-03-16 21:02:01,793 INFO  L226             Difference]: Without dead ends: 3638
[2025-03-16 21:02:01,795 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-16 21:02:01,796 INFO  L435           NwaCegarLoop]: 4529 mSDtfsCounter, 0 mSDsluCounter, 9050 mSDsCounter, 0 mSdLazyCounter, 2728 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 13579 SdHoareTripleChecker+Invalid, 2728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time
[2025-03-16 21:02:01,796 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 13579 Invalid, 2728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2728 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time]
[2025-03-16 21:02:01,799 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3638 states.
[2025-03-16 21:02:01,834 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3638 to 3638.
[2025-03-16 21:02:01,841 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3638 states, 3637 states have (on average 1.497937860874347) internal successors, (5448), 3637 states have internal predecessors, (5448), 0 states have call successors, (0), 0 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-16 21:02:01,847 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3638 states to 3638 states and 5448 transitions.
[2025-03-16 21:02:01,849 INFO  L78                 Accepts]: Start accepts. Automaton has 3638 states and 5448 transitions. Word has length 385
[2025-03-16 21:02:01,850 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 21:02:01,850 INFO  L471      AbstractCegarLoop]: Abstraction has 3638 states and 5448 transitions.
[2025-03-16 21:02:01,850 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 96.25) internal successors, (385), 4 states have internal predecessors, (385), 0 states have call successors, (0), 0 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-16 21:02:01,853 INFO  L276                IsEmpty]: Start isEmpty. Operand 3638 states and 5448 transitions.
[2025-03-16 21:02:01,855 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 387
[2025-03-16 21:02:01,855 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 21:02:01,856 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 21:02:01,856 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-03-16 21:02:01,856 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 21:02:01,856 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 21:02:01,858 INFO  L85        PathProgramCache]: Analyzing trace with hash -424329687, now seen corresponding path program 1 times
[2025-03-16 21:02:01,858 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 21:02:01,858 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364820855]
[2025-03-16 21:02:01,858 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 21:02:01,858 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 21:02:01,911 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 386 statements into 1 equivalence classes.
[2025-03-16 21:02:01,965 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 386 of 386 statements.
[2025-03-16 21:02:01,965 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 21:02:01,965 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 21:02:02,272 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-16 21:02:02,273 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 21:02:02,273 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364820855]
[2025-03-16 21:02:02,273 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364820855] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 21:02:02,273 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 21:02:02,273 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-16 21:02:02,273 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911995512]
[2025-03-16 21:02:02,273 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 21:02:02,274 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-16 21:02:02,274 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 21:02:02,274 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-16 21:02:02,274 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-16 21:02:02,275 INFO  L87              Difference]: Start difference. First operand 3638 states and 5448 transitions. Second operand  has 4 states, 4 states have (on average 96.5) internal successors, (386), 4 states have internal predecessors, (386), 0 states have call successors, (0), 0 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-16 21:02:03,263 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 21:02:03,263 INFO  L93              Difference]: Finished difference Result 7089 states and 10616 transitions.
[2025-03-16 21:02:03,263 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-16 21:02:03,263 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 96.5) internal successors, (386), 4 states have internal predecessors, (386), 0 states have call successors, (0), 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 386
[2025-03-16 21:02:03,264 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 21:02:03,271 INFO  L225             Difference]: With dead ends: 7089
[2025-03-16 21:02:03,271 INFO  L226             Difference]: Without dead ends: 3640
[2025-03-16 21:02:03,274 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-16 21:02:03,274 INFO  L435           NwaCegarLoop]: 4529 mSDtfsCounter, 0 mSDsluCounter, 9050 mSDsCounter, 0 mSdLazyCounter, 2728 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 13579 SdHoareTripleChecker+Invalid, 2728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time
[2025-03-16 21:02:03,274 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 13579 Invalid, 2728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2728 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2025-03-16 21:02:03,277 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3640 states.
[2025-03-16 21:02:03,301 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3640 to 3640.
[2025-03-16 21:02:03,304 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3640 states, 3639 states have (on average 1.4976641934597417) internal successors, (5450), 3639 states have internal predecessors, (5450), 0 states have call successors, (0), 0 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-16 21:02:03,308 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3640 states to 3640 states and 5450 transitions.
[2025-03-16 21:02:03,308 INFO  L78                 Accepts]: Start accepts. Automaton has 3640 states and 5450 transitions. Word has length 386
[2025-03-16 21:02:03,308 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 21:02:03,308 INFO  L471      AbstractCegarLoop]: Abstraction has 3640 states and 5450 transitions.
[2025-03-16 21:02:03,309 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 96.5) internal successors, (386), 4 states have internal predecessors, (386), 0 states have call successors, (0), 0 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-16 21:02:03,309 INFO  L276                IsEmpty]: Start isEmpty. Operand 3640 states and 5450 transitions.
[2025-03-16 21:02:03,310 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 388
[2025-03-16 21:02:03,310 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 21:02:03,311 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 21:02:03,311 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-03-16 21:02:03,311 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 21:02:03,311 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 21:02:03,311 INFO  L85        PathProgramCache]: Analyzing trace with hash 578545369, now seen corresponding path program 1 times
[2025-03-16 21:02:03,311 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 21:02:03,312 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968678008]
[2025-03-16 21:02:03,312 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 21:02:03,312 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 21:02:03,358 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 387 statements into 1 equivalence classes.
[2025-03-16 21:02:03,396 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 387 of 387 statements.
[2025-03-16 21:02:03,397 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 21:02:03,397 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 21:02:03,806 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-16 21:02:03,807 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 21:02:03,807 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968678008]
[2025-03-16 21:02:03,807 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968678008] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 21:02:03,807 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 21:02:03,807 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-16 21:02:03,807 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435769660]
[2025-03-16 21:02:03,807 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 21:02:03,808 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-16 21:02:03,808 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 21:02:03,808 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-16 21:02:03,808 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-16 21:02:03,809 INFO  L87              Difference]: Start difference. First operand 3640 states and 5450 transitions. Second operand  has 5 states, 5 states have (on average 77.4) internal successors, (387), 5 states have internal predecessors, (387), 0 states have call successors, (0), 0 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-16 21:02:04,989 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 21:02:04,990 INFO  L93              Difference]: Finished difference Result 7093 states and 10620 transitions.
[2025-03-16 21:02:04,990 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-16 21:02:04,990 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 77.4) internal successors, (387), 5 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 387
[2025-03-16 21:02:04,991 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 21:02:04,997 INFO  L225             Difference]: With dead ends: 7093
[2025-03-16 21:02:04,998 INFO  L226             Difference]: Without dead ends: 3642
[2025-03-16 21:02:05,001 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-16 21:02:05,002 INFO  L435           NwaCegarLoop]: 4529 mSDtfsCounter, 0 mSDsluCounter, 9050 mSDsCounter, 0 mSdLazyCounter, 2729 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 13579 SdHoareTripleChecker+Invalid, 2730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2729 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time
[2025-03-16 21:02:05,002 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 13579 Invalid, 2730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2729 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2025-03-16 21:02:05,005 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3642 states.
[2025-03-16 21:02:05,031 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3642 to 3642.
[2025-03-16 21:02:05,035 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3642 states, 3641 states have (on average 1.4973908266959626) internal successors, (5452), 3641 states have internal predecessors, (5452), 0 states have call successors, (0), 0 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-16 21:02:05,038 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3642 states to 3642 states and 5452 transitions.
[2025-03-16 21:02:05,038 INFO  L78                 Accepts]: Start accepts. Automaton has 3642 states and 5452 transitions. Word has length 387
[2025-03-16 21:02:05,038 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 21:02:05,038 INFO  L471      AbstractCegarLoop]: Abstraction has 3642 states and 5452 transitions.
[2025-03-16 21:02:05,039 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 77.4) internal successors, (387), 5 states have internal predecessors, (387), 0 states have call successors, (0), 0 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-16 21:02:05,039 INFO  L276                IsEmpty]: Start isEmpty. Operand 3642 states and 5452 transitions.
[2025-03-16 21:02:05,041 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 389
[2025-03-16 21:02:05,041 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 21:02:05,041 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 21:02:05,041 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-03-16 21:02:05,041 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 21:02:05,042 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 21:02:05,043 INFO  L85        PathProgramCache]: Analyzing trace with hash 586777444, now seen corresponding path program 1 times
[2025-03-16 21:02:05,044 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 21:02:05,044 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069299246]
[2025-03-16 21:02:05,044 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 21:02:05,044 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 21:02:05,094 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 388 statements into 1 equivalence classes.
[2025-03-16 21:02:05,138 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 388 of 388 statements.
[2025-03-16 21:02:05,139 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 21:02:05,139 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 21:02:05,515 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-16 21:02:05,516 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 21:02:05,516 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069299246]
[2025-03-16 21:02:05,516 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069299246] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 21:02:05,516 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 21:02:05,516 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-16 21:02:05,516 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745972043]
[2025-03-16 21:02:05,516 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 21:02:05,517 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-16 21:02:05,517 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 21:02:05,517 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-16 21:02:05,518 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-16 21:02:05,518 INFO  L87              Difference]: Start difference. First operand 3642 states and 5452 transitions. Second operand  has 5 states, 5 states have (on average 77.6) internal successors, (388), 5 states have internal predecessors, (388), 0 states have call successors, (0), 0 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-16 21:02:06,800 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 21:02:06,800 INFO  L93              Difference]: Finished difference Result 7097 states and 10624 transitions.
[2025-03-16 21:02:06,800 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-16 21:02:06,800 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 77.6) internal successors, (388), 5 states have internal predecessors, (388), 0 states have call successors, (0), 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 388
[2025-03-16 21:02:06,801 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 21:02:06,806 INFO  L225             Difference]: With dead ends: 7097
[2025-03-16 21:02:06,806 INFO  L226             Difference]: Without dead ends: 3644
[2025-03-16 21:02:06,808 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-16 21:02:06,809 INFO  L435           NwaCegarLoop]: 4529 mSDtfsCounter, 0 mSDsluCounter, 13574 mSDsCounter, 0 mSdLazyCounter, 3640 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 18103 SdHoareTripleChecker+Invalid, 3641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3640 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time
[2025-03-16 21:02:06,809 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 18103 Invalid, 3641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3640 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time]
[2025-03-16 21:02:06,812 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3644 states.
[2025-03-16 21:02:06,834 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3644 to 3644.
[2025-03-16 21:02:06,837 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3644 states, 3643 states have (on average 1.4971177600878396) internal successors, (5454), 3643 states have internal predecessors, (5454), 0 states have call successors, (0), 0 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-16 21:02:06,840 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3644 states to 3644 states and 5454 transitions.
[2025-03-16 21:02:06,840 INFO  L78                 Accepts]: Start accepts. Automaton has 3644 states and 5454 transitions. Word has length 388
[2025-03-16 21:02:06,840 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 21:02:06,840 INFO  L471      AbstractCegarLoop]: Abstraction has 3644 states and 5454 transitions.
[2025-03-16 21:02:06,841 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 77.6) internal successors, (388), 5 states have internal predecessors, (388), 0 states have call successors, (0), 0 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-16 21:02:06,841 INFO  L276                IsEmpty]: Start isEmpty. Operand 3644 states and 5454 transitions.
[2025-03-16 21:02:06,842 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 390
[2025-03-16 21:02:06,843 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 21:02:06,843 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 21:02:06,843 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-03-16 21:02:06,843 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 21:02:06,843 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 21:02:06,844 INFO  L85        PathProgramCache]: Analyzing trace with hash 433634078, now seen corresponding path program 1 times
[2025-03-16 21:02:06,844 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 21:02:06,844 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331284555]
[2025-03-16 21:02:06,844 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 21:02:06,844 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 21:02:06,892 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 389 statements into 1 equivalence classes.
[2025-03-16 21:02:06,927 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 389 of 389 statements.
[2025-03-16 21:02:06,927 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 21:02:06,927 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 21:02:07,233 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-16 21:02:07,233 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 21:02:07,234 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331284555]
[2025-03-16 21:02:07,234 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331284555] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 21:02:07,234 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 21:02:07,234 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-16 21:02:07,234 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486824855]
[2025-03-16 21:02:07,234 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 21:02:07,234 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-16 21:02:07,234 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 21:02:07,235 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-16 21:02:07,235 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-16 21:02:07,235 INFO  L87              Difference]: Start difference. First operand 3644 states and 5454 transitions. Second operand  has 4 states, 4 states have (on average 97.25) internal successors, (389), 4 states have internal predecessors, (389), 0 states have call successors, (0), 0 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-16 21:02:08,206 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 21:02:08,206 INFO  L93              Difference]: Finished difference Result 7101 states and 10628 transitions.
[2025-03-16 21:02:08,206 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-16 21:02:08,206 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 97.25) internal successors, (389), 4 states have internal predecessors, (389), 0 states have call successors, (0), 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 389
[2025-03-16 21:02:08,207 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 21:02:08,211 INFO  L225             Difference]: With dead ends: 7101
[2025-03-16 21:02:08,211 INFO  L226             Difference]: Without dead ends: 3646
[2025-03-16 21:02:08,214 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-16 21:02:08,214 INFO  L435           NwaCegarLoop]: 4529 mSDtfsCounter, 0 mSDsluCounter, 9050 mSDsCounter, 0 mSdLazyCounter, 2728 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 13579 SdHoareTripleChecker+Invalid, 2728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time
[2025-03-16 21:02:08,215 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 13579 Invalid, 2728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2728 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2025-03-16 21:02:08,217 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3646 states.
[2025-03-16 21:02:08,236 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3646 to 3646.
[2025-03-16 21:02:08,239 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3646 states, 3645 states have (on average 1.4968449931412895) internal successors, (5456), 3645 states have internal predecessors, (5456), 0 states have call successors, (0), 0 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-16 21:02:08,242 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3646 states to 3646 states and 5456 transitions.
[2025-03-16 21:02:08,242 INFO  L78                 Accepts]: Start accepts. Automaton has 3646 states and 5456 transitions. Word has length 389
[2025-03-16 21:02:08,243 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 21:02:08,243 INFO  L471      AbstractCegarLoop]: Abstraction has 3646 states and 5456 transitions.
[2025-03-16 21:02:08,243 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 97.25) internal successors, (389), 4 states have internal predecessors, (389), 0 states have call successors, (0), 0 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-16 21:02:08,243 INFO  L276                IsEmpty]: Start isEmpty. Operand 3646 states and 5456 transitions.
[2025-03-16 21:02:08,245 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 391
[2025-03-16 21:02:08,245 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 21:02:08,245 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 21:02:08,245 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-03-16 21:02:08,245 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 21:02:08,245 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 21:02:08,246 INFO  L85        PathProgramCache]: Analyzing trace with hash -1459613281, now seen corresponding path program 1 times
[2025-03-16 21:02:08,246 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 21:02:08,246 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005568174]
[2025-03-16 21:02:08,246 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 21:02:08,246 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 21:02:08,295 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 390 statements into 1 equivalence classes.
[2025-03-16 21:02:08,338 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 390 of 390 statements.
[2025-03-16 21:02:08,338 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 21:02:08,338 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 21:02:08,595 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-16 21:02:08,595 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 21:02:08,595 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005568174]
[2025-03-16 21:02:08,596 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005568174] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 21:02:08,596 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 21:02:08,596 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-16 21:02:08,596 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421347616]
[2025-03-16 21:02:08,596 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 21:02:08,596 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-16 21:02:08,596 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 21:02:08,597 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-16 21:02:08,597 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-16 21:02:08,597 INFO  L87              Difference]: Start difference. First operand 3646 states and 5456 transitions. Second operand  has 4 states, 4 states have (on average 97.5) internal successors, (390), 4 states have internal predecessors, (390), 0 states have call successors, (0), 0 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-16 21:02:09,849 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 21:02:09,850 INFO  L93              Difference]: Finished difference Result 7105 states and 10632 transitions.
[2025-03-16 21:02:09,850 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-16 21:02:09,851 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 97.5) internal successors, (390), 4 states have internal predecessors, (390), 0 states have call successors, (0), 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 390
[2025-03-16 21:02:09,851 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 21:02:09,856 INFO  L225             Difference]: With dead ends: 7105
[2025-03-16 21:02:09,856 INFO  L226             Difference]: Without dead ends: 3648
[2025-03-16 21:02:09,859 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-16 21:02:09,860 INFO  L435           NwaCegarLoop]: 4529 mSDtfsCounter, 0 mSDsluCounter, 9050 mSDsCounter, 0 mSdLazyCounter, 2728 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 13579 SdHoareTripleChecker+Invalid, 2728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time
[2025-03-16 21:02:09,860 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 13579 Invalid, 2728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2728 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time]
[2025-03-16 21:02:09,864 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3648 states.
[2025-03-16 21:02:09,894 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3648 to 3648.
[2025-03-16 21:02:09,897 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3648 states, 3647 states have (on average 1.4965725253633122) internal successors, (5458), 3647 states have internal predecessors, (5458), 0 states have call successors, (0), 0 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-16 21:02:09,901 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3648 states to 3648 states and 5458 transitions.
[2025-03-16 21:02:09,902 INFO  L78                 Accepts]: Start accepts. Automaton has 3648 states and 5458 transitions. Word has length 390
[2025-03-16 21:02:09,902 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 21:02:09,902 INFO  L471      AbstractCegarLoop]: Abstraction has 3648 states and 5458 transitions.
[2025-03-16 21:02:09,902 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 97.5) internal successors, (390), 4 states have internal predecessors, (390), 0 states have call successors, (0), 0 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-16 21:02:09,903 INFO  L276                IsEmpty]: Start isEmpty. Operand 3648 states and 5458 transitions.
[2025-03-16 21:02:09,905 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 392
[2025-03-16 21:02:09,905 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 21:02:09,906 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 21:02:09,906 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-03-16 21:02:09,906 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 21:02:09,906 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 21:02:09,907 INFO  L85        PathProgramCache]: Analyzing trace with hash 1894141539, now seen corresponding path program 1 times
[2025-03-16 21:02:09,907 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 21:02:09,907 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359576609]
[2025-03-16 21:02:09,907 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 21:02:09,907 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 21:02:09,961 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 391 statements into 1 equivalence classes.
[2025-03-16 21:02:09,996 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 391 of 391 statements.
[2025-03-16 21:02:09,996 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 21:02:09,996 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 21:02:10,250 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-16 21:02:10,250 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 21:02:10,250 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359576609]
[2025-03-16 21:02:10,251 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359576609] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 21:02:10,251 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 21:02:10,251 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-16 21:02:10,251 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289119751]
[2025-03-16 21:02:10,251 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 21:02:10,251 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-16 21:02:10,251 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 21:02:10,252 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-16 21:02:10,252 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-16 21:02:10,253 INFO  L87              Difference]: Start difference. First operand 3648 states and 5458 transitions. Second operand  has 4 states, 4 states have (on average 97.75) internal successors, (391), 4 states have internal predecessors, (391), 0 states have call successors, (0), 0 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-16 21:02:11,218 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 21:02:11,218 INFO  L93              Difference]: Finished difference Result 7109 states and 10636 transitions.
[2025-03-16 21:02:11,219 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-16 21:02:11,219 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 97.75) internal successors, (391), 4 states have internal predecessors, (391), 0 states have call successors, (0), 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 391
[2025-03-16 21:02:11,219 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 21:02:11,223 INFO  L225             Difference]: With dead ends: 7109
[2025-03-16 21:02:11,223 INFO  L226             Difference]: Without dead ends: 3650
[2025-03-16 21:02:11,225 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-16 21:02:11,225 INFO  L435           NwaCegarLoop]: 4529 mSDtfsCounter, 0 mSDsluCounter, 9050 mSDsCounter, 0 mSdLazyCounter, 2728 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 13579 SdHoareTripleChecker+Invalid, 2728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time
[2025-03-16 21:02:11,225 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 13579 Invalid, 2728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2728 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2025-03-16 21:02:11,228 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3650 states.
[2025-03-16 21:02:11,246 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3650 to 3650.
[2025-03-16 21:02:11,249 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3650 states, 3649 states have (on average 1.4963003562619897) internal successors, (5460), 3649 states have internal predecessors, (5460), 0 states have call successors, (0), 0 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-16 21:02:11,251 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3650 states to 3650 states and 5460 transitions.
[2025-03-16 21:02:11,251 INFO  L78                 Accepts]: Start accepts. Automaton has 3650 states and 5460 transitions. Word has length 391
[2025-03-16 21:02:11,252 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 21:02:11,252 INFO  L471      AbstractCegarLoop]: Abstraction has 3650 states and 5460 transitions.
[2025-03-16 21:02:11,252 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 97.75) internal successors, (391), 4 states have internal predecessors, (391), 0 states have call successors, (0), 0 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-16 21:02:11,252 INFO  L276                IsEmpty]: Start isEmpty. Operand 3650 states and 5460 transitions.
[2025-03-16 21:02:11,253 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 393
[2025-03-16 21:02:11,254 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 21:02:11,254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 21:02:11,254 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2025-03-16 21:02:11,254 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 21:02:11,254 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 21:02:11,255 INFO  L85        PathProgramCache]: Analyzing trace with hash -1055205158, now seen corresponding path program 1 times
[2025-03-16 21:02:11,255 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 21:02:11,255 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123778793]
[2025-03-16 21:02:11,255 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 21:02:11,255 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 21:02:11,303 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 392 statements into 1 equivalence classes.
[2025-03-16 21:02:11,337 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 392 of 392 statements.
[2025-03-16 21:02:11,338 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 21:02:11,338 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 21:02:11,604 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-16 21:02:11,604 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 21:02:11,604 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123778793]
[2025-03-16 21:02:11,604 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123778793] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 21:02:11,604 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 21:02:11,604 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-16 21:02:11,604 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585274982]
[2025-03-16 21:02:11,604 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 21:02:11,605 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-16 21:02:11,605 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 21:02:11,605 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-16 21:02:11,605 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-16 21:02:11,605 INFO  L87              Difference]: Start difference. First operand 3650 states and 5460 transitions. Second operand  has 5 states, 5 states have (on average 78.4) internal successors, (392), 5 states have internal predecessors, (392), 0 states have call successors, (0), 0 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-16 21:02:12,639 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 21:02:12,639 INFO  L93              Difference]: Finished difference Result 7113 states and 10640 transitions.
[2025-03-16 21:02:12,639 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-16 21:02:12,639 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 78.4) internal successors, (392), 5 states have internal predecessors, (392), 0 states have call successors, (0), 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 392
[2025-03-16 21:02:12,639 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 21:02:12,642 INFO  L225             Difference]: With dead ends: 7113
[2025-03-16 21:02:12,642 INFO  L226             Difference]: Without dead ends: 3652
[2025-03-16 21:02:12,644 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-16 21:02:12,645 INFO  L435           NwaCegarLoop]: 4529 mSDtfsCounter, 0 mSDsluCounter, 9050 mSDsCounter, 0 mSdLazyCounter, 2729 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 13579 SdHoareTripleChecker+Invalid, 2730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2729 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time
[2025-03-16 21:02:12,645 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 13579 Invalid, 2730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2729 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time]
[2025-03-16 21:02:12,648 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3652 states.
[2025-03-16 21:02:12,669 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3652 to 3652.
[2025-03-16 21:02:12,672 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3652 states, 3651 states have (on average 1.4960284853464805) internal successors, (5462), 3651 states have internal predecessors, (5462), 0 states have call successors, (0), 0 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-16 21:02:12,675 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3652 states to 3652 states and 5462 transitions.
[2025-03-16 21:02:12,676 INFO  L78                 Accepts]: Start accepts. Automaton has 3652 states and 5462 transitions. Word has length 392
[2025-03-16 21:02:12,676 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 21:02:12,676 INFO  L471      AbstractCegarLoop]: Abstraction has 3652 states and 5462 transitions.
[2025-03-16 21:02:12,676 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 78.4) internal successors, (392), 5 states have internal predecessors, (392), 0 states have call successors, (0), 0 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-16 21:02:12,676 INFO  L276                IsEmpty]: Start isEmpty. Operand 3652 states and 5462 transitions.
[2025-03-16 21:02:12,678 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 394
[2025-03-16 21:02:12,678 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 21:02:12,678 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 21:02:12,678 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2025-03-16 21:02:12,679 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 21:02:12,679 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 21:02:12,679 INFO  L85        PathProgramCache]: Analyzing trace with hash 1283633320, now seen corresponding path program 1 times
[2025-03-16 21:02:12,679 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 21:02:12,679 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554701429]
[2025-03-16 21:02:12,679 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 21:02:12,679 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 21:02:12,728 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 393 statements into 1 equivalence classes.
[2025-03-16 21:02:12,777 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 393 of 393 statements.
[2025-03-16 21:02:12,778 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 21:02:12,778 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 21:02:13,024 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-16 21:02:13,024 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 21:02:13,024 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554701429]
[2025-03-16 21:02:13,024 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554701429] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 21:02:13,024 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 21:02:13,024 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-16 21:02:13,024 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51997740]
[2025-03-16 21:02:13,024 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 21:02:13,025 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-16 21:02:13,025 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 21:02:13,025 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-16 21:02:13,025 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-16 21:02:13,025 INFO  L87              Difference]: Start difference. First operand 3652 states and 5462 transitions. Second operand  has 4 states, 4 states have (on average 98.25) internal successors, (393), 4 states have internal predecessors, (393), 0 states have call successors, (0), 0 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-16 21:02:13,960 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 21:02:13,960 INFO  L93              Difference]: Finished difference Result 7117 states and 10644 transitions.
[2025-03-16 21:02:13,961 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-16 21:02:13,961 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 98.25) internal successors, (393), 4 states have internal predecessors, (393), 0 states have call successors, (0), 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 393
[2025-03-16 21:02:13,961 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 21:02:13,964 INFO  L225             Difference]: With dead ends: 7117
[2025-03-16 21:02:13,964 INFO  L226             Difference]: Without dead ends: 3654
[2025-03-16 21:02:13,966 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-16 21:02:13,967 INFO  L435           NwaCegarLoop]: 4529 mSDtfsCounter, 0 mSDsluCounter, 9050 mSDsCounter, 0 mSdLazyCounter, 2728 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 13579 SdHoareTripleChecker+Invalid, 2728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time
[2025-03-16 21:02:13,967 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 13579 Invalid, 2728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2728 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2025-03-16 21:02:13,971 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3654 states.
[2025-03-16 21:02:14,039 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3654 to 3654.
[2025-03-16 21:02:14,042 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3654 states, 3653 states have (on average 1.495756912127019) internal successors, (5464), 3653 states have internal predecessors, (5464), 0 states have call successors, (0), 0 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-16 21:02:14,046 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3654 states to 3654 states and 5464 transitions.
[2025-03-16 21:02:14,047 INFO  L78                 Accepts]: Start accepts. Automaton has 3654 states and 5464 transitions. Word has length 393
[2025-03-16 21:02:14,047 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 21:02:14,047 INFO  L471      AbstractCegarLoop]: Abstraction has 3654 states and 5464 transitions.
[2025-03-16 21:02:14,047 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 98.25) internal successors, (393), 4 states have internal predecessors, (393), 0 states have call successors, (0), 0 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-16 21:02:14,048 INFO  L276                IsEmpty]: Start isEmpty. Operand 3654 states and 5464 transitions.
[2025-03-16 21:02:14,049 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 395
[2025-03-16 21:02:14,049 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 21:02:14,050 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 21:02:14,050 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2025-03-16 21:02:14,050 INFO  L396      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 21:02:14,050 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 21:02:14,051 INFO  L85        PathProgramCache]: Analyzing trace with hash 1107020053, now seen corresponding path program 1 times
[2025-03-16 21:02:14,051 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 21:02:14,051 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472288814]
[2025-03-16 21:02:14,051 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 21:02:14,051 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 21:02:14,121 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 394 statements into 1 equivalence classes.
[2025-03-16 21:02:14,162 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 394 of 394 statements.
[2025-03-16 21:02:14,162 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 21:02:14,162 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 21:02:14,677 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-16 21:02:14,677 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 21:02:14,677 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472288814]
[2025-03-16 21:02:14,677 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472288814] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 21:02:14,677 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 21:02:14,677 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-16 21:02:14,677 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449027163]
[2025-03-16 21:02:14,677 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 21:02:14,678 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-16 21:02:14,678 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 21:02:14,678 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-16 21:02:14,678 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-16 21:02:14,684 INFO  L87              Difference]: Start difference. First operand 3654 states and 5464 transitions. Second operand  has 4 states, 4 states have (on average 98.5) internal successors, (394), 4 states have internal predecessors, (394), 0 states have call successors, (0), 0 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-16 21:02:15,654 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 21:02:15,655 INFO  L93              Difference]: Finished difference Result 7121 states and 10648 transitions.
[2025-03-16 21:02:15,655 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-16 21:02:15,655 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 98.5) internal successors, (394), 4 states have internal predecessors, (394), 0 states have call successors, (0), 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 394
[2025-03-16 21:02:15,655 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 21:02:15,658 INFO  L225             Difference]: With dead ends: 7121
[2025-03-16 21:02:15,658 INFO  L226             Difference]: Without dead ends: 3656
[2025-03-16 21:02:15,660 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-16 21:02:15,660 INFO  L435           NwaCegarLoop]: 4529 mSDtfsCounter, 0 mSDsluCounter, 9050 mSDsCounter, 0 mSdLazyCounter, 2728 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 13579 SdHoareTripleChecker+Invalid, 2728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time
[2025-03-16 21:02:15,661 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 13579 Invalid, 2728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2728 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2025-03-16 21:02:15,663 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3656 states.
[2025-03-16 21:02:15,679 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3656 to 3656.
[2025-03-16 21:02:15,681 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3656 states, 3655 states have (on average 1.4954856361149111) internal successors, (5466), 3655 states have internal predecessors, (5466), 0 states have call successors, (0), 0 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-16 21:02:15,683 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3656 states to 3656 states and 5466 transitions.
[2025-03-16 21:02:15,683 INFO  L78                 Accepts]: Start accepts. Automaton has 3656 states and 5466 transitions. Word has length 394
[2025-03-16 21:02:15,683 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 21:02:15,683 INFO  L471      AbstractCegarLoop]: Abstraction has 3656 states and 5466 transitions.
[2025-03-16 21:02:15,683 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 98.5) internal successors, (394), 4 states have internal predecessors, (394), 0 states have call successors, (0), 0 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-16 21:02:15,684 INFO  L276                IsEmpty]: Start isEmpty. Operand 3656 states and 5466 transitions.
[2025-03-16 21:02:15,685 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 396
[2025-03-16 21:02:15,685 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 21:02:15,685 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 21:02:15,685 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2025-03-16 21:02:15,685 INFO  L396      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 21:02:15,686 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 21:02:15,686 INFO  L85        PathProgramCache]: Analyzing trace with hash -1851002387, now seen corresponding path program 1 times
[2025-03-16 21:02:15,686 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 21:02:15,686 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745506666]
[2025-03-16 21:02:15,686 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 21:02:15,686 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 21:02:15,731 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 395 statements into 1 equivalence classes.
[2025-03-16 21:02:15,814 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 395 of 395 statements.
[2025-03-16 21:02:15,815 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 21:02:15,815 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 21:02:16,069 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-16 21:02:16,069 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 21:02:16,069 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745506666]
[2025-03-16 21:02:16,069 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745506666] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 21:02:16,069 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 21:02:16,069 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-16 21:02:16,069 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144489881]
[2025-03-16 21:02:16,069 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 21:02:16,070 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-16 21:02:16,070 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 21:02:16,070 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-16 21:02:16,070 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-16 21:02:16,071 INFO  L87              Difference]: Start difference. First operand 3656 states and 5466 transitions. Second operand  has 5 states, 5 states have (on average 79.0) internal successors, (395), 5 states have internal predecessors, (395), 0 states have call successors, (0), 0 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-16 21:02:17,226 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 21:02:17,226 INFO  L93              Difference]: Finished difference Result 7125 states and 10652 transitions.
[2025-03-16 21:02:17,226 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-16 21:02:17,227 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 79.0) internal successors, (395), 5 states have internal predecessors, (395), 0 states have call successors, (0), 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 395
[2025-03-16 21:02:17,227 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 21:02:17,229 INFO  L225             Difference]: With dead ends: 7125
[2025-03-16 21:02:17,229 INFO  L226             Difference]: Without dead ends: 3658
[2025-03-16 21:02:17,232 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-16 21:02:17,233 INFO  L435           NwaCegarLoop]: 4529 mSDtfsCounter, 0 mSDsluCounter, 13574 mSDsCounter, 0 mSdLazyCounter, 3640 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 18103 SdHoareTripleChecker+Invalid, 3641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3640 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time
[2025-03-16 21:02:17,233 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 18103 Invalid, 3641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3640 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2025-03-16 21:02:17,236 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3658 states.
[2025-03-16 21:02:17,261 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3658 to 3658.
[2025-03-16 21:02:17,264 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3658 states, 3657 states have (on average 1.4952146568225322) internal successors, (5468), 3657 states have internal predecessors, (5468), 0 states have call successors, (0), 0 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-16 21:02:17,267 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3658 states to 3658 states and 5468 transitions.
[2025-03-16 21:02:17,267 INFO  L78                 Accepts]: Start accepts. Automaton has 3658 states and 5468 transitions. Word has length 395
[2025-03-16 21:02:17,267 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 21:02:17,267 INFO  L471      AbstractCegarLoop]: Abstraction has 3658 states and 5468 transitions.
[2025-03-16 21:02:17,267 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 79.0) internal successors, (395), 5 states have internal predecessors, (395), 0 states have call successors, (0), 0 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-16 21:02:17,268 INFO  L276                IsEmpty]: Start isEmpty. Operand 3658 states and 5468 transitions.
[2025-03-16 21:02:17,269 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 397
[2025-03-16 21:02:17,269 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 21:02:17,269 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 21:02:17,269 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2025-03-16 21:02:17,269 INFO  L396      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 21:02:17,270 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 21:02:17,271 INFO  L85        PathProgramCache]: Analyzing trace with hash -1279995312, now seen corresponding path program 1 times
[2025-03-16 21:02:17,271 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 21:02:17,271 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66433197]
[2025-03-16 21:02:17,271 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 21:02:17,271 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 21:02:17,366 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 396 statements into 1 equivalence classes.
[2025-03-16 21:02:17,407 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 396 of 396 statements.
[2025-03-16 21:02:17,407 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 21:02:17,407 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 21:02:17,685 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-16 21:02:17,685 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 21:02:17,685 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66433197]
[2025-03-16 21:02:17,685 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66433197] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 21:02:17,685 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 21:02:17,685 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-16 21:02:17,685 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883237145]
[2025-03-16 21:02:17,685 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 21:02:17,686 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-16 21:02:17,686 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 21:02:17,686 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-16 21:02:17,686 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-16 21:02:17,686 INFO  L87              Difference]: Start difference. First operand 3658 states and 5468 transitions. Second operand  has 5 states, 5 states have (on average 79.2) internal successors, (396), 5 states have internal predecessors, (396), 0 states have call successors, (0), 0 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-16 21:02:18,671 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 21:02:18,671 INFO  L93              Difference]: Finished difference Result 7129 states and 10656 transitions.
[2025-03-16 21:02:18,671 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-16 21:02:18,671 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 79.2) internal successors, (396), 5 states have internal predecessors, (396), 0 states have call successors, (0), 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 396
[2025-03-16 21:02:18,672 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 21:02:18,674 INFO  L225             Difference]: With dead ends: 7129
[2025-03-16 21:02:18,674 INFO  L226             Difference]: Without dead ends: 3660
[2025-03-16 21:02:18,677 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-16 21:02:18,678 INFO  L435           NwaCegarLoop]: 4529 mSDtfsCounter, 0 mSDsluCounter, 9050 mSDsCounter, 0 mSdLazyCounter, 2729 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 13579 SdHoareTripleChecker+Invalid, 2730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2729 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time
[2025-03-16 21:02:18,678 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 13579 Invalid, 2730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2729 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2025-03-16 21:02:18,681 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3660 states.
[2025-03-16 21:02:18,702 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3660 to 3660.
[2025-03-16 21:02:18,705 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3660 states, 3659 states have (on average 1.4949439737633232) internal successors, (5470), 3659 states have internal predecessors, (5470), 0 states have call successors, (0), 0 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-16 21:02:18,708 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3660 states to 3660 states and 5470 transitions.
[2025-03-16 21:02:18,709 INFO  L78                 Accepts]: Start accepts. Automaton has 3660 states and 5470 transitions. Word has length 396
[2025-03-16 21:02:18,709 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 21:02:18,709 INFO  L471      AbstractCegarLoop]: Abstraction has 3660 states and 5470 transitions.
[2025-03-16 21:02:18,709 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 79.2) internal successors, (396), 5 states have internal predecessors, (396), 0 states have call successors, (0), 0 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-16 21:02:18,709 INFO  L276                IsEmpty]: Start isEmpty. Operand 3660 states and 5470 transitions.
[2025-03-16 21:02:18,711 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 398
[2025-03-16 21:02:18,711 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 21:02:18,711 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 21:02:18,711 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2025-03-16 21:02:18,711 INFO  L396      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 21:02:18,712 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 21:02:18,712 INFO  L85        PathProgramCache]: Analyzing trace with hash 1115693618, now seen corresponding path program 1 times
[2025-03-16 21:02:18,712 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 21:02:18,712 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331195661]
[2025-03-16 21:02:18,712 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 21:02:18,712 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 21:02:18,761 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 397 statements into 1 equivalence classes.
[2025-03-16 21:02:18,846 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 397 of 397 statements.
[2025-03-16 21:02:18,846 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 21:02:18,846 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 21:02:19,420 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-16 21:02:19,420 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 21:02:19,420 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331195661]
[2025-03-16 21:02:19,420 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331195661] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 21:02:19,421 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 21:02:19,421 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-16 21:02:19,421 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042938885]
[2025-03-16 21:02:19,421 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 21:02:19,421 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-16 21:02:19,421 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 21:02:19,422 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-16 21:02:19,422 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-16 21:02:19,422 INFO  L87              Difference]: Start difference. First operand 3660 states and 5470 transitions. Second operand  has 5 states, 5 states have (on average 79.4) internal successors, (397), 5 states have internal predecessors, (397), 0 states have call successors, (0), 0 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-16 21:02:20,650 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 21:02:20,650 INFO  L93              Difference]: Finished difference Result 7133 states and 10660 transitions.
[2025-03-16 21:02:20,650 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-16 21:02:20,651 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 79.4) internal successors, (397), 5 states have internal predecessors, (397), 0 states have call successors, (0), 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 397
[2025-03-16 21:02:20,651 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 21:02:20,654 INFO  L225             Difference]: With dead ends: 7133
[2025-03-16 21:02:20,654 INFO  L226             Difference]: Without dead ends: 3662
[2025-03-16 21:02:20,657 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-16 21:02:20,658 INFO  L435           NwaCegarLoop]: 4529 mSDtfsCounter, 0 mSDsluCounter, 13574 mSDsCounter, 0 mSdLazyCounter, 3640 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 18103 SdHoareTripleChecker+Invalid, 3641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3640 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time
[2025-03-16 21:02:20,658 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 18103 Invalid, 3641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3640 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time]
[2025-03-16 21:02:20,661 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3662 states.
[2025-03-16 21:02:20,680 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3662 to 3662.
[2025-03-16 21:02:20,683 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3662 states, 3661 states have (on average 1.494673586451789) internal successors, (5472), 3661 states have internal predecessors, (5472), 0 states have call successors, (0), 0 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-16 21:02:20,686 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3662 states to 3662 states and 5472 transitions.
[2025-03-16 21:02:20,686 INFO  L78                 Accepts]: Start accepts. Automaton has 3662 states and 5472 transitions. Word has length 397
[2025-03-16 21:02:20,686 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 21:02:20,686 INFO  L471      AbstractCegarLoop]: Abstraction has 3662 states and 5472 transitions.
[2025-03-16 21:02:20,686 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 79.4) internal successors, (397), 5 states have internal predecessors, (397), 0 states have call successors, (0), 0 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-16 21:02:20,686 INFO  L276                IsEmpty]: Start isEmpty. Operand 3662 states and 5472 transitions.
[2025-03-16 21:02:20,688 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 399
[2025-03-16 21:02:20,688 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 21:02:20,688 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 21:02:20,688 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2025-03-16 21:02:20,688 INFO  L396      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 21:02:20,689 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 21:02:20,689 INFO  L85        PathProgramCache]: Analyzing trace with hash 1924654219, now seen corresponding path program 1 times
[2025-03-16 21:02:20,689 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 21:02:20,689 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821037143]
[2025-03-16 21:02:20,689 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 21:02:20,689 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 21:02:20,742 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 398 statements into 1 equivalence classes.
[2025-03-16 21:02:20,865 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 398 of 398 statements.
[2025-03-16 21:02:20,865 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 21:02:20,865 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 21:02:21,188 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-16 21:02:21,188 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 21:02:21,188 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821037143]
[2025-03-16 21:02:21,188 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821037143] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 21:02:21,188 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 21:02:21,188 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-16 21:02:21,189 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650092135]
[2025-03-16 21:02:21,189 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 21:02:21,189 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-16 21:02:21,189 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 21:02:21,190 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-16 21:02:21,190 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-03-16 21:02:21,190 INFO  L87              Difference]: Start difference. First operand 3662 states and 5472 transitions. Second operand  has 6 states, 6 states have (on average 66.33333333333333) internal successors, (398), 5 states have internal predecessors, (398), 0 states have call successors, (0), 0 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-16 21:02:24,583 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 21:02:24,583 INFO  L93              Difference]: Finished difference Result 16294 states and 24342 transitions.
[2025-03-16 21:02:24,584 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-03-16 21:02:24,584 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 66.33333333333333) internal successors, (398), 5 states have internal predecessors, (398), 0 states have call successors, (0), 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 398
[2025-03-16 21:02:24,584 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 21:02:24,589 INFO  L225             Difference]: With dead ends: 16294
[2025-03-16 21:02:24,589 INFO  L226             Difference]: Without dead ends: 7031
[2025-03-16 21:02:24,593 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2025-03-16 21:02:24,593 INFO  L435           NwaCegarLoop]: 4531 mSDtfsCounter, 16872 mSDsluCounter, 16704 mSDsCounter, 0 mSdLazyCounter, 6381 mSolverCounterSat, 364 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16872 SdHoareTripleChecker+Valid, 21235 SdHoareTripleChecker+Invalid, 6745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 364 IncrementalHoareTripleChecker+Valid, 6381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time
[2025-03-16 21:02:24,593 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [16872 Valid, 21235 Invalid, 6745 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [364 Valid, 6381 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time]
[2025-03-16 21:02:24,597 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 7031 states.
[2025-03-16 21:02:24,628 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 7031 to 3972.
[2025-03-16 21:02:24,632 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3972 states, 3971 states have (on average 1.4948375723998992) internal successors, (5936), 3971 states have internal predecessors, (5936), 0 states have call successors, (0), 0 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-16 21:02:24,635 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3972 states to 3972 states and 5936 transitions.
[2025-03-16 21:02:24,636 INFO  L78                 Accepts]: Start accepts. Automaton has 3972 states and 5936 transitions. Word has length 398
[2025-03-16 21:02:24,636 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 21:02:24,636 INFO  L471      AbstractCegarLoop]: Abstraction has 3972 states and 5936 transitions.
[2025-03-16 21:02:24,636 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 66.33333333333333) internal successors, (398), 5 states have internal predecessors, (398), 0 states have call successors, (0), 0 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-16 21:02:24,636 INFO  L276                IsEmpty]: Start isEmpty. Operand 3972 states and 5936 transitions.
[2025-03-16 21:02:24,638 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 400
[2025-03-16 21:02:24,638 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 21:02:24,638 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 21:02:24,638 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2025-03-16 21:02:24,638 INFO  L396      AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 21:02:24,639 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 21:02:24,639 INFO  L85        PathProgramCache]: Analyzing trace with hash -1424285128, now seen corresponding path program 1 times
[2025-03-16 21:02:24,639 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 21:02:24,639 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253656944]
[2025-03-16 21:02:24,639 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 21:02:24,639 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 21:02:24,685 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 399 statements into 1 equivalence classes.
[2025-03-16 21:02:24,733 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 399 of 399 statements.
[2025-03-16 21:02:24,733 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 21:02:24,733 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 21:02:25,071 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-16 21:02:25,071 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 21:02:25,072 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253656944]
[2025-03-16 21:02:25,072 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253656944] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 21:02:25,072 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 21:02:25,072 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-16 21:02:25,072 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661493856]
[2025-03-16 21:02:25,072 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 21:02:25,072 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-16 21:02:25,072 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 21:02:25,073 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-16 21:02:25,073 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-16 21:02:25,073 INFO  L87              Difference]: Start difference. First operand 3972 states and 5936 transitions. Second operand  has 5 states, 5 states have (on average 79.8) internal successors, (399), 5 states have internal predecessors, (399), 0 states have call successors, (0), 0 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-16 21:02:26,360 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 21:02:26,360 INFO  L93              Difference]: Finished difference Result 7447 states and 11128 transitions.
[2025-03-16 21:02:26,361 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-16 21:02:26,361 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 79.8) internal successors, (399), 5 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 399
[2025-03-16 21:02:26,361 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 21:02:26,364 INFO  L225             Difference]: With dead ends: 7447
[2025-03-16 21:02:26,364 INFO  L226             Difference]: Without dead ends: 3974
[2025-03-16 21:02:26,366 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-16 21:02:26,367 INFO  L435           NwaCegarLoop]: 4529 mSDtfsCounter, 0 mSDsluCounter, 13574 mSDsCounter, 0 mSdLazyCounter, 3640 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 18103 SdHoareTripleChecker+Invalid, 3641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3640 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time
[2025-03-16 21:02:26,367 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 18103 Invalid, 3641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3640 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time]
[2025-03-16 21:02:26,372 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3974 states.
[2025-03-16 21:02:26,391 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3974 to 3974.
[2025-03-16 21:02:26,394 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3974 states, 3973 states have (on average 1.494588472187264) internal successors, (5938), 3973 states have internal predecessors, (5938), 0 states have call successors, (0), 0 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-16 21:02:26,397 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3974 states to 3974 states and 5938 transitions.
[2025-03-16 21:02:26,397 INFO  L78                 Accepts]: Start accepts. Automaton has 3974 states and 5938 transitions. Word has length 399
[2025-03-16 21:02:26,397 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 21:02:26,397 INFO  L471      AbstractCegarLoop]: Abstraction has 3974 states and 5938 transitions.
[2025-03-16 21:02:26,398 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 79.8) internal successors, (399), 5 states have internal predecessors, (399), 0 states have call successors, (0), 0 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-16 21:02:26,398 INFO  L276                IsEmpty]: Start isEmpty. Operand 3974 states and 5938 transitions.
[2025-03-16 21:02:26,399 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 401
[2025-03-16 21:02:26,399 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 21:02:26,399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 21:02:26,399 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2025-03-16 21:02:26,399 INFO  L396      AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 21:02:26,400 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 21:02:26,400 INFO  L85        PathProgramCache]: Analyzing trace with hash -1354643094, now seen corresponding path program 1 times
[2025-03-16 21:02:26,400 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 21:02:26,400 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432675700]
[2025-03-16 21:02:26,400 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 21:02:26,400 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 21:02:26,447 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 400 statements into 1 equivalence classes.
[2025-03-16 21:02:26,486 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 400 of 400 statements.
[2025-03-16 21:02:26,487 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 21:02:26,487 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 21:02:26,723 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-16 21:02:26,723 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 21:02:26,723 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432675700]
[2025-03-16 21:02:26,723 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432675700] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 21:02:26,723 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 21:02:26,723 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-16 21:02:26,724 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852184139]
[2025-03-16 21:02:26,724 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 21:02:26,725 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-16 21:02:26,725 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 21:02:26,726 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-16 21:02:26,726 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-16 21:02:26,726 INFO  L87              Difference]: Start difference. First operand 3974 states and 5938 transitions. Second operand  has 4 states, 4 states have (on average 100.0) internal successors, (400), 4 states have internal predecessors, (400), 0 states have call successors, (0), 0 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-16 21:02:27,669 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 21:02:27,669 INFO  L93              Difference]: Finished difference Result 7451 states and 11132 transitions.
[2025-03-16 21:02:27,669 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-16 21:02:27,670 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 100.0) internal successors, (400), 4 states have internal predecessors, (400), 0 states have call successors, (0), 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 400
[2025-03-16 21:02:27,670 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 21:02:27,673 INFO  L225             Difference]: With dead ends: 7451
[2025-03-16 21:02:27,673 INFO  L226             Difference]: Without dead ends: 3976
[2025-03-16 21:02:27,676 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-16 21:02:27,677 INFO  L435           NwaCegarLoop]: 4529 mSDtfsCounter, 0 mSDsluCounter, 9050 mSDsCounter, 0 mSdLazyCounter, 2728 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 13579 SdHoareTripleChecker+Invalid, 2728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time
[2025-03-16 21:02:27,677 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 13579 Invalid, 2728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2728 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2025-03-16 21:02:27,681 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3976 states.
[2025-03-16 21:02:27,701 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3976 to 3976.
[2025-03-16 21:02:27,705 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3976 states, 3975 states have (on average 1.4943396226415093) internal successors, (5940), 3975 states have internal predecessors, (5940), 0 states have call successors, (0), 0 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-16 21:02:27,708 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3976 states to 3976 states and 5940 transitions.
[2025-03-16 21:02:27,709 INFO  L78                 Accepts]: Start accepts. Automaton has 3976 states and 5940 transitions. Word has length 400
[2025-03-16 21:02:27,709 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 21:02:27,709 INFO  L471      AbstractCegarLoop]: Abstraction has 3976 states and 5940 transitions.
[2025-03-16 21:02:27,709 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 100.0) internal successors, (400), 4 states have internal predecessors, (400), 0 states have call successors, (0), 0 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-16 21:02:27,709 INFO  L276                IsEmpty]: Start isEmpty. Operand 3976 states and 5940 transitions.
[2025-03-16 21:02:27,711 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 402
[2025-03-16 21:02:27,711 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 21:02:27,711 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 21:02:27,711 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2025-03-16 21:02:27,711 INFO  L396      AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 21:02:27,712 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 21:02:27,712 INFO  L85        PathProgramCache]: Analyzing trace with hash 2137093683, now seen corresponding path program 1 times
[2025-03-16 21:02:27,712 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 21:02:27,712 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492130228]
[2025-03-16 21:02:27,712 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 21:02:27,712 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 21:02:27,759 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 401 statements into 1 equivalence classes.
[2025-03-16 21:02:27,799 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 401 of 401 statements.
[2025-03-16 21:02:27,799 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 21:02:27,799 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 21:02:28,068 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-16 21:02:28,068 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 21:02:28,068 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492130228]
[2025-03-16 21:02:28,068 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492130228] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 21:02:28,068 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 21:02:28,068 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-16 21:02:28,068 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129315045]
[2025-03-16 21:02:28,068 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 21:02:28,069 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-16 21:02:28,069 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 21:02:28,069 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-16 21:02:28,069 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-16 21:02:28,069 INFO  L87              Difference]: Start difference. First operand 3976 states and 5940 transitions. Second operand  has 5 states, 5 states have (on average 80.2) internal successors, (401), 5 states have internal predecessors, (401), 0 states have call successors, (0), 0 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-16 21:02:29,034 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 21:02:29,036 INFO  L93              Difference]: Finished difference Result 7455 states and 11136 transitions.
[2025-03-16 21:02:29,036 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-16 21:02:29,036 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 80.2) internal successors, (401), 5 states have internal predecessors, (401), 0 states have call successors, (0), 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 401
[2025-03-16 21:02:29,036 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 21:02:29,039 INFO  L225             Difference]: With dead ends: 7455
[2025-03-16 21:02:29,039 INFO  L226             Difference]: Without dead ends: 3978
[2025-03-16 21:02:29,041 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-16 21:02:29,042 INFO  L435           NwaCegarLoop]: 4529 mSDtfsCounter, 0 mSDsluCounter, 9050 mSDsCounter, 0 mSdLazyCounter, 2729 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 13579 SdHoareTripleChecker+Invalid, 2730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2729 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time
[2025-03-16 21:02:29,042 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 13579 Invalid, 2730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2729 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2025-03-16 21:02:29,045 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3978 states.
[2025-03-16 21:02:29,065 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3978 to 3978.
[2025-03-16 21:02:29,067 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3978 states, 3977 states have (on average 1.4940910233844606) internal successors, (5942), 3977 states have internal predecessors, (5942), 0 states have call successors, (0), 0 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-16 21:02:29,070 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3978 states to 3978 states and 5942 transitions.
[2025-03-16 21:02:29,070 INFO  L78                 Accepts]: Start accepts. Automaton has 3978 states and 5942 transitions. Word has length 401
[2025-03-16 21:02:29,070 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 21:02:29,070 INFO  L471      AbstractCegarLoop]: Abstraction has 3978 states and 5942 transitions.
[2025-03-16 21:02:29,070 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 80.2) internal successors, (401), 5 states have internal predecessors, (401), 0 states have call successors, (0), 0 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-16 21:02:29,070 INFO  L276                IsEmpty]: Start isEmpty. Operand 3978 states and 5942 transitions.
[2025-03-16 21:02:29,072 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 403
[2025-03-16 21:02:29,072 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 21:02:29,072 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 21:02:29,072 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2025-03-16 21:02:29,072 INFO  L396      AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 21:02:29,072 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 21:02:29,072 INFO  L85        PathProgramCache]: Analyzing trace with hash -1811425553, now seen corresponding path program 1 times
[2025-03-16 21:02:29,072 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 21:02:29,072 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825160339]
[2025-03-16 21:02:29,072 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 21:02:29,072 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 21:02:29,123 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 402 statements into 1 equivalence classes.
[2025-03-16 21:02:29,184 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 402 of 402 statements.
[2025-03-16 21:02:29,185 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 21:02:29,185 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 21:02:29,429 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-16 21:02:29,430 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 21:02:29,430 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825160339]
[2025-03-16 21:02:29,430 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825160339] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 21:02:29,430 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 21:02:29,430 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-16 21:02:29,430 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266476819]
[2025-03-16 21:02:29,430 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 21:02:29,430 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-16 21:02:29,431 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 21:02:29,431 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-16 21:02:29,431 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-03-16 21:02:29,431 INFO  L87              Difference]: Start difference. First operand 3978 states and 5942 transitions. Second operand  has 6 states, 6 states have (on average 67.0) internal successors, (402), 5 states have internal predecessors, (402), 0 states have call successors, (0), 0 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-16 21:02:32,072 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 21:02:32,073 INFO  L93              Difference]: Finished difference Result 10524 states and 15713 transitions.
[2025-03-16 21:02:32,073 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-03-16 21:02:32,073 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 67.0) internal successors, (402), 5 states have internal predecessors, (402), 0 states have call successors, (0), 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 402
[2025-03-16 21:02:32,073 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 21:02:32,079 INFO  L225             Difference]: With dead ends: 10524
[2025-03-16 21:02:32,079 INFO  L226             Difference]: Without dead ends: 7039
[2025-03-16 21:02:32,082 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2025-03-16 21:02:32,082 INFO  L435           NwaCegarLoop]: 4524 mSDtfsCounter, 5040 mSDsluCounter, 16903 mSDsCounter, 0 mSdLazyCounter, 5470 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5040 SdHoareTripleChecker+Valid, 21427 SdHoareTripleChecker+Invalid, 5470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time
[2025-03-16 21:02:32,083 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [5040 Valid, 21427 Invalid, 5470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5470 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time]
[2025-03-16 21:02:32,090 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 7039 states.
[2025-03-16 21:02:32,134 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 7039 to 3978.
[2025-03-16 21:02:32,137 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3978 states, 3977 states have (on average 1.4938395775710334) internal successors, (5941), 3977 states have internal predecessors, (5941), 0 states have call successors, (0), 0 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-16 21:02:32,142 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3978 states to 3978 states and 5941 transitions.
[2025-03-16 21:02:32,143 INFO  L78                 Accepts]: Start accepts. Automaton has 3978 states and 5941 transitions. Word has length 402
[2025-03-16 21:02:32,143 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 21:02:32,143 INFO  L471      AbstractCegarLoop]: Abstraction has 3978 states and 5941 transitions.
[2025-03-16 21:02:32,143 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 67.0) internal successors, (402), 5 states have internal predecessors, (402), 0 states have call successors, (0), 0 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-16 21:02:32,143 INFO  L276                IsEmpty]: Start isEmpty. Operand 3978 states and 5941 transitions.
[2025-03-16 21:02:32,146 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 404
[2025-03-16 21:02:32,146 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 21:02:32,146 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 21:02:32,146 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2025-03-16 21:02:32,146 INFO  L396      AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 21:02:32,147 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 21:02:32,147 INFO  L85        PathProgramCache]: Analyzing trace with hash 82825510, now seen corresponding path program 1 times
[2025-03-16 21:02:32,147 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 21:02:32,147 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307705102]
[2025-03-16 21:02:32,147 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 21:02:32,147 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 21:02:32,217 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 403 statements into 1 equivalence classes.
[2025-03-16 21:02:32,271 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 403 of 403 statements.
[2025-03-16 21:02:32,271 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 21:02:32,271 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 21:02:32,578 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-16 21:02:32,579 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 21:02:32,579 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307705102]
[2025-03-16 21:02:32,579 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307705102] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 21:02:32,579 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 21:02:32,579 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-16 21:02:32,579 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015977920]
[2025-03-16 21:02:32,580 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 21:02:32,580 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-16 21:02:32,580 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 21:02:32,580 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-16 21:02:32,581 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-16 21:02:32,581 INFO  L87              Difference]: Start difference. First operand 3978 states and 5941 transitions. Second operand  has 5 states, 5 states have (on average 80.6) internal successors, (403), 5 states have internal predecessors, (403), 0 states have call successors, (0), 0 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-16 21:02:33,738 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 21:02:33,738 INFO  L93              Difference]: Finished difference Result 7459 states and 11139 transitions.
[2025-03-16 21:02:33,738 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-16 21:02:33,738 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 80.6) internal successors, (403), 5 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 403
[2025-03-16 21:02:33,739 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 21:02:33,741 INFO  L225             Difference]: With dead ends: 7459
[2025-03-16 21:02:33,741 INFO  L226             Difference]: Without dead ends: 3980
[2025-03-16 21:02:33,744 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-16 21:02:33,744 INFO  L435           NwaCegarLoop]: 4529 mSDtfsCounter, 0 mSDsluCounter, 13574 mSDsCounter, 0 mSdLazyCounter, 3640 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 18103 SdHoareTripleChecker+Invalid, 3641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3640 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time
[2025-03-16 21:02:33,744 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 18103 Invalid, 3641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3640 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2025-03-16 21:02:33,747 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3980 states.
[2025-03-16 21:02:33,764 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3980 to 3980.
[2025-03-16 21:02:33,767 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3980 states, 3979 states have (on average 1.4935913546117114) internal successors, (5943), 3979 states have internal predecessors, (5943), 0 states have call successors, (0), 0 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-16 21:02:33,769 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3980 states to 3980 states and 5943 transitions.
[2025-03-16 21:02:33,770 INFO  L78                 Accepts]: Start accepts. Automaton has 3980 states and 5943 transitions. Word has length 403
[2025-03-16 21:02:33,770 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 21:02:33,770 INFO  L471      AbstractCegarLoop]: Abstraction has 3980 states and 5943 transitions.
[2025-03-16 21:02:33,770 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 80.6) internal successors, (403), 5 states have internal predecessors, (403), 0 states have call successors, (0), 0 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-16 21:02:33,770 INFO  L276                IsEmpty]: Start isEmpty. Operand 3980 states and 5943 transitions.
[2025-03-16 21:02:33,771 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 405
[2025-03-16 21:02:33,771 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 21:02:33,772 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 21:02:33,772 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2025-03-16 21:02:33,772 INFO  L396      AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 21:02:33,772 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 21:02:33,772 INFO  L85        PathProgramCache]: Analyzing trace with hash -1570910249, now seen corresponding path program 1 times
[2025-03-16 21:02:33,772 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 21:02:33,772 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674864538]
[2025-03-16 21:02:33,772 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 21:02:33,772 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 21:02:33,817 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 404 statements into 1 equivalence classes.
[2025-03-16 21:02:33,860 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 404 of 404 statements.
[2025-03-16 21:02:33,861 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 21:02:33,861 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 21:02:34,140 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-16 21:02:34,141 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 21:02:34,141 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674864538]
[2025-03-16 21:02:34,141 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674864538] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 21:02:34,141 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 21:02:34,141 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-16 21:02:34,141 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564807369]
[2025-03-16 21:02:34,141 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 21:02:34,141 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-16 21:02:34,141 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 21:02:34,142 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-16 21:02:34,142 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-16 21:02:34,142 INFO  L87              Difference]: Start difference. First operand 3980 states and 5943 transitions. Second operand  has 4 states, 4 states have (on average 101.0) internal successors, (404), 4 states have internal predecessors, (404), 0 states have call successors, (0), 0 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-16 21:02:35,065 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 21:02:35,065 INFO  L93              Difference]: Finished difference Result 7463 states and 11143 transitions.
[2025-03-16 21:02:35,065 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-16 21:02:35,066 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 101.0) internal successors, (404), 4 states have internal predecessors, (404), 0 states have call successors, (0), 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 404
[2025-03-16 21:02:35,066 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 21:02:35,069 INFO  L225             Difference]: With dead ends: 7463
[2025-03-16 21:02:35,069 INFO  L226             Difference]: Without dead ends: 3982
[2025-03-16 21:02:35,072 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-16 21:02:35,072 INFO  L435           NwaCegarLoop]: 4529 mSDtfsCounter, 0 mSDsluCounter, 9050 mSDsCounter, 0 mSdLazyCounter, 2728 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 13579 SdHoareTripleChecker+Invalid, 2728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time
[2025-03-16 21:02:35,073 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 13579 Invalid, 2728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2728 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2025-03-16 21:02:35,076 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3982 states.
[2025-03-16 21:02:35,097 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3982 to 3982.
[2025-03-16 21:02:35,099 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3982 states, 3981 states have (on average 1.4933433810600352) internal successors, (5945), 3981 states have internal predecessors, (5945), 0 states have call successors, (0), 0 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-16 21:02:35,103 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3982 states to 3982 states and 5945 transitions.
[2025-03-16 21:02:35,103 INFO  L78                 Accepts]: Start accepts. Automaton has 3982 states and 5945 transitions. Word has length 404
[2025-03-16 21:02:35,103 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 21:02:35,103 INFO  L471      AbstractCegarLoop]: Abstraction has 3982 states and 5945 transitions.
[2025-03-16 21:02:35,103 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 101.0) internal successors, (404), 4 states have internal predecessors, (404), 0 states have call successors, (0), 0 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-16 21:02:35,103 INFO  L276                IsEmpty]: Start isEmpty. Operand 3982 states and 5945 transitions.
[2025-03-16 21:02:35,105 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 406
[2025-03-16 21:02:35,105 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 21:02:35,105 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 21:02:35,105 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2025-03-16 21:02:35,105 INFO  L396      AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 21:02:35,105 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 21:02:35,105 INFO  L85        PathProgramCache]: Analyzing trace with hash -382829589, now seen corresponding path program 1 times
[2025-03-16 21:02:35,105 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 21:02:35,106 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337885690]
[2025-03-16 21:02:35,106 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 21:02:35,106 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 21:02:35,152 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 405 statements into 1 equivalence classes.
[2025-03-16 21:02:35,191 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 405 of 405 statements.
[2025-03-16 21:02:35,191 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 21:02:35,191 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 21:02:35,422 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-16 21:02:35,422 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 21:02:35,422 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337885690]
[2025-03-16 21:02:35,422 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337885690] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 21:02:35,422 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 21:02:35,423 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-16 21:02:35,423 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138729170]
[2025-03-16 21:02:35,423 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 21:02:35,423 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-16 21:02:35,423 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 21:02:35,423 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-16 21:02:35,423 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-16 21:02:35,423 INFO  L87              Difference]: Start difference. First operand 3982 states and 5945 transitions. Second operand  has 4 states, 4 states have (on average 101.25) internal successors, (405), 4 states have internal predecessors, (405), 0 states have call successors, (0), 0 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-16 21:02:36,508 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 21:02:36,509 INFO  L93              Difference]: Finished difference Result 7471 states and 11153 transitions.
[2025-03-16 21:02:36,509 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-16 21:02:36,509 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 101.25) internal successors, (405), 4 states have internal predecessors, (405), 0 states have call successors, (0), 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 405
[2025-03-16 21:02:36,509 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 21:02:36,512 INFO  L225             Difference]: With dead ends: 7471
[2025-03-16 21:02:36,512 INFO  L226             Difference]: Without dead ends: 3988
[2025-03-16 21:02:36,514 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-16 21:02:36,515 INFO  L435           NwaCegarLoop]: 4529 mSDtfsCounter, 4 mSDsluCounter, 9050 mSDsCounter, 0 mSdLazyCounter, 2728 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 13579 SdHoareTripleChecker+Invalid, 2728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time
[2025-03-16 21:02:36,515 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 13579 Invalid, 2728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2728 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time]
[2025-03-16 21:02:36,518 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3988 states.
[2025-03-16 21:02:36,537 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3988 to 3988.
[2025-03-16 21:02:36,540 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3988 states, 3987 states have (on average 1.4931025833960372) internal successors, (5953), 3987 states have internal predecessors, (5953), 0 states have call successors, (0), 0 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-16 21:02:36,542 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3988 states to 3988 states and 5953 transitions.
[2025-03-16 21:02:36,542 INFO  L78                 Accepts]: Start accepts. Automaton has 3988 states and 5953 transitions. Word has length 405
[2025-03-16 21:02:36,543 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 21:02:36,543 INFO  L471      AbstractCegarLoop]: Abstraction has 3988 states and 5953 transitions.
[2025-03-16 21:02:36,543 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 101.25) internal successors, (405), 4 states have internal predecessors, (405), 0 states have call successors, (0), 0 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-16 21:02:36,543 INFO  L276                IsEmpty]: Start isEmpty. Operand 3988 states and 5953 transitions.
[2025-03-16 21:02:36,544 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 407
[2025-03-16 21:02:36,544 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 21:02:36,544 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 21:02:36,545 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2025-03-16 21:02:36,545 INFO  L396      AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 21:02:36,545 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 21:02:36,545 INFO  L85        PathProgramCache]: Analyzing trace with hash 856967693, now seen corresponding path program 1 times
[2025-03-16 21:02:36,545 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 21:02:36,545 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349479250]
[2025-03-16 21:02:36,545 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 21:02:36,546 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 21:02:36,597 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 406 statements into 1 equivalence classes.
[2025-03-16 21:02:36,639 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 406 of 406 statements.
[2025-03-16 21:02:36,639 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 21:02:36,640 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 21:02:36,860 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-16 21:02:36,860 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 21:02:36,860 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349479250]
[2025-03-16 21:02:36,860 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349479250] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 21:02:36,860 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 21:02:36,860 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-16 21:02:36,860 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154143377]
[2025-03-16 21:02:36,860 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 21:02:36,861 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-16 21:02:36,861 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 21:02:36,861 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-16 21:02:36,861 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-16 21:02:36,861 INFO  L87              Difference]: Start difference. First operand 3988 states and 5953 transitions. Second operand  has 4 states, 4 states have (on average 101.5) internal successors, (406), 4 states have internal predecessors, (406), 0 states have call successors, (0), 0 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-16 21:02:37,809 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 21:02:37,809 INFO  L93              Difference]: Finished difference Result 7479 states and 11163 transitions.
[2025-03-16 21:02:37,809 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-16 21:02:37,809 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 101.5) internal successors, (406), 4 states have internal predecessors, (406), 0 states have call successors, (0), 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 406
[2025-03-16 21:02:37,810 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 21:02:37,812 INFO  L225             Difference]: With dead ends: 7479
[2025-03-16 21:02:37,812 INFO  L226             Difference]: Without dead ends: 3990
[2025-03-16 21:02:37,813 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-16 21:02:37,814 INFO  L435           NwaCegarLoop]: 4529 mSDtfsCounter, 0 mSDsluCounter, 9045 mSDsCounter, 0 mSdLazyCounter, 2733 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 13574 SdHoareTripleChecker+Invalid, 2733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time
[2025-03-16 21:02:37,814 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 13574 Invalid, 2733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2733 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2025-03-16 21:02:37,816 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3990 states.
[2025-03-16 21:02:37,831 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3990 to 3990.
[2025-03-16 21:02:37,833 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3990 states, 3989 states have (on average 1.4928553522186012) internal successors, (5955), 3989 states have internal predecessors, (5955), 0 states have call successors, (0), 0 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-16 21:02:37,836 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3990 states to 3990 states and 5955 transitions.
[2025-03-16 21:02:37,837 INFO  L78                 Accepts]: Start accepts. Automaton has 3990 states and 5955 transitions. Word has length 406
[2025-03-16 21:02:37,837 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 21:02:37,837 INFO  L471      AbstractCegarLoop]: Abstraction has 3990 states and 5955 transitions.
[2025-03-16 21:02:37,837 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 101.5) internal successors, (406), 4 states have internal predecessors, (406), 0 states have call successors, (0), 0 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-16 21:02:37,837 INFO  L276                IsEmpty]: Start isEmpty. Operand 3990 states and 5955 transitions.
[2025-03-16 21:02:37,838 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 408
[2025-03-16 21:02:37,839 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 21:02:37,839 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 21:02:37,839 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26
[2025-03-16 21:02:37,839 INFO  L396      AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 21:02:37,839 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 21:02:37,839 INFO  L85        PathProgramCache]: Analyzing trace with hash 980328400, now seen corresponding path program 1 times
[2025-03-16 21:02:37,840 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 21:02:37,840 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286926149]
[2025-03-16 21:02:37,840 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 21:02:37,840 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 21:02:37,882 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 407 statements into 1 equivalence classes.
[2025-03-16 21:02:37,920 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 407 of 407 statements.
[2025-03-16 21:02:37,920 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 21:02:37,920 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 21:02:38,135 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-16 21:02:38,135 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 21:02:38,135 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286926149]
[2025-03-16 21:02:38,135 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286926149] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 21:02:38,135 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 21:02:38,135 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-16 21:02:38,135 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35674838]
[2025-03-16 21:02:38,135 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 21:02:38,135 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-16 21:02:38,135 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 21:02:38,136 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-16 21:02:38,136 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-16 21:02:38,136 INFO  L87              Difference]: Start difference. First operand 3990 states and 5955 transitions. Second operand  has 4 states, 4 states have (on average 101.75) internal successors, (407), 4 states have internal predecessors, (407), 0 states have call successors, (0), 0 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-16 21:02:39,093 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 21:02:39,093 INFO  L93              Difference]: Finished difference Result 7489 states and 11175 transitions.
[2025-03-16 21:02:39,093 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-16 21:02:39,093 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 101.75) internal successors, (407), 4 states have internal predecessors, (407), 0 states have call successors, (0), 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 407
[2025-03-16 21:02:39,093 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 21:02:39,097 INFO  L225             Difference]: With dead ends: 7489
[2025-03-16 21:02:39,097 INFO  L226             Difference]: Without dead ends: 3998
[2025-03-16 21:02:39,099 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-16 21:02:39,099 INFO  L435           NwaCegarLoop]: 4529 mSDtfsCounter, 3 mSDsluCounter, 9050 mSDsCounter, 0 mSdLazyCounter, 2728 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 13579 SdHoareTripleChecker+Invalid, 2728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time
[2025-03-16 21:02:39,099 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 13579 Invalid, 2728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2728 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2025-03-16 21:02:39,102 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3998 states.
[2025-03-16 21:02:39,127 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3998 to 3994.
[2025-03-16 21:02:39,130 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3994 states, 3993 states have (on average 1.492862509391435) internal successors, (5961), 3993 states have internal predecessors, (5961), 0 states have call successors, (0), 0 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-16 21:02:39,134 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3994 states to 3994 states and 5961 transitions.
[2025-03-16 21:02:39,134 INFO  L78                 Accepts]: Start accepts. Automaton has 3994 states and 5961 transitions. Word has length 407
[2025-03-16 21:02:39,134 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 21:02:39,134 INFO  L471      AbstractCegarLoop]: Abstraction has 3994 states and 5961 transitions.
[2025-03-16 21:02:39,134 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 101.75) internal successors, (407), 4 states have internal predecessors, (407), 0 states have call successors, (0), 0 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-16 21:02:39,135 INFO  L276                IsEmpty]: Start isEmpty. Operand 3994 states and 5961 transitions.
[2025-03-16 21:02:39,136 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 409
[2025-03-16 21:02:39,136 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 21:02:39,136 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 21:02:39,136 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27
[2025-03-16 21:02:39,136 INFO  L396      AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 21:02:39,137 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 21:02:39,137 INFO  L85        PathProgramCache]: Analyzing trace with hash -1617738584, now seen corresponding path program 1 times
[2025-03-16 21:02:39,137 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 21:02:39,137 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426239503]
[2025-03-16 21:02:39,137 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 21:02:39,137 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 21:02:39,189 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 408 statements into 1 equivalence classes.
[2025-03-16 21:02:39,230 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 408 of 408 statements.
[2025-03-16 21:02:39,230 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 21:02:39,230 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 21:02:39,473 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-16 21:02:39,473 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 21:02:39,473 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426239503]
[2025-03-16 21:02:39,473 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426239503] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 21:02:39,473 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 21:02:39,474 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-16 21:02:39,474 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883846711]
[2025-03-16 21:02:39,474 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 21:02:39,474 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-16 21:02:39,474 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 21:02:39,474 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-16 21:02:39,474 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-16 21:02:39,474 INFO  L87              Difference]: Start difference. First operand 3994 states and 5961 transitions. Second operand  has 4 states, 4 states have (on average 102.0) internal successors, (408), 4 states have internal predecessors, (408), 0 states have call successors, (0), 0 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-16 21:02:40,474 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 21:02:40,475 INFO  L93              Difference]: Finished difference Result 7495 states and 11185 transitions.
[2025-03-16 21:02:40,475 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-16 21:02:40,475 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 102.0) internal successors, (408), 4 states have internal predecessors, (408), 0 states have call successors, (0), 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 408
[2025-03-16 21:02:40,475 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 21:02:40,481 INFO  L225             Difference]: With dead ends: 7495
[2025-03-16 21:02:40,481 INFO  L226             Difference]: Without dead ends: 4000
[2025-03-16 21:02:40,483 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-16 21:02:40,484 INFO  L435           NwaCegarLoop]: 4529 mSDtfsCounter, 4 mSDsluCounter, 9050 mSDsCounter, 0 mSdLazyCounter, 2728 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 13579 SdHoareTripleChecker+Invalid, 2728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time
[2025-03-16 21:02:40,484 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 13579 Invalid, 2728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2728 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2025-03-16 21:02:40,486 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 4000 states.
[2025-03-16 21:02:40,533 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 4000 to 4000.
[2025-03-16 21:02:40,536 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 4000 states, 3999 states have (on average 1.4926231557889473) internal successors, (5969), 3999 states have internal predecessors, (5969), 0 states have call successors, (0), 0 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-16 21:02:40,541 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4000 states to 4000 states and 5969 transitions.
[2025-03-16 21:02:40,541 INFO  L78                 Accepts]: Start accepts. Automaton has 4000 states and 5969 transitions. Word has length 408
[2025-03-16 21:02:40,542 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 21:02:40,542 INFO  L471      AbstractCegarLoop]: Abstraction has 4000 states and 5969 transitions.
[2025-03-16 21:02:40,542 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 102.0) internal successors, (408), 4 states have internal predecessors, (408), 0 states have call successors, (0), 0 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-16 21:02:40,542 INFO  L276                IsEmpty]: Start isEmpty. Operand 4000 states and 5969 transitions.
[2025-03-16 21:02:40,545 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 410
[2025-03-16 21:02:40,545 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 21:02:40,545 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 21:02:40,546 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28
[2025-03-16 21:02:40,546 INFO  L396      AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 21:02:40,546 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 21:02:40,546 INFO  L85        PathProgramCache]: Analyzing trace with hash -1556253350, now seen corresponding path program 1 times
[2025-03-16 21:02:40,546 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 21:02:40,547 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916072151]
[2025-03-16 21:02:40,547 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 21:02:40,547 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 21:02:40,638 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 409 statements into 1 equivalence classes.
[2025-03-16 21:02:40,732 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 409 of 409 statements.
[2025-03-16 21:02:40,732 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 21:02:40,732 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 21:02:41,044 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-16 21:02:41,044 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 21:02:41,044 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916072151]
[2025-03-16 21:02:41,044 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916072151] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 21:02:41,044 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 21:02:41,044 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-16 21:02:41,045 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711806210]
[2025-03-16 21:02:41,045 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 21:02:41,045 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-16 21:02:41,045 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 21:02:41,045 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-16 21:02:41,045 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-16 21:02:41,046 INFO  L87              Difference]: Start difference. First operand 4000 states and 5969 transitions. Second operand  has 4 states, 4 states have (on average 102.25) internal successors, (409), 4 states have internal predecessors, (409), 0 states have call successors, (0), 0 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-16 21:02:41,970 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 21:02:41,970 INFO  L93              Difference]: Finished difference Result 7503 states and 11195 transitions.
[2025-03-16 21:02:41,970 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-16 21:02:41,970 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 102.25) internal successors, (409), 4 states have internal predecessors, (409), 0 states have call successors, (0), 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 409
[2025-03-16 21:02:41,971 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 21:02:41,975 INFO  L225             Difference]: With dead ends: 7503
[2025-03-16 21:02:41,975 INFO  L226             Difference]: Without dead ends: 4002
[2025-03-16 21:02:41,978 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-16 21:02:41,979 INFO  L435           NwaCegarLoop]: 4529 mSDtfsCounter, 0 mSDsluCounter, 9045 mSDsCounter, 0 mSdLazyCounter, 2733 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 13574 SdHoareTripleChecker+Invalid, 2733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time
[2025-03-16 21:02:41,979 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 13574 Invalid, 2733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2733 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2025-03-16 21:02:41,982 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 4002 states.
[2025-03-16 21:02:42,011 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 4002 to 4002.
[2025-03-16 21:02:42,014 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 4002 states, 4001 states have (on average 1.4923769057735565) internal successors, (5971), 4001 states have internal predecessors, (5971), 0 states have call successors, (0), 0 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-16 21:02:42,018 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4002 states to 4002 states and 5971 transitions.
[2025-03-16 21:02:42,018 INFO  L78                 Accepts]: Start accepts. Automaton has 4002 states and 5971 transitions. Word has length 409
[2025-03-16 21:02:42,019 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 21:02:42,019 INFO  L471      AbstractCegarLoop]: Abstraction has 4002 states and 5971 transitions.
[2025-03-16 21:02:42,019 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 102.25) internal successors, (409), 4 states have internal predecessors, (409), 0 states have call successors, (0), 0 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-16 21:02:42,019 INFO  L276                IsEmpty]: Start isEmpty. Operand 4002 states and 5971 transitions.
[2025-03-16 21:02:42,021 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 411
[2025-03-16 21:02:42,021 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 21:02:42,021 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 21:02:42,021 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29
[2025-03-16 21:02:42,021 INFO  L396      AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 21:02:42,022 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 21:02:42,022 INFO  L85        PathProgramCache]: Analyzing trace with hash -227462621, now seen corresponding path program 1 times
[2025-03-16 21:02:42,022 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 21:02:42,022 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570463982]
[2025-03-16 21:02:42,022 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 21:02:42,022 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 21:02:42,095 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 410 statements into 1 equivalence classes.
[2025-03-16 21:02:42,137 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 410 of 410 statements.
[2025-03-16 21:02:42,137 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 21:02:42,137 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 21:02:42,389 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-16 21:02:42,389 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 21:02:42,389 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570463982]
[2025-03-16 21:02:42,389 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570463982] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 21:02:42,389 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 21:02:42,389 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-16 21:02:42,389 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722493895]
[2025-03-16 21:02:42,389 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 21:02:42,389 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-16 21:02:42,389 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 21:02:42,390 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-16 21:02:42,390 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-16 21:02:42,390 INFO  L87              Difference]: Start difference. First operand 4002 states and 5971 transitions. Second operand  has 4 states, 4 states have (on average 102.5) internal successors, (410), 4 states have internal predecessors, (410), 0 states have call successors, (0), 0 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-16 21:02:43,308 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 21:02:43,308 INFO  L93              Difference]: Finished difference Result 7513 states and 11207 transitions.
[2025-03-16 21:02:43,308 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-16 21:02:43,308 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 102.5) internal successors, (410), 4 states have internal predecessors, (410), 0 states have call successors, (0), 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 410
[2025-03-16 21:02:43,309 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 21:02:43,312 INFO  L225             Difference]: With dead ends: 7513
[2025-03-16 21:02:43,312 INFO  L226             Difference]: Without dead ends: 4010
[2025-03-16 21:02:43,314 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-16 21:02:43,315 INFO  L435           NwaCegarLoop]: 4529 mSDtfsCounter, 3 mSDsluCounter, 9050 mSDsCounter, 0 mSdLazyCounter, 2728 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 13579 SdHoareTripleChecker+Invalid, 2728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time
[2025-03-16 21:02:43,315 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 13579 Invalid, 2728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2728 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2025-03-16 21:02:43,317 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 4010 states.
[2025-03-16 21:02:43,340 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 4010 to 4006.
[2025-03-16 21:02:43,343 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 4006 states, 4005 states have (on average 1.4923845193508114) internal successors, (5977), 4005 states have internal predecessors, (5977), 0 states have call successors, (0), 0 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-16 21:02:43,346 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4006 states to 4006 states and 5977 transitions.
[2025-03-16 21:02:43,347 INFO  L78                 Accepts]: Start accepts. Automaton has 4006 states and 5977 transitions. Word has length 410
[2025-03-16 21:02:43,347 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 21:02:43,347 INFO  L471      AbstractCegarLoop]: Abstraction has 4006 states and 5977 transitions.
[2025-03-16 21:02:43,347 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 102.5) internal successors, (410), 4 states have internal predecessors, (410), 0 states have call successors, (0), 0 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-16 21:02:43,347 INFO  L276                IsEmpty]: Start isEmpty. Operand 4006 states and 5977 transitions.
[2025-03-16 21:02:43,349 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 412
[2025-03-16 21:02:43,349 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 21:02:43,349 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 21:02:43,349 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30
[2025-03-16 21:02:43,349 INFO  L396      AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 21:02:43,350 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 21:02:43,350 INFO  L85        PathProgramCache]: Analyzing trace with hash -1835751073, now seen corresponding path program 1 times
[2025-03-16 21:02:43,350 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 21:02:43,350 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499606908]
[2025-03-16 21:02:43,350 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 21:02:43,350 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 21:02:43,398 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 411 statements into 1 equivalence classes.
[2025-03-16 21:02:43,469 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 411 of 411 statements.
[2025-03-16 21:02:43,469 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 21:02:43,469 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 21:02:43,676 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-16 21:02:43,676 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 21:02:43,676 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499606908]
[2025-03-16 21:02:43,676 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499606908] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 21:02:43,676 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 21:02:43,676 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-16 21:02:43,676 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526615765]
[2025-03-16 21:02:43,676 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 21:02:43,677 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-16 21:02:43,677 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 21:02:43,677 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-16 21:02:43,677 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-16 21:02:43,677 INFO  L87              Difference]: Start difference. First operand 4006 states and 5977 transitions. Second operand  has 4 states, 4 states have (on average 102.75) internal successors, (411), 4 states have internal predecessors, (411), 0 states have call successors, (0), 0 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-16 21:02:44,590 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 21:02:44,590 INFO  L93              Difference]: Finished difference Result 7515 states and 11211 transitions.
[2025-03-16 21:02:44,590 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-16 21:02:44,590 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 102.75) internal successors, (411), 4 states have internal predecessors, (411), 0 states have call successors, (0), 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 411
[2025-03-16 21:02:44,591 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 21:02:44,595 INFO  L225             Difference]: With dead ends: 7515
[2025-03-16 21:02:44,595 INFO  L226             Difference]: Without dead ends: 4008
[2025-03-16 21:02:44,597 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-16 21:02:44,598 INFO  L435           NwaCegarLoop]: 4529 mSDtfsCounter, 0 mSDsluCounter, 9050 mSDsCounter, 0 mSdLazyCounter, 2728 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 13579 SdHoareTripleChecker+Invalid, 2728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time
[2025-03-16 21:02:44,598 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 13579 Invalid, 2728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2728 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2025-03-16 21:02:44,604 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 4008 states.
[2025-03-16 21:02:44,629 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 4008 to 4008.
[2025-03-16 21:02:44,632 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 4008 states, 4007 states have (on average 1.4921387571749438) internal successors, (5979), 4007 states have internal predecessors, (5979), 0 states have call successors, (0), 0 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-16 21:02:44,636 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4008 states to 4008 states and 5979 transitions.
[2025-03-16 21:02:44,636 INFO  L78                 Accepts]: Start accepts. Automaton has 4008 states and 5979 transitions. Word has length 411
[2025-03-16 21:02:44,636 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 21:02:44,637 INFO  L471      AbstractCegarLoop]: Abstraction has 4008 states and 5979 transitions.
[2025-03-16 21:02:44,637 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 102.75) internal successors, (411), 4 states have internal predecessors, (411), 0 states have call successors, (0), 0 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-16 21:02:44,637 INFO  L276                IsEmpty]: Start isEmpty. Operand 4008 states and 5979 transitions.
[2025-03-16 21:02:44,638 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 413
[2025-03-16 21:02:44,638 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 21:02:44,639 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 21:02:44,639 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31
[2025-03-16 21:02:44,639 INFO  L396      AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 21:02:44,639 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 21:02:44,639 INFO  L85        PathProgramCache]: Analyzing trace with hash -1811261282, now seen corresponding path program 1 times
[2025-03-16 21:02:44,639 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 21:02:44,639 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836138298]
[2025-03-16 21:02:44,640 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 21:02:44,640 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 21:02:44,687 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 412 statements into 1 equivalence classes.
[2025-03-16 21:02:44,730 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 412 of 412 statements.
[2025-03-16 21:02:44,730 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 21:02:44,730 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 21:02:45,028 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-16 21:02:45,029 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 21:02:45,029 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836138298]
[2025-03-16 21:02:45,029 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836138298] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 21:02:45,029 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 21:02:45,029 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-16 21:02:45,029 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189354114]
[2025-03-16 21:02:45,029 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 21:02:45,029 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-16 21:02:45,030 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 21:02:45,030 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-16 21:02:45,030 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-16 21:02:45,030 INFO  L87              Difference]: Start difference. First operand 4008 states and 5979 transitions. Second operand  has 4 states, 4 states have (on average 103.0) internal successors, (412), 4 states have internal predecessors, (412), 0 states have call successors, (0), 0 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-16 21:02:46,027 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 21:02:46,028 INFO  L93              Difference]: Finished difference Result 7519 states and 11215 transitions.
[2025-03-16 21:02:46,028 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-16 21:02:46,028 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 103.0) internal successors, (412), 4 states have internal predecessors, (412), 0 states have call successors, (0), 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 412
[2025-03-16 21:02:46,028 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 21:02:46,032 INFO  L225             Difference]: With dead ends: 7519
[2025-03-16 21:02:46,032 INFO  L226             Difference]: Without dead ends: 4010
[2025-03-16 21:02:46,034 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-16 21:02:46,035 INFO  L435           NwaCegarLoop]: 4529 mSDtfsCounter, 0 mSDsluCounter, 9045 mSDsCounter, 0 mSdLazyCounter, 2733 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 13574 SdHoareTripleChecker+Invalid, 2733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time
[2025-03-16 21:02:46,035 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 13574 Invalid, 2733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2733 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2025-03-16 21:02:46,038 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 4010 states.
[2025-03-16 21:02:46,060 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 4010 to 4010.
[2025-03-16 21:02:46,063 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 4010 states, 4009 states have (on average 1.4918932402095286) internal successors, (5981), 4009 states have internal predecessors, (5981), 0 states have call successors, (0), 0 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-16 21:02:46,067 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4010 states to 4010 states and 5981 transitions.
[2025-03-16 21:02:46,067 INFO  L78                 Accepts]: Start accepts. Automaton has 4010 states and 5981 transitions. Word has length 412
[2025-03-16 21:02:46,068 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 21:02:46,068 INFO  L471      AbstractCegarLoop]: Abstraction has 4010 states and 5981 transitions.
[2025-03-16 21:02:46,068 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 103.0) internal successors, (412), 4 states have internal predecessors, (412), 0 states have call successors, (0), 0 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-16 21:02:46,068 INFO  L276                IsEmpty]: Start isEmpty. Operand 4010 states and 5981 transitions.
[2025-03-16 21:02:46,069 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 414
[2025-03-16 21:02:46,069 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 21:02:46,069 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 21:02:46,070 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32
[2025-03-16 21:02:46,070 INFO  L396      AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 21:02:46,070 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 21:02:46,070 INFO  L85        PathProgramCache]: Analyzing trace with hash 948022372, now seen corresponding path program 1 times
[2025-03-16 21:02:46,070 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 21:02:46,070 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642239056]
[2025-03-16 21:02:46,070 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 21:02:46,070 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 21:02:46,116 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 413 statements into 1 equivalence classes.
[2025-03-16 21:02:46,158 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 413 of 413 statements.
[2025-03-16 21:02:46,158 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 21:02:46,158 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 21:02:46,408 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-16 21:02:46,408 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 21:02:46,408 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642239056]
[2025-03-16 21:02:46,408 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642239056] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 21:02:46,409 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 21:02:46,409 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-16 21:02:46,409 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210761422]
[2025-03-16 21:02:46,409 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 21:02:46,409 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-16 21:02:46,409 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 21:02:46,409 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-16 21:02:46,409 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-16 21:02:46,409 INFO  L87              Difference]: Start difference. First operand 4010 states and 5981 transitions. Second operand  has 4 states, 4 states have (on average 103.25) internal successors, (413), 4 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)