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


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


Checking for ERROR reachability
Using default analysis
Version 798a7b37
Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w64_d64_e0.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 52d00aef82b5670816043b415928b1f8da06c4353549da1577e95fceca21a64d
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-798a7b3-m
[2025-03-03 17:19:35,997 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-03-03 17:19:36,061 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf
[2025-03-03 17:19:36,066 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-03-03 17:19:36,068 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-03-03 17:19:36,089 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-03-03 17:19:36,090 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-03-03 17:19:36,090 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-03-03 17:19:36,091 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-03-03 17:19:36,091 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-03-03 17:19:36,091 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-03-03 17:19:36,091 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-03-03 17:19:36,092 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-03-03 17:19:36,092 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-03-03 17:19:36,092 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-03-03 17:19:36,092 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-03-03 17:19:36,092 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-03-03 17:19:36,092 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-03-03 17:19:36,093 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-03-03 17:19:36,093 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-03-03 17:19:36,093 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-03-03 17:19:36,093 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-03-03 17:19:36,093 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-03-03 17:19:36,093 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-03-03 17:19:36,093 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-03-03 17:19:36,093 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-03-03 17:19:36,093 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-03-03 17:19:36,093 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-03-03 17:19:36,094 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-03-03 17:19:36,094 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-03 17:19:36,094 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-03-03 17:19:36,094 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-03-03 17:19:36,094 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-03-03 17:19:36,094 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-03-03 17:19:36,094 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-03-03 17:19:36,095 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-03-03 17:19:36,095 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-03-03 17:19:36,095 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-03-03 17:19:36,095 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-03-03 17:19:36,095 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-03-03 17:19:36,095 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 -> 52d00aef82b5670816043b415928b1f8da06c4353549da1577e95fceca21a64d
[2025-03-03 17:19:36,329 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-03-03 17:19:36,337 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-03-03 17:19:36,339 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-03-03 17:19:36,341 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-03-03 17:19:36,341 INFO  L274        PluginConnector]: CDTParser initialized
[2025-03-03 17:19:36,343 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w64_d64_e0.c
[2025-03-03 17:19:37,531 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28ec7ffac/fd9126bbf1164e24809d84720d40507d/FLAGa2cbae77a
[2025-03-03 17:19:37,854 INFO  L384              CDTParser]: Found 1 translation units.
[2025-03-03 17:19:37,855 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w64_d64_e0.c
[2025-03-03 17:19:37,869 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28ec7ffac/fd9126bbf1164e24809d84720d40507d/FLAGa2cbae77a
[2025-03-03 17:19:37,880 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28ec7ffac/fd9126bbf1164e24809d84720d40507d
[2025-03-03 17:19:37,882 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-03-03 17:19:37,884 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-03-03 17:19:37,886 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-03-03 17:19:37,886 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-03-03 17:19:37,889 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-03-03 17:19:37,890 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 05:19:37" (1/1) ...
[2025-03-03 17:19:37,892 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6da8056b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:19:37, skipping insertion in model container
[2025-03-03 17:19:37,892 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 05:19:37" (1/1) ...
[2025-03-03 17:19:37,941 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-03-03 17:19:38,079 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.circular_pointer_top_w64_d64_e0.c[1280,1293]
[2025-03-03 17:19:38,360 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-03 17:19:38,367 INFO  L200         MainTranslator]: Completed pre-run
[2025-03-03 17:19:38,374 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.circular_pointer_top_w64_d64_e0.c[1280,1293]
[2025-03-03 17:19:38,524 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-03 17:19:38,535 INFO  L204         MainTranslator]: Completed translation
[2025-03-03 17:19:38,535 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:19:38 WrapperNode
[2025-03-03 17:19:38,535 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-03-03 17:19:38,536 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-03-03 17:19:38,536 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-03-03 17:19:38,536 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-03-03 17:19:38,541 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:19:38" (1/1) ...
[2025-03-03 17:19:38,616 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:19:38" (1/1) ...
[2025-03-03 17:19:38,908 INFO  L138                Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 5532
[2025-03-03 17:19:38,908 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-03-03 17:19:38,909 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-03-03 17:19:38,909 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-03-03 17:19:38,909 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-03-03 17:19:38,916 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:19:38" (1/1) ...
[2025-03-03 17:19:38,917 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:19:38" (1/1) ...
[2025-03-03 17:19:38,976 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:19:38" (1/1) ...
[2025-03-03 17:19:39,135 INFO  L175           MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2025-03-03 17:19:39,135 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:19:38" (1/1) ...
[2025-03-03 17:19:39,136 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:19:38" (1/1) ...
[2025-03-03 17:19:39,255 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:19:38" (1/1) ...
[2025-03-03 17:19:39,277 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:19:38" (1/1) ...
[2025-03-03 17:19:39,299 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:19:38" (1/1) ...
[2025-03-03 17:19:39,327 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:19:38" (1/1) ...
[2025-03-03 17:19:39,415 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-03-03 17:19:39,417 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-03-03 17:19:39,417 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-03-03 17:19:39,418 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-03-03 17:19:39,419 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:19:38" (1/1) ...
[2025-03-03 17:19:39,423 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-03 17:19:39,440 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 17:19:39,469 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2025-03-03 17:19:39,480 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2025-03-03 17:19:39,500 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-03-03 17:19:39,501 INFO  L130     BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2025-03-03 17:19:39,501 INFO  L138     BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2025-03-03 17:19:39,501 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-03-03 17:19:39,501 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-03-03 17:19:39,501 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-03-03 17:19:39,895 INFO  L256             CfgBuilder]: Building ICFG
[2025-03-03 17:19:39,897 INFO  L286             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-03-03 17:19:45,291 INFO  L?                        ?]: Removed 3109 outVars from TransFormulas that were not future-live.
[2025-03-03 17:19:45,291 INFO  L307             CfgBuilder]: Performing block encoding
[2025-03-03 17:19:45,436 INFO  L331             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-03-03 17:19:45,440 INFO  L336             CfgBuilder]: Removed 0 assume(true) statements.
[2025-03-03 17:19:45,440 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 05:19:45 BoogieIcfgContainer
[2025-03-03 17:19:45,440 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-03-03 17:19:45,442 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-03-03 17:19:45,442 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-03-03 17:19:45,445 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-03-03 17:19:45,446 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 05:19:37" (1/3) ...
[2025-03-03 17:19:45,446 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63d0429c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 05:19:45, skipping insertion in model container
[2025-03-03 17:19:45,447 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:19:38" (2/3) ...
[2025-03-03 17:19:45,448 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63d0429c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 05:19:45, skipping insertion in model container
[2025-03-03 17:19:45,448 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 05:19:45" (3/3) ...
[2025-03-03 17:19:45,449 INFO  L128   eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.circular_pointer_top_w64_d64_e0.c
[2025-03-03 17:19:45,460 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-03-03 17:19:45,462 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.circular_pointer_top_w64_d64_e0.c that has 2 procedures, 1512 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-03-03 17:19:45,529 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-03-03 17:19:45,539 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;@645e2b01, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-03-03 17:19:45,540 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-03-03 17:19:45,548 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 1512 states, 1506 states have (on average 1.49800796812749) internal successors, (2256), 1507 states have internal predecessors, (2256), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2025-03-03 17:19:45,568 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 342
[2025-03-03 17:19:45,569 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 17:19:45,569 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 17:19:45,570 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 17:19:45,575 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 17:19:45,575 INFO  L85        PathProgramCache]: Analyzing trace with hash 1180503003, now seen corresponding path program 1 times
[2025-03-03 17:19:45,581 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 17:19:45,582 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424248318]
[2025-03-03 17:19:45,583 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 17:19:45,584 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 17:19:45,802 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 341 statements into 1 equivalence classes.
[2025-03-03 17:19:45,913 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 341 of 341 statements.
[2025-03-03 17:19:45,913 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 17:19:45,913 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 17:19:46,278 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked.
[2025-03-03 17:19:46,279 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 17:19:46,279 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424248318]
[2025-03-03 17:19:46,280 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424248318] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 17:19:46,280 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1123817407]
[2025-03-03 17:19:46,280 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 17:19:46,281 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 17:19:46,281 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 17:19:46,283 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-03 17:19:46,285 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2025-03-03 17:19:46,830 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 341 statements into 1 equivalence classes.
[2025-03-03 17:19:47,076 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 341 of 341 statements.
[2025-03-03 17:19:47,076 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 17:19:47,076 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 17:19:47,090 INFO  L256         TraceCheckSpWp]: Trace formula consists of 2377 conjuncts, 1 conjuncts are in the unsatisfiable core
[2025-03-03 17:19:47,102 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 17:19:47,128 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked.
[2025-03-03 17:19:47,128 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-03 17:19:47,128 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1123817407] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 17:19:47,128 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-03 17:19:47,128 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2
[2025-03-03 17:19:47,134 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170602536]
[2025-03-03 17:19:47,134 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 17:19:47,137 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2025-03-03 17:19:47,138 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 17:19:47,155 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2025-03-03 17:19:47,155 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-03-03 17:19:47,160 INFO  L87              Difference]: Start difference. First operand  has 1512 states, 1506 states have (on average 1.49800796812749) internal successors, (2256), 1507 states have internal predecessors, (2256), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand  has 2 states, 2 states have (on average 165.5) internal successors, (331), 2 states have internal predecessors, (331), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3)
[2025-03-03 17:19:47,561 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 17:19:47,563 INFO  L93              Difference]: Finished difference Result 2727 states and 4085 transitions.
[2025-03-03 17:19:47,563 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2025-03-03 17:19:47,565 INFO  L78                 Accepts]: Start accepts. Automaton has  has 2 states, 2 states have (on average 165.5) internal successors, (331), 2 states have internal predecessors, (331), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 341
[2025-03-03 17:19:47,565 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 17:19:47,578 INFO  L225             Difference]: With dead ends: 2727
[2025-03-03 17:19:47,578 INFO  L226             Difference]: Without dead ends: 1509
[2025-03-03 17:19:47,586 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 342 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-03-03 17:19:47,592 INFO  L435           NwaCegarLoop]: 1884 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1884 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-03-03 17:19:47,592 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1884 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-03-03 17:19:47,606 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1509 states.
[2025-03-03 17:19:47,659 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1509 to 1509.
[2025-03-03 17:19:47,663 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1509 states, 1504 states have (on average 1.4966755319148937) internal successors, (2251), 1504 states have internal predecessors, (2251), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2025-03-03 17:19:47,674 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1509 states to 1509 states and 2257 transitions.
[2025-03-03 17:19:47,677 INFO  L78                 Accepts]: Start accepts. Automaton has 1509 states and 2257 transitions. Word has length 341
[2025-03-03 17:19:47,677 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 17:19:47,678 INFO  L471      AbstractCegarLoop]: Abstraction has 1509 states and 2257 transitions.
[2025-03-03 17:19:47,679 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 165.5) internal successors, (331), 2 states have internal predecessors, (331), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3)
[2025-03-03 17:19:47,679 INFO  L276                IsEmpty]: Start isEmpty. Operand 1509 states and 2257 transitions.
[2025-03-03 17:19:47,682 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 342
[2025-03-03 17:19:47,682 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 17:19:47,682 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 17:19:47,694 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2025-03-03 17:19:47,883 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0
[2025-03-03 17:19:47,884 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 17:19:47,884 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 17:19:47,884 INFO  L85        PathProgramCache]: Analyzing trace with hash -2054262920, now seen corresponding path program 1 times
[2025-03-03 17:19:47,884 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 17:19:47,884 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933994460]
[2025-03-03 17:19:47,885 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 17:19:47,885 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 17:19:47,962 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 341 statements into 1 equivalence classes.
[2025-03-03 17:19:48,353 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 341 of 341 statements.
[2025-03-03 17:19:48,353 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 17:19:48,353 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 17:19:49,627 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-03-03 17:19:49,628 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 17:19:49,628 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933994460]
[2025-03-03 17:19:49,628 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933994460] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 17:19:49,628 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 17:19:49,628 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-03 17:19:49,628 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884547979]
[2025-03-03 17:19:49,628 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 17:19:49,629 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-03 17:19:49,629 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 17:19:49,631 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-03 17:19:49,631 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-03 17:19:49,632 INFO  L87              Difference]: Start difference. First operand 1509 states and 2257 transitions. Second operand  has 4 states, 4 states have (on average 82.25) internal successors, (329), 4 states have internal predecessors, (329), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-03 17:19:50,279 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 17:19:50,280 INFO  L93              Difference]: Finished difference Result 1513 states and 2261 transitions.
[2025-03-03 17:19:50,280 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 17:19:50,280 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 82.25) internal successors, (329), 4 states have internal predecessors, (329), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 341
[2025-03-03 17:19:50,281 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 17:19:50,286 INFO  L225             Difference]: With dead ends: 1513
[2025-03-03 17:19:50,287 INFO  L226             Difference]: Without dead ends: 1511
[2025-03-03 17:19:50,287 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-03 17:19:50,288 INFO  L435           NwaCegarLoop]: 1882 mSDtfsCounter, 0 mSDsluCounter, 3759 mSDsCounter, 0 mSdLazyCounter, 1129 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5641 SdHoareTripleChecker+Invalid, 1129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-03 17:19:50,288 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5641 Invalid, 1129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1129 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-03 17:19:50,290 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1511 states.
[2025-03-03 17:19:50,313 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1511 to 1511.
[2025-03-03 17:19:50,316 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1511 states, 1506 states have (on average 1.49601593625498) internal successors, (2253), 1506 states have internal predecessors, (2253), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2025-03-03 17:19:50,322 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1511 states to 1511 states and 2259 transitions.
[2025-03-03 17:19:50,322 INFO  L78                 Accepts]: Start accepts. Automaton has 1511 states and 2259 transitions. Word has length 341
[2025-03-03 17:19:50,323 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 17:19:50,324 INFO  L471      AbstractCegarLoop]: Abstraction has 1511 states and 2259 transitions.
[2025-03-03 17:19:50,324 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 82.25) internal successors, (329), 4 states have internal predecessors, (329), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-03 17:19:50,324 INFO  L276                IsEmpty]: Start isEmpty. Operand 1511 states and 2259 transitions.
[2025-03-03 17:19:50,328 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 343
[2025-03-03 17:19:50,328 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 17:19:50,328 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 17:19:50,329 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-03-03 17:19:50,329 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 17:19:50,329 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 17:19:50,330 INFO  L85        PathProgramCache]: Analyzing trace with hash 747039563, now seen corresponding path program 1 times
[2025-03-03 17:19:50,330 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 17:19:50,330 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970148599]
[2025-03-03 17:19:50,330 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 17:19:50,330 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 17:19:50,428 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 342 statements into 1 equivalence classes.
[2025-03-03 17:19:50,573 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 342 of 342 statements.
[2025-03-03 17:19:50,573 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 17:19:50,574 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 17:19:51,171 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-03-03 17:19:51,171 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 17:19:51,171 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970148599]
[2025-03-03 17:19:51,171 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970148599] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 17:19:51,171 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 17:19:51,171 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 17:19:51,171 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794834017]
[2025-03-03 17:19:51,171 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 17:19:51,172 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 17:19:51,172 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 17:19:51,172 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 17:19:51,172 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-03 17:19:51,173 INFO  L87              Difference]: Start difference. First operand 1511 states and 2259 transitions. Second operand  has 5 states, 5 states have (on average 66.0) internal successors, (330), 5 states have internal predecessors, (330), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-03 17:19:52,468 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 17:19:52,468 INFO  L93              Difference]: Finished difference Result 3771 states and 5641 transitions.
[2025-03-03 17:19:52,469 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-03-03 17:19:52,469 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 66.0) internal successors, (330), 5 states have internal predecessors, (330), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 342
[2025-03-03 17:19:52,470 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 17:19:52,474 INFO  L225             Difference]: With dead ends: 3771
[2025-03-03 17:19:52,475 INFO  L226             Difference]: Without dead ends: 1511
[2025-03-03 17:19:52,477 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56
[2025-03-03 17:19:52,478 INFO  L435           NwaCegarLoop]: 1869 mSDtfsCounter, 4786 mSDsluCounter, 3411 mSDsCounter, 0 mSdLazyCounter, 1693 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4786 SdHoareTripleChecker+Valid, 5280 SdHoareTripleChecker+Invalid, 1778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 1693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time
[2025-03-03 17:19:52,478 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [4786 Valid, 5280 Invalid, 1778 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 1693 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time]
[2025-03-03 17:19:52,480 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1511 states.
[2025-03-03 17:19:52,496 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1511 to 1511.
[2025-03-03 17:19:52,499 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1511 states, 1506 states have (on average 1.49535192563081) internal successors, (2252), 1506 states have internal predecessors, (2252), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2025-03-03 17:19:52,504 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1511 states to 1511 states and 2258 transitions.
[2025-03-03 17:19:52,504 INFO  L78                 Accepts]: Start accepts. Automaton has 1511 states and 2258 transitions. Word has length 342
[2025-03-03 17:19:52,504 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 17:19:52,505 INFO  L471      AbstractCegarLoop]: Abstraction has 1511 states and 2258 transitions.
[2025-03-03 17:19:52,505 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 66.0) internal successors, (330), 5 states have internal predecessors, (330), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-03 17:19:52,505 INFO  L276                IsEmpty]: Start isEmpty. Operand 1511 states and 2258 transitions.
[2025-03-03 17:19:52,509 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 344
[2025-03-03 17:19:52,509 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 17:19:52,509 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 17:19:52,509 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-03-03 17:19:52,509 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 17:19:52,510 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 17:19:52,510 INFO  L85        PathProgramCache]: Analyzing trace with hash -1246298674, now seen corresponding path program 1 times
[2025-03-03 17:19:52,510 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 17:19:52,510 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659940956]
[2025-03-03 17:19:52,510 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 17:19:52,510 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 17:19:52,592 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 343 statements into 1 equivalence classes.
[2025-03-03 17:19:52,672 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 343 of 343 statements.
[2025-03-03 17:19:52,673 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 17:19:52,673 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 17:19:53,179 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-03-03 17:19:53,180 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 17:19:53,180 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659940956]
[2025-03-03 17:19:53,180 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659940956] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 17:19:53,180 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 17:19:53,180 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-03 17:19:53,180 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426695375]
[2025-03-03 17:19:53,180 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 17:19:53,181 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-03 17:19:53,181 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 17:19:53,181 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-03 17:19:53,181 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-03 17:19:53,182 INFO  L87              Difference]: Start difference. First operand 1511 states and 2258 transitions. Second operand  has 4 states, 4 states have (on average 82.75) internal successors, (331), 4 states have internal predecessors, (331), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-03 17:19:53,759 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 17:19:53,759 INFO  L93              Difference]: Finished difference Result 2730 states and 4079 transitions.
[2025-03-03 17:19:53,760 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 17:19:53,760 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 82.75) internal successors, (331), 4 states have internal predecessors, (331), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 343
[2025-03-03 17:19:53,761 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 17:19:53,766 INFO  L225             Difference]: With dead ends: 2730
[2025-03-03 17:19:53,766 INFO  L226             Difference]: Without dead ends: 1513
[2025-03-03 17:19:53,768 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-03 17:19:53,769 INFO  L435           NwaCegarLoop]: 1881 mSDtfsCounter, 0 mSDsluCounter, 3754 mSDsCounter, 0 mSdLazyCounter, 1132 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5635 SdHoareTripleChecker+Invalid, 1132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-03 17:19:53,770 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5635 Invalid, 1132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1132 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-03 17:19:53,772 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1513 states.
[2025-03-03 17:19:53,790 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1513.
[2025-03-03 17:19:53,792 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1513 states, 1508 states have (on average 1.4946949602122015) internal successors, (2254), 1508 states have internal predecessors, (2254), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2025-03-03 17:19:53,796 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 2260 transitions.
[2025-03-03 17:19:53,797 INFO  L78                 Accepts]: Start accepts. Automaton has 1513 states and 2260 transitions. Word has length 343
[2025-03-03 17:19:53,797 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 17:19:53,797 INFO  L471      AbstractCegarLoop]: Abstraction has 1513 states and 2260 transitions.
[2025-03-03 17:19:53,798 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 82.75) internal successors, (331), 4 states have internal predecessors, (331), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-03 17:19:53,798 INFO  L276                IsEmpty]: Start isEmpty. Operand 1513 states and 2260 transitions.
[2025-03-03 17:19:53,801 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 345
[2025-03-03 17:19:53,801 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 17:19:53,801 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 17:19:53,801 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-03-03 17:19:53,802 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 17:19:53,802 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 17:19:53,802 INFO  L85        PathProgramCache]: Analyzing trace with hash 1950957488, now seen corresponding path program 1 times
[2025-03-03 17:19:53,802 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 17:19:53,802 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702599193]
[2025-03-03 17:19:53,803 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 17:19:53,803 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 17:19:53,887 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 344 statements into 1 equivalence classes.
[2025-03-03 17:19:54,023 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 344 of 344 statements.
[2025-03-03 17:19:54,024 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 17:19:54,024 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 17:19:54,676 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-03-03 17:19:54,676 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 17:19:54,676 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702599193]
[2025-03-03 17:19:54,677 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702599193] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 17:19:54,677 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 17:19:54,677 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-03 17:19:54,677 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048285233]
[2025-03-03 17:19:54,677 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 17:19:54,678 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-03 17:19:54,678 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 17:19:54,679 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-03 17:19:54,679 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-03 17:19:54,679 INFO  L87              Difference]: Start difference. First operand 1513 states and 2260 transitions. Second operand  has 4 states, 4 states have (on average 83.0) internal successors, (332), 4 states have internal predecessors, (332), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-03 17:19:55,633 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 17:19:55,634 INFO  L93              Difference]: Finished difference Result 2732 states and 4080 transitions.
[2025-03-03 17:19:55,634 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 17:19:55,634 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 83.0) internal successors, (332), 4 states have internal predecessors, (332), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 344
[2025-03-03 17:19:55,635 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 17:19:55,640 INFO  L225             Difference]: With dead ends: 2732
[2025-03-03 17:19:55,640 INFO  L226             Difference]: Without dead ends: 1513
[2025-03-03 17:19:55,641 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-03-03 17:19:55,642 INFO  L435           NwaCegarLoop]: 1625 mSDtfsCounter, 1986 mSDsluCounter, 1627 mSDsCounter, 0 mSdLazyCounter, 1262 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1986 SdHoareTripleChecker+Valid, 3252 SdHoareTripleChecker+Invalid, 1262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time
[2025-03-03 17:19:55,642 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1986 Valid, 3252 Invalid, 1262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1262 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2025-03-03 17:19:55,647 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1513 states.
[2025-03-03 17:19:55,669 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1513.
[2025-03-03 17:19:55,672 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1513 states, 1508 states have (on average 1.4940318302387268) internal successors, (2253), 1508 states have internal predecessors, (2253), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2025-03-03 17:19:55,677 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 2259 transitions.
[2025-03-03 17:19:55,677 INFO  L78                 Accepts]: Start accepts. Automaton has 1513 states and 2259 transitions. Word has length 344
[2025-03-03 17:19:55,678 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 17:19:55,678 INFO  L471      AbstractCegarLoop]: Abstraction has 1513 states and 2259 transitions.
[2025-03-03 17:19:55,679 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 83.0) internal successors, (332), 4 states have internal predecessors, (332), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-03 17:19:55,680 INFO  L276                IsEmpty]: Start isEmpty. Operand 1513 states and 2259 transitions.
[2025-03-03 17:19:55,684 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 346
[2025-03-03 17:19:55,684 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 17:19:55,685 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 17:19:55,685 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-03-03 17:19:55,685 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 17:19:55,685 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 17:19:55,686 INFO  L85        PathProgramCache]: Analyzing trace with hash -1277852481, now seen corresponding path program 1 times
[2025-03-03 17:19:55,686 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 17:19:55,686 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241436507]
[2025-03-03 17:19:55,686 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 17:19:55,686 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 17:19:55,787 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 345 statements into 1 equivalence classes.
[2025-03-03 17:19:55,911 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 345 of 345 statements.
[2025-03-03 17:19:55,911 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 17:19:55,912 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 17:19:56,322 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-03-03 17:19:56,324 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 17:19:56,324 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241436507]
[2025-03-03 17:19:56,324 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241436507] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 17:19:56,324 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 17:19:56,324 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 17:19:56,324 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973739631]
[2025-03-03 17:19:56,324 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 17:19:56,325 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 17:19:56,325 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 17:19:56,325 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 17:19:56,325 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-03 17:19:56,326 INFO  L87              Difference]: Start difference. First operand 1513 states and 2259 transitions. Second operand  has 5 states, 5 states have (on average 66.6) internal successors, (333), 5 states have internal predecessors, (333), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-03 17:19:57,185 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 17:19:57,185 INFO  L93              Difference]: Finished difference Result 2742 states and 4092 transitions.
[2025-03-03 17:19:57,185 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-03 17:19:57,186 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 66.6) internal successors, (333), 5 states have internal predecessors, (333), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 345
[2025-03-03 17:19:57,186 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 17:19:57,191 INFO  L225             Difference]: With dead ends: 2742
[2025-03-03 17:19:57,191 INFO  L226             Difference]: Without dead ends: 1513
[2025-03-03 17:19:57,193 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2025-03-03 17:19:57,194 INFO  L435           NwaCegarLoop]: 1872 mSDtfsCounter, 2005 mSDsluCounter, 3501 mSDsCounter, 0 mSdLazyCounter, 1395 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2005 SdHoareTripleChecker+Valid, 5373 SdHoareTripleChecker+Invalid, 1399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time
[2025-03-03 17:19:57,194 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2005 Valid, 5373 Invalid, 1399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1395 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2025-03-03 17:19:57,197 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1513 states.
[2025-03-03 17:19:57,214 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1513.
[2025-03-03 17:19:57,217 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1513 states, 1508 states have (on average 1.493368700265252) internal successors, (2252), 1508 states have internal predecessors, (2252), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2025-03-03 17:19:57,220 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 2258 transitions.
[2025-03-03 17:19:57,221 INFO  L78                 Accepts]: Start accepts. Automaton has 1513 states and 2258 transitions. Word has length 345
[2025-03-03 17:19:57,221 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 17:19:57,221 INFO  L471      AbstractCegarLoop]: Abstraction has 1513 states and 2258 transitions.
[2025-03-03 17:19:57,222 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 66.6) internal successors, (333), 5 states have internal predecessors, (333), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-03 17:19:57,222 INFO  L276                IsEmpty]: Start isEmpty. Operand 1513 states and 2258 transitions.
[2025-03-03 17:19:57,225 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 347
[2025-03-03 17:19:57,225 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 17:19:57,226 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 17:19:57,226 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-03-03 17:19:57,226 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 17:19:57,226 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 17:19:57,226 INFO  L85        PathProgramCache]: Analyzing trace with hash 42775479, now seen corresponding path program 1 times
[2025-03-03 17:19:57,226 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 17:19:57,226 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427720926]
[2025-03-03 17:19:57,227 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 17:19:57,227 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 17:19:57,301 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 346 statements into 1 equivalence classes.
[2025-03-03 17:19:57,396 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 346 of 346 statements.
[2025-03-03 17:19:57,397 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 17:19:57,397 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 17:19:57,727 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-03-03 17:19:57,727 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 17:19:57,727 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427720926]
[2025-03-03 17:19:57,727 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427720926] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 17:19:57,727 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 17:19:57,728 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 17:19:57,728 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543539806]
[2025-03-03 17:19:57,728 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 17:19:57,729 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 17:19:57,729 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 17:19:57,729 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 17:19:57,729 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-03 17:19:57,730 INFO  L87              Difference]: Start difference. First operand 1513 states and 2258 transitions. Second operand  has 5 states, 5 states have (on average 66.8) internal successors, (334), 5 states have internal predecessors, (334), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-03 17:19:58,513 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 17:19:58,513 INFO  L93              Difference]: Finished difference Result 2732 states and 4076 transitions.
[2025-03-03 17:19:58,513 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 17:19:58,514 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 66.8) internal successors, (334), 5 states have internal predecessors, (334), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 346
[2025-03-03 17:19:58,514 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 17:19:58,519 INFO  L225             Difference]: With dead ends: 2732
[2025-03-03 17:19:58,520 INFO  L226             Difference]: Without dead ends: 1513
[2025-03-03 17:19:58,522 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-03-03 17:19:58,522 INFO  L435           NwaCegarLoop]: 1625 mSDtfsCounter, 4231 mSDsluCounter, 1627 mSDsCounter, 0 mSdLazyCounter, 1258 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4234 SdHoareTripleChecker+Valid, 3252 SdHoareTripleChecker+Invalid, 1259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-03-03 17:19:58,522 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [4234 Valid, 3252 Invalid, 1259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1258 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-03-03 17:19:58,524 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1513 states.
[2025-03-03 17:19:58,541 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1513.
[2025-03-03 17:19:58,544 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1513 states, 1508 states have (on average 1.492705570291777) internal successors, (2251), 1508 states have internal predecessors, (2251), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2025-03-03 17:19:58,547 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 2257 transitions.
[2025-03-03 17:19:58,548 INFO  L78                 Accepts]: Start accepts. Automaton has 1513 states and 2257 transitions. Word has length 346
[2025-03-03 17:19:58,548 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 17:19:58,548 INFO  L471      AbstractCegarLoop]: Abstraction has 1513 states and 2257 transitions.
[2025-03-03 17:19:58,548 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 66.8) internal successors, (334), 5 states have internal predecessors, (334), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-03 17:19:58,548 INFO  L276                IsEmpty]: Start isEmpty. Operand 1513 states and 2257 transitions.
[2025-03-03 17:19:58,552 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 348
[2025-03-03 17:19:58,552 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 17:19:58,552 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 17:19:58,552 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-03-03 17:19:58,553 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 17:19:58,553 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 17:19:58,553 INFO  L85        PathProgramCache]: Analyzing trace with hash -38876156, now seen corresponding path program 1 times
[2025-03-03 17:19:58,553 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 17:19:58,553 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536629565]
[2025-03-03 17:19:58,553 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 17:19:58,553 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 17:19:58,630 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 347 statements into 1 equivalence classes.
[2025-03-03 17:19:58,698 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 347 of 347 statements.
[2025-03-03 17:19:58,699 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 17:19:58,699 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 17:19:59,095 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-03-03 17:19:59,098 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 17:19:59,098 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536629565]
[2025-03-03 17:19:59,098 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536629565] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 17:19:59,098 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 17:19:59,098 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 17:19:59,098 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353954293]
[2025-03-03 17:19:59,098 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 17:19:59,099 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 17:19:59,099 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 17:19:59,099 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 17:19:59,099 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-03 17:19:59,100 INFO  L87              Difference]: Start difference. First operand 1513 states and 2257 transitions. Second operand  has 5 states, 5 states have (on average 67.0) internal successors, (335), 5 states have internal predecessors, (335), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-03 17:19:59,758 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 17:19:59,758 INFO  L93              Difference]: Finished difference Result 2732 states and 4074 transitions.
[2025-03-03 17:19:59,758 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 17:19:59,759 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 67.0) internal successors, (335), 5 states have internal predecessors, (335), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 347
[2025-03-03 17:19:59,759 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 17:19:59,763 INFO  L225             Difference]: With dead ends: 2732
[2025-03-03 17:19:59,763 INFO  L226             Difference]: Without dead ends: 1513
[2025-03-03 17:19:59,764 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-03-03 17:19:59,764 INFO  L435           NwaCegarLoop]: 1625 mSDtfsCounter, 2238 mSDsluCounter, 1634 mSDsCounter, 0 mSdLazyCounter, 1256 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2241 SdHoareTripleChecker+Valid, 3259 SdHoareTripleChecker+Invalid, 1257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-03 17:19:59,765 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2241 Valid, 3259 Invalid, 1257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1256 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-03 17:19:59,766 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1513 states.
[2025-03-03 17:19:59,782 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1513.
[2025-03-03 17:19:59,784 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1513 states, 1508 states have (on average 1.4920424403183024) internal successors, (2250), 1508 states have internal predecessors, (2250), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2025-03-03 17:19:59,787 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 2256 transitions.
[2025-03-03 17:19:59,789 INFO  L78                 Accepts]: Start accepts. Automaton has 1513 states and 2256 transitions. Word has length 347
[2025-03-03 17:19:59,789 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 17:19:59,791 INFO  L471      AbstractCegarLoop]: Abstraction has 1513 states and 2256 transitions.
[2025-03-03 17:19:59,791 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 67.0) internal successors, (335), 5 states have internal predecessors, (335), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-03 17:19:59,791 INFO  L276                IsEmpty]: Start isEmpty. Operand 1513 states and 2256 transitions.
[2025-03-03 17:19:59,793 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 349
[2025-03-03 17:19:59,793 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 17:19:59,793 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 17:19:59,794 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-03-03 17:19:59,794 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 17:19:59,794 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 17:19:59,795 INFO  L85        PathProgramCache]: Analyzing trace with hash 1637511900, now seen corresponding path program 1 times
[2025-03-03 17:19:59,795 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 17:19:59,795 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448540012]
[2025-03-03 17:19:59,795 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 17:19:59,795 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 17:19:59,871 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 348 statements into 1 equivalence classes.
[2025-03-03 17:19:59,965 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 348 of 348 statements.
[2025-03-03 17:19:59,965 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 17:19:59,965 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 17:20:00,317 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-03-03 17:20:00,318 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 17:20:00,318 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448540012]
[2025-03-03 17:20:00,318 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448540012] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 17:20:00,318 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 17:20:00,318 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 17:20:00,318 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931732100]
[2025-03-03 17:20:00,318 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 17:20:00,319 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 17:20:00,319 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 17:20:00,319 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 17:20:00,319 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-03 17:20:00,320 INFO  L87              Difference]: Start difference. First operand 1513 states and 2256 transitions. Second operand  has 5 states, 5 states have (on average 67.2) internal successors, (336), 5 states have internal predecessors, (336), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-03 17:20:01,070 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 17:20:01,070 INFO  L93              Difference]: Finished difference Result 2732 states and 4072 transitions.
[2025-03-03 17:20:01,070 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 17:20:01,070 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 67.2) internal successors, (336), 5 states have internal predecessors, (336), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 348
[2025-03-03 17:20:01,071 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 17:20:01,074 INFO  L225             Difference]: With dead ends: 2732
[2025-03-03 17:20:01,074 INFO  L226             Difference]: Without dead ends: 1513
[2025-03-03 17:20:01,075 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-03-03 17:20:01,076 INFO  L435           NwaCegarLoop]: 1625 mSDtfsCounter, 4215 mSDsluCounter, 1627 mSDsCounter, 0 mSdLazyCounter, 1254 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4218 SdHoareTripleChecker+Valid, 3252 SdHoareTripleChecker+Invalid, 1255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-03-03 17:20:01,076 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [4218 Valid, 3252 Invalid, 1255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1254 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-03-03 17:20:01,078 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1513 states.
[2025-03-03 17:20:01,090 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1513.
[2025-03-03 17:20:01,092 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1513 states, 1508 states have (on average 1.4913793103448276) internal successors, (2249), 1508 states have internal predecessors, (2249), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2025-03-03 17:20:01,094 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 2255 transitions.
[2025-03-03 17:20:01,095 INFO  L78                 Accepts]: Start accepts. Automaton has 1513 states and 2255 transitions. Word has length 348
[2025-03-03 17:20:01,095 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 17:20:01,095 INFO  L471      AbstractCegarLoop]: Abstraction has 1513 states and 2255 transitions.
[2025-03-03 17:20:01,095 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 67.2) internal successors, (336), 5 states have internal predecessors, (336), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-03 17:20:01,095 INFO  L276                IsEmpty]: Start isEmpty. Operand 1513 states and 2255 transitions.
[2025-03-03 17:20:01,097 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 350
[2025-03-03 17:20:01,097 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 17:20:01,097 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 17:20:01,097 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-03-03 17:20:01,098 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 17:20:01,098 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 17:20:01,098 INFO  L85        PathProgramCache]: Analyzing trace with hash -910689847, now seen corresponding path program 1 times
[2025-03-03 17:20:01,098 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 17:20:01,098 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327150686]
[2025-03-03 17:20:01,098 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 17:20:01,098 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 17:20:01,168 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 349 statements into 1 equivalence classes.
[2025-03-03 17:20:01,239 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 349 of 349 statements.
[2025-03-03 17:20:01,239 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 17:20:01,239 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 17:20:01,549 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-03-03 17:20:01,549 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 17:20:01,549 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327150686]
[2025-03-03 17:20:01,549 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327150686] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 17:20:01,550 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 17:20:01,550 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 17:20:01,550 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883884799]
[2025-03-03 17:20:01,550 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 17:20:01,550 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 17:20:01,550 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 17:20:01,551 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 17:20:01,551 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-03 17:20:01,551 INFO  L87              Difference]: Start difference. First operand 1513 states and 2255 transitions. Second operand  has 5 states, 5 states have (on average 67.4) internal successors, (337), 5 states have internal predecessors, (337), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-03 17:20:02,277 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 17:20:02,277 INFO  L93              Difference]: Finished difference Result 2732 states and 4070 transitions.
[2025-03-03 17:20:02,277 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 17:20:02,278 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 67.4) internal successors, (337), 5 states have internal predecessors, (337), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 349
[2025-03-03 17:20:02,278 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 17:20:02,281 INFO  L225             Difference]: With dead ends: 2732
[2025-03-03 17:20:02,281 INFO  L226             Difference]: Without dead ends: 1513
[2025-03-03 17:20:02,282 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-03-03 17:20:02,282 INFO  L435           NwaCegarLoop]: 1625 mSDtfsCounter, 4207 mSDsluCounter, 1627 mSDsCounter, 0 mSdLazyCounter, 1252 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4210 SdHoareTripleChecker+Valid, 3252 SdHoareTripleChecker+Invalid, 1253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-03-03 17:20:02,282 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [4210 Valid, 3252 Invalid, 1253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1252 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-03-03 17:20:02,283 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1513 states.
[2025-03-03 17:20:02,295 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1513.
[2025-03-03 17:20:02,298 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1513 states, 1508 states have (on average 1.490716180371353) internal successors, (2248), 1508 states have internal predecessors, (2248), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2025-03-03 17:20:02,299 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 2254 transitions.
[2025-03-03 17:20:02,300 INFO  L78                 Accepts]: Start accepts. Automaton has 1513 states and 2254 transitions. Word has length 349
[2025-03-03 17:20:02,300 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 17:20:02,300 INFO  L471      AbstractCegarLoop]: Abstraction has 1513 states and 2254 transitions.
[2025-03-03 17:20:02,300 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 67.4) internal successors, (337), 5 states have internal predecessors, (337), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-03 17:20:02,301 INFO  L276                IsEmpty]: Start isEmpty. Operand 1513 states and 2254 transitions.
[2025-03-03 17:20:02,302 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 351
[2025-03-03 17:20:02,302 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 17:20:02,302 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 17:20:02,302 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-03-03 17:20:02,302 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 17:20:02,303 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 17:20:02,303 INFO  L85        PathProgramCache]: Analyzing trace with hash -873492351, now seen corresponding path program 1 times
[2025-03-03 17:20:02,303 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 17:20:02,303 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783788552]
[2025-03-03 17:20:02,303 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 17:20:02,303 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 17:20:02,381 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 350 statements into 1 equivalence classes.
[2025-03-03 17:20:02,454 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 350 of 350 statements.
[2025-03-03 17:20:02,454 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 17:20:02,455 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 17:20:02,725 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-03-03 17:20:02,726 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 17:20:02,726 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783788552]
[2025-03-03 17:20:02,726 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783788552] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 17:20:02,726 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 17:20:02,726 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 17:20:02,727 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871994238]
[2025-03-03 17:20:02,727 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 17:20:02,727 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 17:20:02,727 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 17:20:02,727 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 17:20:02,728 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-03 17:20:02,728 INFO  L87              Difference]: Start difference. First operand 1513 states and 2254 transitions. Second operand  has 5 states, 5 states have (on average 67.6) internal successors, (338), 5 states have internal predecessors, (338), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-03 17:20:03,377 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 17:20:03,377 INFO  L93              Difference]: Finished difference Result 2732 states and 4068 transitions.
[2025-03-03 17:20:03,377 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 17:20:03,378 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 67.6) internal successors, (338), 5 states have internal predecessors, (338), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 350
[2025-03-03 17:20:03,378 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 17:20:03,381 INFO  L225             Difference]: With dead ends: 2732
[2025-03-03 17:20:03,382 INFO  L226             Difference]: Without dead ends: 1513
[2025-03-03 17:20:03,383 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-03-03 17:20:03,383 INFO  L435           NwaCegarLoop]: 1625 mSDtfsCounter, 4193 mSDsluCounter, 1627 mSDsCounter, 0 mSdLazyCounter, 1250 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4196 SdHoareTripleChecker+Valid, 3252 SdHoareTripleChecker+Invalid, 1251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-03 17:20:03,383 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [4196 Valid, 3252 Invalid, 1251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1250 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-03 17:20:03,384 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1513 states.
[2025-03-03 17:20:03,395 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1513.
[2025-03-03 17:20:03,397 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1513 states, 1508 states have (on average 1.490053050397878) internal successors, (2247), 1508 states have internal predecessors, (2247), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2025-03-03 17:20:03,401 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 2253 transitions.
[2025-03-03 17:20:03,401 INFO  L78                 Accepts]: Start accepts. Automaton has 1513 states and 2253 transitions. Word has length 350
[2025-03-03 17:20:03,402 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 17:20:03,402 INFO  L471      AbstractCegarLoop]: Abstraction has 1513 states and 2253 transitions.
[2025-03-03 17:20:03,402 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 67.6) internal successors, (338), 5 states have internal predecessors, (338), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-03 17:20:03,402 INFO  L276                IsEmpty]: Start isEmpty. Operand 1513 states and 2253 transitions.
[2025-03-03 17:20:03,403 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 352
[2025-03-03 17:20:03,403 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 17:20:03,404 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 17:20:03,404 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-03-03 17:20:03,404 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 17:20:03,404 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 17:20:03,404 INFO  L85        PathProgramCache]: Analyzing trace with hash 1651793641, now seen corresponding path program 1 times
[2025-03-03 17:20:03,404 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 17:20:03,404 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524058698]
[2025-03-03 17:20:03,404 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 17:20:03,404 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 17:20:03,473 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 351 statements into 1 equivalence classes.
[2025-03-03 17:20:03,587 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 351 of 351 statements.
[2025-03-03 17:20:03,588 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 17:20:03,588 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 17:20:03,934 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-03-03 17:20:03,934 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 17:20:03,934 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524058698]
[2025-03-03 17:20:03,935 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524058698] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 17:20:03,935 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 17:20:03,935 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 17:20:03,935 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533536100]
[2025-03-03 17:20:03,935 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 17:20:03,935 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 17:20:03,936 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 17:20:03,936 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 17:20:03,936 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-03 17:20:03,936 INFO  L87              Difference]: Start difference. First operand 1513 states and 2253 transitions. Second operand  has 5 states, 5 states have (on average 67.8) internal successors, (339), 5 states have internal predecessors, (339), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-03 17:20:04,670 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 17:20:04,670 INFO  L93              Difference]: Finished difference Result 2732 states and 4066 transitions.
[2025-03-03 17:20:04,670 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 17:20:04,670 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 67.8) internal successors, (339), 5 states have internal predecessors, (339), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 351
[2025-03-03 17:20:04,671 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 17:20:04,674 INFO  L225             Difference]: With dead ends: 2732
[2025-03-03 17:20:04,674 INFO  L226             Difference]: Without dead ends: 1513
[2025-03-03 17:20:04,675 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-03-03 17:20:04,675 INFO  L435           NwaCegarLoop]: 1625 mSDtfsCounter, 4185 mSDsluCounter, 1627 mSDsCounter, 0 mSdLazyCounter, 1248 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4188 SdHoareTripleChecker+Valid, 3252 SdHoareTripleChecker+Invalid, 1249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-03-03 17:20:04,676 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [4188 Valid, 3252 Invalid, 1249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1248 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-03-03 17:20:04,677 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1513 states.
[2025-03-03 17:20:04,688 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1513.
[2025-03-03 17:20:04,690 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1513 states, 1508 states have (on average 1.4893899204244032) internal successors, (2246), 1508 states have internal predecessors, (2246), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2025-03-03 17:20:04,691 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 2252 transitions.
[2025-03-03 17:20:04,691 INFO  L78                 Accepts]: Start accepts. Automaton has 1513 states and 2252 transitions. Word has length 351
[2025-03-03 17:20:04,691 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 17:20:04,693 INFO  L471      AbstractCegarLoop]: Abstraction has 1513 states and 2252 transitions.
[2025-03-03 17:20:04,693 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 67.8) internal successors, (339), 5 states have internal predecessors, (339), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-03 17:20:04,694 INFO  L276                IsEmpty]: Start isEmpty. Operand 1513 states and 2252 transitions.
[2025-03-03 17:20:04,695 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 353
[2025-03-03 17:20:04,695 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 17:20:04,695 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 17:20:04,695 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2025-03-03 17:20:04,695 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 17:20:04,696 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 17:20:04,696 INFO  L85        PathProgramCache]: Analyzing trace with hash -1145509604, now seen corresponding path program 1 times
[2025-03-03 17:20:04,696 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 17:20:04,697 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459807441]
[2025-03-03 17:20:04,697 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 17:20:04,697 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 17:20:04,764 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 352 statements into 1 equivalence classes.
[2025-03-03 17:20:04,825 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 352 of 352 statements.
[2025-03-03 17:20:04,826 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 17:20:04,826 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 17:20:05,139 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-03-03 17:20:05,140 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 17:20:05,140 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459807441]
[2025-03-03 17:20:05,140 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459807441] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 17:20:05,140 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 17:20:05,140 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 17:20:05,140 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653480053]
[2025-03-03 17:20:05,140 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 17:20:05,140 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 17:20:05,141 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 17:20:05,141 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 17:20:05,141 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-03 17:20:05,141 INFO  L87              Difference]: Start difference. First operand 1513 states and 2252 transitions. Second operand  has 5 states, 5 states have (on average 68.0) internal successors, (340), 5 states have internal predecessors, (340), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-03 17:20:05,795 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 17:20:05,795 INFO  L93              Difference]: Finished difference Result 2732 states and 4064 transitions.
[2025-03-03 17:20:05,796 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 17:20:05,797 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 68.0) internal successors, (340), 5 states have internal predecessors, (340), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 352
[2025-03-03 17:20:05,797 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 17:20:05,801 INFO  L225             Difference]: With dead ends: 2732
[2025-03-03 17:20:05,801 INFO  L226             Difference]: Without dead ends: 1513
[2025-03-03 17:20:05,803 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-03-03 17:20:05,803 INFO  L435           NwaCegarLoop]: 1625 mSDtfsCounter, 4177 mSDsluCounter, 1627 mSDsCounter, 0 mSdLazyCounter, 1246 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4180 SdHoareTripleChecker+Valid, 3252 SdHoareTripleChecker+Invalid, 1247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-03 17:20:05,803 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [4180 Valid, 3252 Invalid, 1247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1246 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-03 17:20:05,805 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1513 states.
[2025-03-03 17:20:05,818 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1513.
[2025-03-03 17:20:05,820 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1513 states, 1508 states have (on average 1.4887267904509285) internal successors, (2245), 1508 states have internal predecessors, (2245), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2025-03-03 17:20:05,822 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 2251 transitions.
[2025-03-03 17:20:05,822 INFO  L78                 Accepts]: Start accepts. Automaton has 1513 states and 2251 transitions. Word has length 352
[2025-03-03 17:20:05,823 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 17:20:05,823 INFO  L471      AbstractCegarLoop]: Abstraction has 1513 states and 2251 transitions.
[2025-03-03 17:20:05,823 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 68.0) internal successors, (340), 5 states have internal predecessors, (340), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-03 17:20:05,823 INFO  L276                IsEmpty]: Start isEmpty. Operand 1513 states and 2251 transitions.
[2025-03-03 17:20:05,825 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 354
[2025-03-03 17:20:05,825 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 17:20:05,826 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 17:20:05,826 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2025-03-03 17:20:05,826 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 17:20:05,826 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 17:20:05,827 INFO  L85        PathProgramCache]: Analyzing trace with hash -330736732, now seen corresponding path program 1 times
[2025-03-03 17:20:05,827 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 17:20:05,827 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122519123]
[2025-03-03 17:20:05,827 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 17:20:05,827 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 17:20:05,915 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 353 statements into 1 equivalence classes.
[2025-03-03 17:20:05,995 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 353 of 353 statements.
[2025-03-03 17:20:05,996 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 17:20:05,996 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 17:20:06,356 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-03-03 17:20:06,356 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 17:20:06,356 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122519123]
[2025-03-03 17:20:06,357 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122519123] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 17:20:06,357 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 17:20:06,357 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 17:20:06,357 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145703999]
[2025-03-03 17:20:06,357 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 17:20:06,358 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 17:20:06,358 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 17:20:06,359 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 17:20:06,359 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-03 17:20:06,359 INFO  L87              Difference]: Start difference. First operand 1513 states and 2251 transitions. Second operand  has 5 states, 5 states have (on average 68.2) internal successors, (341), 5 states have internal predecessors, (341), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-03 17:20:07,043 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 17:20:07,043 INFO  L93              Difference]: Finished difference Result 2732 states and 4062 transitions.
[2025-03-03 17:20:07,043 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 17:20:07,044 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 68.2) internal successors, (341), 5 states have internal predecessors, (341), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 353
[2025-03-03 17:20:07,044 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 17:20:07,048 INFO  L225             Difference]: With dead ends: 2732
[2025-03-03 17:20:07,048 INFO  L226             Difference]: Without dead ends: 1513
[2025-03-03 17:20:07,050 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-03-03 17:20:07,050 INFO  L435           NwaCegarLoop]: 1625 mSDtfsCounter, 2211 mSDsluCounter, 1634 mSDsCounter, 0 mSdLazyCounter, 1244 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2214 SdHoareTripleChecker+Valid, 3259 SdHoareTripleChecker+Invalid, 1245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-03 17:20:07,050 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2214 Valid, 3259 Invalid, 1245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1244 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-03 17:20:07,053 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1513 states.
[2025-03-03 17:20:07,065 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1513.
[2025-03-03 17:20:07,067 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1513 states, 1508 states have (on average 1.4880636604774535) internal successors, (2244), 1508 states have internal predecessors, (2244), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2025-03-03 17:20:07,069 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 2250 transitions.
[2025-03-03 17:20:07,069 INFO  L78                 Accepts]: Start accepts. Automaton has 1513 states and 2250 transitions. Word has length 353
[2025-03-03 17:20:07,069 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 17:20:07,069 INFO  L471      AbstractCegarLoop]: Abstraction has 1513 states and 2250 transitions.
[2025-03-03 17:20:07,070 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 68.2) internal successors, (341), 5 states have internal predecessors, (341), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-03 17:20:07,070 INFO  L276                IsEmpty]: Start isEmpty. Operand 1513 states and 2250 transitions.
[2025-03-03 17:20:07,072 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 355
[2025-03-03 17:20:07,072 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 17:20:07,072 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 17:20:07,072 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2025-03-03 17:20:07,072 INFO  L396      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 17:20:07,073 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 17:20:07,073 INFO  L85        PathProgramCache]: Analyzing trace with hash -1716860105, now seen corresponding path program 1 times
[2025-03-03 17:20:07,073 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 17:20:07,073 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485634471]
[2025-03-03 17:20:07,073 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 17:20:07,073 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 17:20:07,159 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 354 statements into 1 equivalence classes.
[2025-03-03 17:20:07,257 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 354 of 354 statements.
[2025-03-03 17:20:07,258 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 17:20:07,258 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 17:20:07,547 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-03-03 17:20:07,548 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 17:20:07,548 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485634471]
[2025-03-03 17:20:07,548 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485634471] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 17:20:07,548 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 17:20:07,548 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 17:20:07,548 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960076846]
[2025-03-03 17:20:07,549 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 17:20:07,550 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 17:20:07,550 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 17:20:07,550 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 17:20:07,550 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-03 17:20:07,551 INFO  L87              Difference]: Start difference. First operand 1513 states and 2250 transitions. Second operand  has 5 states, 5 states have (on average 68.4) internal successors, (342), 5 states have internal predecessors, (342), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-03 17:20:08,195 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 17:20:08,195 INFO  L93              Difference]: Finished difference Result 2732 states and 4060 transitions.
[2025-03-03 17:20:08,195 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 17:20:08,195 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 68.4) internal successors, (342), 5 states have internal predecessors, (342), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 354
[2025-03-03 17:20:08,196 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 17:20:08,199 INFO  L225             Difference]: With dead ends: 2732
[2025-03-03 17:20:08,199 INFO  L226             Difference]: Without dead ends: 1513
[2025-03-03 17:20:08,200 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-03-03 17:20:08,200 INFO  L435           NwaCegarLoop]: 1625 mSDtfsCounter, 2207 mSDsluCounter, 1634 mSDsCounter, 0 mSdLazyCounter, 1242 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2210 SdHoareTripleChecker+Valid, 3259 SdHoareTripleChecker+Invalid, 1243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-03 17:20:08,200 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2210 Valid, 3259 Invalid, 1243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1242 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-03 17:20:08,202 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1513 states.
[2025-03-03 17:20:08,211 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1513.
[2025-03-03 17:20:08,212 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1513 states, 1508 states have (on average 1.4874005305039788) internal successors, (2243), 1508 states have internal predecessors, (2243), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2025-03-03 17:20:08,213 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 2249 transitions.
[2025-03-03 17:20:08,213 INFO  L78                 Accepts]: Start accepts. Automaton has 1513 states and 2249 transitions. Word has length 354
[2025-03-03 17:20:08,213 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 17:20:08,213 INFO  L471      AbstractCegarLoop]: Abstraction has 1513 states and 2249 transitions.
[2025-03-03 17:20:08,213 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 68.4) internal successors, (342), 5 states have internal predecessors, (342), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-03 17:20:08,213 INFO  L276                IsEmpty]: Start isEmpty. Operand 1513 states and 2249 transitions.
[2025-03-03 17:20:08,215 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 356
[2025-03-03 17:20:08,215 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 17:20:08,215 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 17:20:08,215 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2025-03-03 17:20:08,215 INFO  L396      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 17:20:08,215 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 17:20:08,216 INFO  L85        PathProgramCache]: Analyzing trace with hash 112355807, now seen corresponding path program 1 times
[2025-03-03 17:20:08,216 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 17:20:08,216 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447311412]
[2025-03-03 17:20:08,216 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 17:20:08,216 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 17:20:08,289 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 355 statements into 1 equivalence classes.
[2025-03-03 17:20:08,346 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 355 of 355 statements.
[2025-03-03 17:20:08,347 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 17:20:08,347 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 17:20:08,638 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-03-03 17:20:08,639 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 17:20:08,639 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447311412]
[2025-03-03 17:20:08,639 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447311412] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 17:20:08,639 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 17:20:08,639 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 17:20:08,639 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292582151]
[2025-03-03 17:20:08,639 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 17:20:08,640 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 17:20:08,640 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 17:20:08,640 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 17:20:08,640 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-03 17:20:08,640 INFO  L87              Difference]: Start difference. First operand 1513 states and 2249 transitions. Second operand  has 5 states, 5 states have (on average 68.6) internal successors, (343), 5 states have internal predecessors, (343), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-03 17:20:09,249 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 17:20:09,250 INFO  L93              Difference]: Finished difference Result 2732 states and 4058 transitions.
[2025-03-03 17:20:09,250 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 17:20:09,250 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 68.6) internal successors, (343), 5 states have internal predecessors, (343), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 355
[2025-03-03 17:20:09,250 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 17:20:09,253 INFO  L225             Difference]: With dead ends: 2732
[2025-03-03 17:20:09,254 INFO  L226             Difference]: Without dead ends: 1513
[2025-03-03 17:20:09,255 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-03-03 17:20:09,255 INFO  L435           NwaCegarLoop]: 1625 mSDtfsCounter, 4153 mSDsluCounter, 1627 mSDsCounter, 0 mSdLazyCounter, 1240 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4156 SdHoareTripleChecker+Valid, 3252 SdHoareTripleChecker+Invalid, 1241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-03 17:20:09,255 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [4156 Valid, 3252 Invalid, 1241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1240 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-03 17:20:09,257 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1513 states.
[2025-03-03 17:20:09,266 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1513.
[2025-03-03 17:20:09,267 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1513 states, 1508 states have (on average 1.486737400530504) internal successors, (2242), 1508 states have internal predecessors, (2242), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2025-03-03 17:20:09,269 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 2248 transitions.
[2025-03-03 17:20:09,269 INFO  L78                 Accepts]: Start accepts. Automaton has 1513 states and 2248 transitions. Word has length 355
[2025-03-03 17:20:09,269 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 17:20:09,269 INFO  L471      AbstractCegarLoop]: Abstraction has 1513 states and 2248 transitions.
[2025-03-03 17:20:09,269 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 68.6) internal successors, (343), 5 states have internal predecessors, (343), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-03 17:20:09,269 INFO  L276                IsEmpty]: Start isEmpty. Operand 1513 states and 2248 transitions.
[2025-03-03 17:20:09,271 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 357
[2025-03-03 17:20:09,271 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 17:20:09,271 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 17:20:09,271 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2025-03-03 17:20:09,271 INFO  L396      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 17:20:09,272 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 17:20:09,272 INFO  L85        PathProgramCache]: Analyzing trace with hash 1830090450, now seen corresponding path program 1 times
[2025-03-03 17:20:09,272 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 17:20:09,272 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172329798]
[2025-03-03 17:20:09,272 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 17:20:09,272 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 17:20:09,340 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 356 statements into 1 equivalence classes.
[2025-03-03 17:20:09,402 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 356 of 356 statements.
[2025-03-03 17:20:09,402 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 17:20:09,402 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 17:20:09,679 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-03-03 17:20:09,679 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 17:20:09,679 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172329798]
[2025-03-03 17:20:09,679 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172329798] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 17:20:09,679 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 17:20:09,679 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 17:20:09,679 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294891255]
[2025-03-03 17:20:09,679 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 17:20:09,680 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 17:20:09,680 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 17:20:09,680 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 17:20:09,680 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-03 17:20:09,680 INFO  L87              Difference]: Start difference. First operand 1513 states and 2248 transitions. Second operand  has 5 states, 5 states have (on average 68.8) internal successors, (344), 5 states have internal predecessors, (344), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-03 17:20:10,290 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 17:20:10,291 INFO  L93              Difference]: Finished difference Result 2732 states and 4056 transitions.
[2025-03-03 17:20:10,291 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 17:20:10,292 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 68.8) internal successors, (344), 5 states have internal predecessors, (344), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 356
[2025-03-03 17:20:10,292 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 17:20:10,295 INFO  L225             Difference]: With dead ends: 2732
[2025-03-03 17:20:10,295 INFO  L226             Difference]: Without dead ends: 1513
[2025-03-03 17:20:10,296 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-03-03 17:20:10,297 INFO  L435           NwaCegarLoop]: 1625 mSDtfsCounter, 2199 mSDsluCounter, 1634 mSDsCounter, 0 mSdLazyCounter, 1238 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2202 SdHoareTripleChecker+Valid, 3259 SdHoareTripleChecker+Invalid, 1239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-03 17:20:10,298 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2202 Valid, 3259 Invalid, 1239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1238 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-03 17:20:10,300 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1513 states.
[2025-03-03 17:20:10,308 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1513.
[2025-03-03 17:20:10,309 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1513 states, 1508 states have (on average 1.4860742705570291) internal successors, (2241), 1508 states have internal predecessors, (2241), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2025-03-03 17:20:10,310 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 2247 transitions.
[2025-03-03 17:20:10,310 INFO  L78                 Accepts]: Start accepts. Automaton has 1513 states and 2247 transitions. Word has length 356
[2025-03-03 17:20:10,311 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 17:20:10,311 INFO  L471      AbstractCegarLoop]: Abstraction has 1513 states and 2247 transitions.
[2025-03-03 17:20:10,311 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 68.8) internal successors, (344), 5 states have internal predecessors, (344), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-03 17:20:10,311 INFO  L276                IsEmpty]: Start isEmpty. Operand 1513 states and 2247 transitions.
[2025-03-03 17:20:10,312 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 358
[2025-03-03 17:20:10,312 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 17:20:10,312 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 17:20:10,312 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2025-03-03 17:20:10,312 INFO  L396      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 17:20:10,313 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 17:20:10,313 INFO  L85        PathProgramCache]: Analyzing trace with hash 1891977626, now seen corresponding path program 1 times
[2025-03-03 17:20:10,313 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 17:20:10,313 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936296189]
[2025-03-03 17:20:10,313 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 17:20:10,313 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 17:20:10,404 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 357 statements into 1 equivalence classes.
[2025-03-03 17:20:10,500 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 357 of 357 statements.
[2025-03-03 17:20:10,500 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 17:20:10,500 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 17:20:10,837 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-03-03 17:20:10,837 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 17:20:10,837 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936296189]
[2025-03-03 17:20:10,837 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936296189] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 17:20:10,837 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 17:20:10,837 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 17:20:10,837 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157114113]
[2025-03-03 17:20:10,837 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 17:20:10,838 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 17:20:10,838 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 17:20:10,839 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 17:20:10,839 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-03 17:20:10,839 INFO  L87              Difference]: Start difference. First operand 1513 states and 2247 transitions. Second operand  has 5 states, 5 states have (on average 69.0) internal successors, (345), 5 states have internal predecessors, (345), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-03 17:20:11,459 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 17:20:11,459 INFO  L93              Difference]: Finished difference Result 2732 states and 4054 transitions.
[2025-03-03 17:20:11,459 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 17:20:11,460 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 69.0) internal successors, (345), 5 states have internal predecessors, (345), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 357
[2025-03-03 17:20:11,460 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 17:20:11,463 INFO  L225             Difference]: With dead ends: 2732
[2025-03-03 17:20:11,463 INFO  L226             Difference]: Without dead ends: 1513
[2025-03-03 17:20:11,464 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-03-03 17:20:11,464 INFO  L435           NwaCegarLoop]: 1625 mSDtfsCounter, 2195 mSDsluCounter, 1634 mSDsCounter, 0 mSdLazyCounter, 1236 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2198 SdHoareTripleChecker+Valid, 3259 SdHoareTripleChecker+Invalid, 1237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-03 17:20:11,465 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2198 Valid, 3259 Invalid, 1237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1236 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-03 17:20:11,466 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1513 states.
[2025-03-03 17:20:11,475 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1513.
[2025-03-03 17:20:11,476 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1513 states, 1508 states have (on average 1.4854111405835544) internal successors, (2240), 1508 states have internal predecessors, (2240), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2025-03-03 17:20:11,477 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 2246 transitions.
[2025-03-03 17:20:11,477 INFO  L78                 Accepts]: Start accepts. Automaton has 1513 states and 2246 transitions. Word has length 357
[2025-03-03 17:20:11,477 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 17:20:11,477 INFO  L471      AbstractCegarLoop]: Abstraction has 1513 states and 2246 transitions.
[2025-03-03 17:20:11,477 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 69.0) internal successors, (345), 5 states have internal predecessors, (345), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-03 17:20:11,477 INFO  L276                IsEmpty]: Start isEmpty. Operand 1513 states and 2246 transitions.
[2025-03-03 17:20:11,479 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 359
[2025-03-03 17:20:11,479 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 17:20:11,479 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 17:20:11,479 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2025-03-03 17:20:11,479 INFO  L396      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 17:20:11,479 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 17:20:11,479 INFO  L85        PathProgramCache]: Analyzing trace with hash 1936141293, now seen corresponding path program 1 times
[2025-03-03 17:20:11,480 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 17:20:11,480 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270187589]
[2025-03-03 17:20:11,480 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 17:20:11,480 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 17:20:11,546 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 358 statements into 1 equivalence classes.
[2025-03-03 17:20:11,611 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 358 of 358 statements.
[2025-03-03 17:20:11,611 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 17:20:11,611 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 17:20:11,875 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-03-03 17:20:11,875 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 17:20:11,875 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270187589]
[2025-03-03 17:20:11,876 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270187589] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 17:20:11,876 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 17:20:11,876 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 17:20:11,876 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612457054]
[2025-03-03 17:20:11,876 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 17:20:11,876 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 17:20:11,876 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 17:20:11,877 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 17:20:11,877 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-03 17:20:11,877 INFO  L87              Difference]: Start difference. First operand 1513 states and 2246 transitions. Second operand  has 5 states, 5 states have (on average 69.2) internal successors, (346), 5 states have internal predecessors, (346), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-03 17:20:12,519 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 17:20:12,520 INFO  L93              Difference]: Finished difference Result 2732 states and 4052 transitions.
[2025-03-03 17:20:12,520 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 17:20:12,520 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 69.2) internal successors, (346), 5 states have internal predecessors, (346), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 358
[2025-03-03 17:20:12,520 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 17:20:12,523 INFO  L225             Difference]: With dead ends: 2732
[2025-03-03 17:20:12,523 INFO  L226             Difference]: Without dead ends: 1513
[2025-03-03 17:20:12,524 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-03-03 17:20:12,524 INFO  L435           NwaCegarLoop]: 1625 mSDtfsCounter, 2191 mSDsluCounter, 1634 mSDsCounter, 0 mSdLazyCounter, 1234 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2194 SdHoareTripleChecker+Valid, 3259 SdHoareTripleChecker+Invalid, 1235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-03 17:20:12,524 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2194 Valid, 3259 Invalid, 1235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1234 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-03 17:20:12,526 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1513 states.
[2025-03-03 17:20:12,535 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1513.
[2025-03-03 17:20:12,536 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1513 states, 1508 states have (on average 1.4847480106100797) internal successors, (2239), 1508 states have internal predecessors, (2239), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2025-03-03 17:20:12,538 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 2245 transitions.
[2025-03-03 17:20:12,538 INFO  L78                 Accepts]: Start accepts. Automaton has 1513 states and 2245 transitions. Word has length 358
[2025-03-03 17:20:12,538 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 17:20:12,538 INFO  L471      AbstractCegarLoop]: Abstraction has 1513 states and 2245 transitions.
[2025-03-03 17:20:12,538 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 69.2) internal successors, (346), 5 states have internal predecessors, (346), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-03 17:20:12,538 INFO  L276                IsEmpty]: Start isEmpty. Operand 1513 states and 2245 transitions.
[2025-03-03 17:20:12,540 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 360
[2025-03-03 17:20:12,540 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 17:20:12,540 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 17:20:12,540 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2025-03-03 17:20:12,540 INFO  L396      AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 17:20:12,541 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 17:20:12,541 INFO  L85        PathProgramCache]: Analyzing trace with hash -902317355, now seen corresponding path program 1 times
[2025-03-03 17:20:12,541 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 17:20:12,541 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085107303]
[2025-03-03 17:20:12,541 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 17:20:12,541 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 17:20:12,621 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 359 statements into 1 equivalence classes.
[2025-03-03 17:20:12,682 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 359 of 359 statements.
[2025-03-03 17:20:12,682 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 17:20:12,682 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 17:20:12,958 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-03-03 17:20:12,958 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 17:20:12,958 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085107303]
[2025-03-03 17:20:12,958 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085107303] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 17:20:12,958 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 17:20:12,958 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 17:20:12,958 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988527531]
[2025-03-03 17:20:12,958 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 17:20:12,959 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 17:20:12,959 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 17:20:12,959 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 17:20:12,959 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-03 17:20:12,959 INFO  L87              Difference]: Start difference. First operand 1513 states and 2245 transitions. Second operand  has 5 states, 5 states have (on average 69.4) internal successors, (347), 5 states have internal predecessors, (347), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-03 17:20:13,560 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 17:20:13,560 INFO  L93              Difference]: Finished difference Result 2732 states and 4050 transitions.
[2025-03-03 17:20:13,560 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 17:20:13,560 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 69.4) internal successors, (347), 5 states have internal predecessors, (347), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 359
[2025-03-03 17:20:13,561 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 17:20:13,563 INFO  L225             Difference]: With dead ends: 2732
[2025-03-03 17:20:13,563 INFO  L226             Difference]: Without dead ends: 1513
[2025-03-03 17:20:13,564 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-03-03 17:20:13,564 INFO  L435           NwaCegarLoop]: 1625 mSDtfsCounter, 2187 mSDsluCounter, 1634 mSDsCounter, 0 mSdLazyCounter, 1232 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2190 SdHoareTripleChecker+Valid, 3259 SdHoareTripleChecker+Invalid, 1233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-03 17:20:13,564 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2190 Valid, 3259 Invalid, 1233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1232 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-03 17:20:13,566 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1513 states.
[2025-03-03 17:20:13,575 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1513.
[2025-03-03 17:20:13,577 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1513 states, 1508 states have (on average 1.4840848806366047) internal successors, (2238), 1508 states have internal predecessors, (2238), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2025-03-03 17:20:13,578 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 2244 transitions.
[2025-03-03 17:20:13,578 INFO  L78                 Accepts]: Start accepts. Automaton has 1513 states and 2244 transitions. Word has length 359
[2025-03-03 17:20:13,578 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 17:20:13,578 INFO  L471      AbstractCegarLoop]: Abstraction has 1513 states and 2244 transitions.
[2025-03-03 17:20:13,578 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 69.4) internal successors, (347), 5 states have internal predecessors, (347), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-03 17:20:13,579 INFO  L276                IsEmpty]: Start isEmpty. Operand 1513 states and 2244 transitions.
[2025-03-03 17:20:13,580 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 361
[2025-03-03 17:20:13,580 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 17:20:13,580 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 17:20:13,580 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2025-03-03 17:20:13,580 INFO  L396      AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 17:20:13,581 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 17:20:13,581 INFO  L85        PathProgramCache]: Analyzing trace with hash 540093064, now seen corresponding path program 1 times
[2025-03-03 17:20:13,581 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 17:20:13,581 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125406843]
[2025-03-03 17:20:13,581 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 17:20:13,581 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 17:20:13,648 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 360 statements into 1 equivalence classes.
[2025-03-03 17:20:13,710 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 360 of 360 statements.
[2025-03-03 17:20:13,710 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 17:20:13,710 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 17:20:14,080 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-03-03 17:20:14,080 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 17:20:14,080 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125406843]
[2025-03-03 17:20:14,080 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125406843] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 17:20:14,081 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 17:20:14,081 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 17:20:14,081 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881898895]
[2025-03-03 17:20:14,081 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 17:20:14,081 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 17:20:14,081 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 17:20:14,082 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 17:20:14,082 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-03 17:20:14,082 INFO  L87              Difference]: Start difference. First operand 1513 states and 2244 transitions. Second operand  has 5 states, 5 states have (on average 69.6) internal successors, (348), 5 states have internal predecessors, (348), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-03 17:20:14,655 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 17:20:14,655 INFO  L93              Difference]: Finished difference Result 2732 states and 4048 transitions.
[2025-03-03 17:20:14,656 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 17:20:14,656 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 69.6) internal successors, (348), 5 states have internal predecessors, (348), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 360
[2025-03-03 17:20:14,656 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 17:20:14,658 INFO  L225             Difference]: With dead ends: 2732
[2025-03-03 17:20:14,658 INFO  L226             Difference]: Without dead ends: 1513
[2025-03-03 17:20:14,659 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-03-03 17:20:14,660 INFO  L435           NwaCegarLoop]: 1625 mSDtfsCounter, 2183 mSDsluCounter, 1634 mSDsCounter, 0 mSdLazyCounter, 1230 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2186 SdHoareTripleChecker+Valid, 3259 SdHoareTripleChecker+Invalid, 1231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-03 17:20:14,660 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2186 Valid, 3259 Invalid, 1231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1230 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-03 17:20:14,661 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1513 states.
[2025-03-03 17:20:14,669 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1513.
[2025-03-03 17:20:14,670 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1513 states, 1508 states have (on average 1.48342175066313) internal successors, (2237), 1508 states have internal predecessors, (2237), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2025-03-03 17:20:14,671 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 2243 transitions.
[2025-03-03 17:20:14,672 INFO  L78                 Accepts]: Start accepts. Automaton has 1513 states and 2243 transitions. Word has length 360
[2025-03-03 17:20:14,672 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 17:20:14,672 INFO  L471      AbstractCegarLoop]: Abstraction has 1513 states and 2243 transitions.
[2025-03-03 17:20:14,672 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 69.6) internal successors, (348), 5 states have internal predecessors, (348), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-03 17:20:14,672 INFO  L276                IsEmpty]: Start isEmpty. Operand 1513 states and 2243 transitions.
[2025-03-03 17:20:14,673 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 362
[2025-03-03 17:20:14,673 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 17:20:14,673 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 17:20:14,674 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2025-03-03 17:20:14,674 INFO  L396      AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 17:20:14,674 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 17:20:14,674 INFO  L85        PathProgramCache]: Analyzing trace with hash -211845744, now seen corresponding path program 1 times
[2025-03-03 17:20:14,674 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 17:20:14,674 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112809452]
[2025-03-03 17:20:14,674 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 17:20:14,674 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 17:20:14,743 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 361 statements into 1 equivalence classes.
[2025-03-03 17:20:14,806 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 361 of 361 statements.
[2025-03-03 17:20:14,806 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 17:20:14,806 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 17:20:15,068 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-03-03 17:20:15,068 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 17:20:15,068 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112809452]
[2025-03-03 17:20:15,068 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112809452] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 17:20:15,068 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 17:20:15,068 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 17:20:15,069 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353383039]
[2025-03-03 17:20:15,069 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 17:20:15,070 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 17:20:15,070 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 17:20:15,070 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 17:20:15,070 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-03 17:20:15,070 INFO  L87              Difference]: Start difference. First operand 1513 states and 2243 transitions. Second operand  has 5 states, 5 states have (on average 69.8) internal successors, (349), 5 states have internal predecessors, (349), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-03 17:20:15,714 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 17:20:15,714 INFO  L93              Difference]: Finished difference Result 2732 states and 4046 transitions.
[2025-03-03 17:20:15,717 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 17:20:15,717 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 69.8) internal successors, (349), 5 states have internal predecessors, (349), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 361
[2025-03-03 17:20:15,717 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 17:20:15,719 INFO  L225             Difference]: With dead ends: 2732
[2025-03-03 17:20:15,719 INFO  L226             Difference]: Without dead ends: 1513
[2025-03-03 17:20:15,721 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-03-03 17:20:15,722 INFO  L435           NwaCegarLoop]: 1625 mSDtfsCounter, 4105 mSDsluCounter, 1627 mSDsCounter, 0 mSdLazyCounter, 1228 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4108 SdHoareTripleChecker+Valid, 3252 SdHoareTripleChecker+Invalid, 1229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-03 17:20:15,722 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [4108 Valid, 3252 Invalid, 1229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1228 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-03 17:20:15,723 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1513 states.
[2025-03-03 17:20:15,732 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1513.
[2025-03-03 17:20:15,734 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1513 states, 1508 states have (on average 1.4827586206896552) internal successors, (2236), 1508 states have internal predecessors, (2236), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2025-03-03 17:20:15,735 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 2242 transitions.
[2025-03-03 17:20:15,735 INFO  L78                 Accepts]: Start accepts. Automaton has 1513 states and 2242 transitions. Word has length 361
[2025-03-03 17:20:15,735 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 17:20:15,735 INFO  L471      AbstractCegarLoop]: Abstraction has 1513 states and 2242 transitions.
[2025-03-03 17:20:15,735 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 69.8) internal successors, (349), 5 states have internal predecessors, (349), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-03 17:20:15,735 INFO  L276                IsEmpty]: Start isEmpty. Operand 1513 states and 2242 transitions.
[2025-03-03 17:20:15,737 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 363
[2025-03-03 17:20:15,737 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 17:20:15,737 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 17:20:15,737 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2025-03-03 17:20:15,737 INFO  L396      AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 17:20:15,738 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 17:20:15,738 INFO  L85        PathProgramCache]: Analyzing trace with hash 488813219, now seen corresponding path program 1 times
[2025-03-03 17:20:15,738 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 17:20:15,738 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333692655]
[2025-03-03 17:20:15,738 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 17:20:15,738 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 17:20:15,807 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 362 statements into 1 equivalence classes.
[2025-03-03 17:20:15,904 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 362 of 362 statements.
[2025-03-03 17:20:15,904 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 17:20:15,904 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 17:20:16,150 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-03-03 17:20:16,150 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 17:20:16,151 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333692655]
[2025-03-03 17:20:16,151 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333692655] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 17:20:16,151 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 17:20:16,151 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 17:20:16,151 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257888302]
[2025-03-03 17:20:16,151 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 17:20:16,151 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 17:20:16,151 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 17:20:16,152 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 17:20:16,152 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-03 17:20:16,152 INFO  L87              Difference]: Start difference. First operand 1513 states and 2242 transitions. Second operand  has 5 states, 5 states have (on average 70.0) internal successors, (350), 5 states have internal predecessors, (350), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-03 17:20:16,759 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 17:20:16,759 INFO  L93              Difference]: Finished difference Result 2732 states and 4044 transitions.
[2025-03-03 17:20:16,759 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 17:20:16,760 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 70.0) internal successors, (350), 5 states have internal predecessors, (350), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 362
[2025-03-03 17:20:16,760 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 17:20:16,762 INFO  L225             Difference]: With dead ends: 2732
[2025-03-03 17:20:16,762 INFO  L226             Difference]: Without dead ends: 1513
[2025-03-03 17:20:16,763 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-03-03 17:20:16,764 INFO  L435           NwaCegarLoop]: 1625 mSDtfsCounter, 2175 mSDsluCounter, 1634 mSDsCounter, 0 mSdLazyCounter, 1226 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2178 SdHoareTripleChecker+Valid, 3259 SdHoareTripleChecker+Invalid, 1227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-03 17:20:16,764 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2178 Valid, 3259 Invalid, 1227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1226 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-03 17:20:16,765 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1513 states.
[2025-03-03 17:20:16,773 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1513.
[2025-03-03 17:20:16,774 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1513 states, 1508 states have (on average 1.4820954907161803) internal successors, (2235), 1508 states have internal predecessors, (2235), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2025-03-03 17:20:16,775 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 2241 transitions.
[2025-03-03 17:20:16,775 INFO  L78                 Accepts]: Start accepts. Automaton has 1513 states and 2241 transitions. Word has length 362
[2025-03-03 17:20:16,775 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 17:20:16,775 INFO  L471      AbstractCegarLoop]: Abstraction has 1513 states and 2241 transitions.
[2025-03-03 17:20:16,775 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 70.0) internal successors, (350), 5 states have internal predecessors, (350), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-03 17:20:16,776 INFO  L276                IsEmpty]: Start isEmpty. Operand 1513 states and 2241 transitions.
[2025-03-03 17:20:16,777 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 364
[2025-03-03 17:20:16,777 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 17:20:16,777 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 17:20:16,777 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2025-03-03 17:20:16,777 INFO  L396      AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 17:20:16,778 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 17:20:16,778 INFO  L85        PathProgramCache]: Analyzing trace with hash 1832014283, now seen corresponding path program 1 times
[2025-03-03 17:20:16,778 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 17:20:16,778 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606653003]
[2025-03-03 17:20:16,778 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 17:20:16,778 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 17:20:16,845 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 363 statements into 1 equivalence classes.
[2025-03-03 17:20:16,907 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 363 of 363 statements.
[2025-03-03 17:20:16,908 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 17:20:16,908 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 17:20:17,179 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-03-03 17:20:17,179 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 17:20:17,179 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606653003]
[2025-03-03 17:20:17,179 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606653003] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 17:20:17,179 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 17:20:17,179 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 17:20:17,180 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787933476]
[2025-03-03 17:20:17,180 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 17:20:17,180 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 17:20:17,180 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 17:20:17,180 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 17:20:17,181 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-03 17:20:17,181 INFO  L87              Difference]: Start difference. First operand 1513 states and 2241 transitions. Second operand  has 5 states, 5 states have (on average 70.2) internal successors, (351), 5 states have internal predecessors, (351), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-03 17:20:17,857 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 17:20:17,857 INFO  L93              Difference]: Finished difference Result 2732 states and 4042 transitions.
[2025-03-03 17:20:17,857 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 17:20:17,857 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 70.2) internal successors, (351), 5 states have internal predecessors, (351), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 363
[2025-03-03 17:20:17,858 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 17:20:17,859 INFO  L225             Difference]: With dead ends: 2732
[2025-03-03 17:20:17,859 INFO  L226             Difference]: Without dead ends: 1513
[2025-03-03 17:20:17,860 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-03-03 17:20:17,860 INFO  L435           NwaCegarLoop]: 1625 mSDtfsCounter, 2171 mSDsluCounter, 1634 mSDsCounter, 0 mSdLazyCounter, 1224 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2174 SdHoareTripleChecker+Valid, 3259 SdHoareTripleChecker+Invalid, 1225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-03 17:20:17,861 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2174 Valid, 3259 Invalid, 1225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1224 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-03 17:20:17,862 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1513 states.
[2025-03-03 17:20:17,868 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1513.
[2025-03-03 17:20:17,869 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1513 states, 1508 states have (on average 1.4814323607427056) internal successors, (2234), 1508 states have internal predecessors, (2234), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2025-03-03 17:20:17,870 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 2240 transitions.
[2025-03-03 17:20:17,870 INFO  L78                 Accepts]: Start accepts. Automaton has 1513 states and 2240 transitions. Word has length 363
[2025-03-03 17:20:17,870 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 17:20:17,870 INFO  L471      AbstractCegarLoop]: Abstraction has 1513 states and 2240 transitions.
[2025-03-03 17:20:17,870 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 70.2) internal successors, (351), 5 states have internal predecessors, (351), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-03 17:20:17,870 INFO  L276                IsEmpty]: Start isEmpty. Operand 1513 states and 2240 transitions.
[2025-03-03 17:20:17,871 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 365
[2025-03-03 17:20:17,872 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 17:20:17,872 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 17:20:17,872 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2025-03-03 17:20:17,872 INFO  L396      AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 17:20:17,872 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 17:20:17,872 INFO  L85        PathProgramCache]: Analyzing trace with hash 1242268734, now seen corresponding path program 1 times
[2025-03-03 17:20:17,872 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 17:20:17,872 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928006453]
[2025-03-03 17:20:17,872 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 17:20:17,872 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 17:20:17,937 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 364 statements into 1 equivalence classes.
[2025-03-03 17:20:17,999 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 364 of 364 statements.
[2025-03-03 17:20:17,999 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 17:20:17,999 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 17:20:18,245 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-03-03 17:20:18,245 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 17:20:18,245 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928006453]
[2025-03-03 17:20:18,245 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928006453] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 17:20:18,245 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 17:20:18,245 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 17:20:18,245 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088705518]
[2025-03-03 17:20:18,245 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 17:20:18,246 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 17:20:18,246 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 17:20:18,246 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 17:20:18,246 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-03 17:20:18,246 INFO  L87              Difference]: Start difference. First operand 1513 states and 2240 transitions. Second operand  has 5 states, 5 states have (on average 70.4) internal successors, (352), 5 states have internal predecessors, (352), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-03 17:20:18,838 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 17:20:18,838 INFO  L93              Difference]: Finished difference Result 2732 states and 4040 transitions.
[2025-03-03 17:20:18,838 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 17:20:18,839 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 70.4) internal successors, (352), 5 states have internal predecessors, (352), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 364
[2025-03-03 17:20:18,839 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 17:20:18,841 INFO  L225             Difference]: With dead ends: 2732
[2025-03-03 17:20:18,841 INFO  L226             Difference]: Without dead ends: 1513
[2025-03-03 17:20:18,842 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-03-03 17:20:18,842 INFO  L435           NwaCegarLoop]: 1625 mSDtfsCounter, 2167 mSDsluCounter, 1634 mSDsCounter, 0 mSdLazyCounter, 1222 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2170 SdHoareTripleChecker+Valid, 3259 SdHoareTripleChecker+Invalid, 1223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-03 17:20:18,842 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2170 Valid, 3259 Invalid, 1223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1222 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-03 17:20:18,843 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1513 states.
[2025-03-03 17:20:18,851 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1513.
[2025-03-03 17:20:18,852 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1513 states, 1508 states have (on average 1.4807692307692308) internal successors, (2233), 1508 states have internal predecessors, (2233), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2025-03-03 17:20:18,853 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 2239 transitions.
[2025-03-03 17:20:18,853 INFO  L78                 Accepts]: Start accepts. Automaton has 1513 states and 2239 transitions. Word has length 364
[2025-03-03 17:20:18,853 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 17:20:18,853 INFO  L471      AbstractCegarLoop]: Abstraction has 1513 states and 2239 transitions.
[2025-03-03 17:20:18,853 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 70.4) internal successors, (352), 5 states have internal predecessors, (352), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-03 17:20:18,853 INFO  L276                IsEmpty]: Start isEmpty. Operand 1513 states and 2239 transitions.
[2025-03-03 17:20:18,854 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 366
[2025-03-03 17:20:18,854 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 17:20:18,854 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 17:20:18,854 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2025-03-03 17:20:18,855 INFO  L396      AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 17:20:18,855 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 17:20:18,855 INFO  L85        PathProgramCache]: Analyzing trace with hash -1186596986, now seen corresponding path program 1 times
[2025-03-03 17:20:18,855 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 17:20:18,855 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659279581]
[2025-03-03 17:20:18,855 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 17:20:18,855 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 17:20:18,917 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 365 statements into 1 equivalence classes.
[2025-03-03 17:20:18,979 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 365 of 365 statements.
[2025-03-03 17:20:18,979 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 17:20:18,979 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 17:20:19,276 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-03-03 17:20:19,278 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 17:20:19,278 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659279581]
[2025-03-03 17:20:19,278 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659279581] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 17:20:19,278 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 17:20:19,278 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 17:20:19,278 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550609658]
[2025-03-03 17:20:19,278 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 17:20:19,278 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 17:20:19,279 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 17:20:19,279 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 17:20:19,279 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-03 17:20:19,279 INFO  L87              Difference]: Start difference. First operand 1513 states and 2239 transitions. Second operand  has 5 states, 5 states have (on average 70.6) internal successors, (353), 5 states have internal predecessors, (353), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-03 17:20:19,893 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 17:20:19,893 INFO  L93              Difference]: Finished difference Result 2732 states and 4038 transitions.
[2025-03-03 17:20:19,893 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 17:20:19,893 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 70.6) internal successors, (353), 5 states have internal predecessors, (353), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 365
[2025-03-03 17:20:19,893 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 17:20:19,895 INFO  L225             Difference]: With dead ends: 2732
[2025-03-03 17:20:19,895 INFO  L226             Difference]: Without dead ends: 1513
[2025-03-03 17:20:19,896 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-03-03 17:20:19,896 INFO  L435           NwaCegarLoop]: 1625 mSDtfsCounter, 2163 mSDsluCounter, 1634 mSDsCounter, 0 mSdLazyCounter, 1220 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2166 SdHoareTripleChecker+Valid, 3259 SdHoareTripleChecker+Invalid, 1221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-03 17:20:19,897 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2166 Valid, 3259 Invalid, 1221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1220 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-03 17:20:19,898 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1513 states.
[2025-03-03 17:20:19,905 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1513.
[2025-03-03 17:20:19,905 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1513 states, 1508 states have (on average 1.4801061007957559) internal successors, (2232), 1508 states have internal predecessors, (2232), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2025-03-03 17:20:19,906 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 2238 transitions.
[2025-03-03 17:20:19,907 INFO  L78                 Accepts]: Start accepts. Automaton has 1513 states and 2238 transitions. Word has length 365
[2025-03-03 17:20:19,907 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 17:20:19,907 INFO  L471      AbstractCegarLoop]: Abstraction has 1513 states and 2238 transitions.
[2025-03-03 17:20:19,907 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 70.6) internal successors, (353), 5 states have internal predecessors, (353), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-03 17:20:19,907 INFO  L276                IsEmpty]: Start isEmpty. Operand 1513 states and 2238 transitions.
[2025-03-03 17:20:19,908 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 367
[2025-03-03 17:20:19,908 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 17:20:19,908 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 17:20:19,908 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2025-03-03 17:20:19,908 INFO  L396      AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 17:20:19,909 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 17:20:19,909 INFO  L85        PathProgramCache]: Analyzing trace with hash -1126473895, now seen corresponding path program 1 times
[2025-03-03 17:20:19,909 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 17:20:19,909 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991702521]
[2025-03-03 17:20:19,909 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 17:20:19,909 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 17:20:19,973 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 366 statements into 1 equivalence classes.
[2025-03-03 17:20:20,034 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 366 of 366 statements.
[2025-03-03 17:20:20,034 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 17:20:20,034 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 17:20:20,288 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-03-03 17:20:20,288 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 17:20:20,288 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991702521]
[2025-03-03 17:20:20,288 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991702521] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 17:20:20,288 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 17:20:20,288 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 17:20:20,289 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303720341]
[2025-03-03 17:20:20,289 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 17:20:20,289 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 17:20:20,289 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 17:20:20,289 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 17:20:20,289 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-03 17:20:20,289 INFO  L87              Difference]: Start difference. First operand 1513 states and 2238 transitions. Second operand  has 5 states, 5 states have (on average 70.8) internal successors, (354), 5 states have internal predecessors, (354), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-03 17:20:20,892 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 17:20:20,892 INFO  L93              Difference]: Finished difference Result 2732 states and 4036 transitions.
[2025-03-03 17:20:20,893 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 17:20:20,893 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 70.8) internal successors, (354), 5 states have internal predecessors, (354), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 366
[2025-03-03 17:20:20,893 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 17:20:20,895 INFO  L225             Difference]: With dead ends: 2732
[2025-03-03 17:20:20,895 INFO  L226             Difference]: Without dead ends: 1513
[2025-03-03 17:20:20,896 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-03-03 17:20:20,897 INFO  L435           NwaCegarLoop]: 1625 mSDtfsCounter, 2159 mSDsluCounter, 1634 mSDsCounter, 0 mSdLazyCounter, 1218 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2162 SdHoareTripleChecker+Valid, 3259 SdHoareTripleChecker+Invalid, 1219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-03 17:20:20,897 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2162 Valid, 3259 Invalid, 1219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1218 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-03 17:20:20,898 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1513 states.
[2025-03-03 17:20:20,906 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1513.
[2025-03-03 17:20:20,907 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1513 states, 1508 states have (on average 1.4794429708222812) internal successors, (2231), 1508 states have internal predecessors, (2231), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2025-03-03 17:20:20,908 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 2237 transitions.
[2025-03-03 17:20:20,908 INFO  L78                 Accepts]: Start accepts. Automaton has 1513 states and 2237 transitions. Word has length 366
[2025-03-03 17:20:20,909 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 17:20:20,909 INFO  L471      AbstractCegarLoop]: Abstraction has 1513 states and 2237 transitions.
[2025-03-03 17:20:20,909 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 70.8) internal successors, (354), 5 states have internal predecessors, (354), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-03 17:20:20,909 INFO  L276                IsEmpty]: Start isEmpty. Operand 1513 states and 2237 transitions.
[2025-03-03 17:20:20,910 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 368
[2025-03-03 17:20:20,910 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 17:20:20,911 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 17:20:20,911 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26
[2025-03-03 17:20:20,911 INFO  L396      AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 17:20:20,911 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 17:20:20,911 INFO  L85        PathProgramCache]: Analyzing trace with hash -1177538879, now seen corresponding path program 1 times
[2025-03-03 17:20:20,911 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 17:20:20,911 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643224315]
[2025-03-03 17:20:20,912 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 17:20:20,912 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 17:20:20,980 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 367 statements into 1 equivalence classes.
[2025-03-03 17:20:21,047 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 367 of 367 statements.
[2025-03-03 17:20:21,047 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 17:20:21,047 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 17:20:21,470 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-03-03 17:20:21,470 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 17:20:21,470 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643224315]
[2025-03-03 17:20:21,470 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643224315] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 17:20:21,470 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 17:20:21,470 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 17:20:21,470 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807296872]
[2025-03-03 17:20:21,470 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 17:20:21,471 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 17:20:21,471 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 17:20:21,471 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 17:20:21,472 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-03 17:20:21,472 INFO  L87              Difference]: Start difference. First operand 1513 states and 2237 transitions. Second operand  has 5 states, 5 states have (on average 71.0) internal successors, (355), 5 states have internal predecessors, (355), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-03 17:20:22,111 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 17:20:22,111 INFO  L93              Difference]: Finished difference Result 2732 states and 4034 transitions.
[2025-03-03 17:20:22,112 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 17:20:22,112 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 71.0) internal successors, (355), 5 states have internal predecessors, (355), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 367
[2025-03-03 17:20:22,112 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 17:20:22,115 INFO  L225             Difference]: With dead ends: 2732
[2025-03-03 17:20:22,115 INFO  L226             Difference]: Without dead ends: 1513
[2025-03-03 17:20:22,117 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-03-03 17:20:22,117 INFO  L435           NwaCegarLoop]: 1625 mSDtfsCounter, 4057 mSDsluCounter, 1627 mSDsCounter, 0 mSdLazyCounter, 1216 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4060 SdHoareTripleChecker+Valid, 3252 SdHoareTripleChecker+Invalid, 1217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-03 17:20:22,119 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [4060 Valid, 3252 Invalid, 1217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1216 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-03 17:20:22,120 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1513 states.
[2025-03-03 17:20:22,129 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1513.
[2025-03-03 17:20:22,130 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1513 states, 1508 states have (on average 1.4787798408488064) internal successors, (2230), 1508 states have internal predecessors, (2230), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2025-03-03 17:20:22,131 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 2236 transitions.
[2025-03-03 17:20:22,131 INFO  L78                 Accepts]: Start accepts. Automaton has 1513 states and 2236 transitions. Word has length 367
[2025-03-03 17:20:22,132 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 17:20:22,132 INFO  L471      AbstractCegarLoop]: Abstraction has 1513 states and 2236 transitions.
[2025-03-03 17:20:22,132 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 71.0) internal successors, (355), 5 states have internal predecessors, (355), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-03 17:20:22,132 INFO  L276                IsEmpty]: Start isEmpty. Operand 1513 states and 2236 transitions.
[2025-03-03 17:20:22,133 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 369
[2025-03-03 17:20:22,133 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 17:20:22,133 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 17:20:22,133 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27
[2025-03-03 17:20:22,133 INFO  L396      AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 17:20:22,133 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 17:20:22,134 INFO  L85        PathProgramCache]: Analyzing trace with hash -1046346764, now seen corresponding path program 1 times
[2025-03-03 17:20:22,134 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 17:20:22,134 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659159872]
[2025-03-03 17:20:22,134 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 17:20:22,134 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 17:20:22,199 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 368 statements into 1 equivalence classes.
[2025-03-03 17:20:22,265 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 368 of 368 statements.
[2025-03-03 17:20:22,265 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 17:20:22,265 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 17:20:22,550 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-03-03 17:20:22,550 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 17:20:22,550 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659159872]
[2025-03-03 17:20:22,550 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659159872] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 17:20:22,550 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 17:20:22,550 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 17:20:22,550 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862329161]
[2025-03-03 17:20:22,550 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 17:20:22,551 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 17:20:22,551 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 17:20:22,551 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 17:20:22,551 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-03 17:20:22,551 INFO  L87              Difference]: Start difference. First operand 1513 states and 2236 transitions. Second operand  has 5 states, 5 states have (on average 71.2) internal successors, (356), 5 states have internal predecessors, (356), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-03 17:20:23,159 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 17:20:23,159 INFO  L93              Difference]: Finished difference Result 2732 states and 4032 transitions.
[2025-03-03 17:20:23,159 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 17:20:23,159 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 71.2) internal successors, (356), 5 states have internal predecessors, (356), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 368
[2025-03-03 17:20:23,160 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 17:20:23,162 INFO  L225             Difference]: With dead ends: 2732
[2025-03-03 17:20:23,162 INFO  L226             Difference]: Without dead ends: 1513
[2025-03-03 17:20:23,163 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-03-03 17:20:23,163 INFO  L435           NwaCegarLoop]: 1625 mSDtfsCounter, 4049 mSDsluCounter, 1627 mSDsCounter, 0 mSdLazyCounter, 1214 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4052 SdHoareTripleChecker+Valid, 3252 SdHoareTripleChecker+Invalid, 1215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-03 17:20:23,163 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [4052 Valid, 3252 Invalid, 1215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1214 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-03 17:20:23,164 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1513 states.
[2025-03-03 17:20:23,172 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1513.
[2025-03-03 17:20:23,173 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1513 states, 1508 states have (on average 1.4781167108753315) internal successors, (2229), 1508 states have internal predecessors, (2229), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2025-03-03 17:20:23,174 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 2235 transitions.
[2025-03-03 17:20:23,174 INFO  L78                 Accepts]: Start accepts. Automaton has 1513 states and 2235 transitions. Word has length 368
[2025-03-03 17:20:23,174 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 17:20:23,174 INFO  L471      AbstractCegarLoop]: Abstraction has 1513 states and 2235 transitions.
[2025-03-03 17:20:23,174 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 71.2) internal successors, (356), 5 states have internal predecessors, (356), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-03 17:20:23,174 INFO  L276                IsEmpty]: Start isEmpty. Operand 1513 states and 2235 transitions.
[2025-03-03 17:20:23,175 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 370
[2025-03-03 17:20:23,175 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 17:20:23,176 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 17:20:23,176 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28
[2025-03-03 17:20:23,176 INFO  L396      AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 17:20:23,176 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 17:20:23,176 INFO  L85        PathProgramCache]: Analyzing trace with hash 296138620, now seen corresponding path program 1 times
[2025-03-03 17:20:23,176 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 17:20:23,176 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037547906]
[2025-03-03 17:20:23,176 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 17:20:23,176 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 17:20:23,247 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 369 statements into 1 equivalence classes.
[2025-03-03 17:20:23,321 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 369 of 369 statements.
[2025-03-03 17:20:23,321 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 17:20:23,321 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 17:20:23,621 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-03-03 17:20:23,621 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 17:20:23,621 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037547906]
[2025-03-03 17:20:23,621 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037547906] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 17:20:23,621 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 17:20:23,621 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 17:20:23,622 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861197688]
[2025-03-03 17:20:23,622 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 17:20:23,622 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 17:20:23,622 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 17:20:23,622 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 17:20:23,622 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-03 17:20:23,622 INFO  L87              Difference]: Start difference. First operand 1513 states and 2235 transitions. Second operand  has 5 states, 5 states have (on average 71.4) internal successors, (357), 5 states have internal predecessors, (357), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-03 17:20:24,235 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 17:20:24,235 INFO  L93              Difference]: Finished difference Result 2732 states and 4030 transitions.
[2025-03-03 17:20:24,236 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 17:20:24,236 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 71.4) internal successors, (357), 5 states have internal predecessors, (357), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 369
[2025-03-03 17:20:24,236 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 17:20:24,238 INFO  L225             Difference]: With dead ends: 2732
[2025-03-03 17:20:24,238 INFO  L226             Difference]: Without dead ends: 1513
[2025-03-03 17:20:24,239 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-03-03 17:20:24,240 INFO  L435           NwaCegarLoop]: 1625 mSDtfsCounter, 4041 mSDsluCounter, 1627 mSDsCounter, 0 mSdLazyCounter, 1212 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4044 SdHoareTripleChecker+Valid, 3252 SdHoareTripleChecker+Invalid, 1213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-03 17:20:24,240 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [4044 Valid, 3252 Invalid, 1213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1212 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-03 17:20:24,241 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1513 states.
[2025-03-03 17:20:24,249 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1513.
[2025-03-03 17:20:24,250 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1513 states, 1508 states have (on average 1.4774535809018567) internal successors, (2228), 1508 states have internal predecessors, (2228), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2025-03-03 17:20:24,251 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 2234 transitions.
[2025-03-03 17:20:24,252 INFO  L78                 Accepts]: Start accepts. Automaton has 1513 states and 2234 transitions. Word has length 369
[2025-03-03 17:20:24,252 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 17:20:24,252 INFO  L471      AbstractCegarLoop]: Abstraction has 1513 states and 2234 transitions.
[2025-03-03 17:20:24,252 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 71.4) internal successors, (357), 5 states have internal predecessors, (357), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-03 17:20:24,252 INFO  L276                IsEmpty]: Start isEmpty. Operand 1513 states and 2234 transitions.
[2025-03-03 17:20:24,253 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 371
[2025-03-03 17:20:24,254 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 17:20:24,254 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 17:20:24,254 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29
[2025-03-03 17:20:24,254 INFO  L396      AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 17:20:24,254 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 17:20:24,255 INFO  L85        PathProgramCache]: Analyzing trace with hash -628149745, now seen corresponding path program 1 times
[2025-03-03 17:20:24,255 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 17:20:24,255 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480849808]
[2025-03-03 17:20:24,255 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 17:20:24,255 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 17:20:24,324 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 370 statements into 1 equivalence classes.
[2025-03-03 17:20:24,393 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 370 of 370 statements.
[2025-03-03 17:20:24,393 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 17:20:24,393 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 17:20:24,658 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-03-03 17:20:24,658 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 17:20:24,658 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480849808]
[2025-03-03 17:20:24,658 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480849808] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 17:20:24,658 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 17:20:24,659 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 17:20:24,659 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598291320]
[2025-03-03 17:20:24,659 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 17:20:24,659 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 17:20:24,659 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 17:20:24,659 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 17:20:24,659 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-03 17:20:24,659 INFO  L87              Difference]: Start difference. First operand 1513 states and 2234 transitions. Second operand  has 5 states, 5 states have (on average 71.6) internal successors, (358), 5 states have internal predecessors, (358), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-03 17:20:25,247 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 17:20:25,247 INFO  L93              Difference]: Finished difference Result 2732 states and 4028 transitions.
[2025-03-03 17:20:25,247 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 17:20:25,248 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 71.6) internal successors, (358), 5 states have internal predecessors, (358), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 370
[2025-03-03 17:20:25,248 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 17:20:25,250 INFO  L225             Difference]: With dead ends: 2732
[2025-03-03 17:20:25,250 INFO  L226             Difference]: Without dead ends: 1513
[2025-03-03 17:20:25,251 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-03-03 17:20:25,251 INFO  L435           NwaCegarLoop]: 1625 mSDtfsCounter, 4033 mSDsluCounter, 1627 mSDsCounter, 0 mSdLazyCounter, 1210 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4036 SdHoareTripleChecker+Valid, 3252 SdHoareTripleChecker+Invalid, 1211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-03 17:20:25,252 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [4036 Valid, 3252 Invalid, 1211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1210 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-03 17:20:25,253 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1513 states.
[2025-03-03 17:20:25,260 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1513.
[2025-03-03 17:20:25,260 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1513 states, 1508 states have (on average 1.476790450928382) internal successors, (2227), 1508 states have internal predecessors, (2227), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2025-03-03 17:20:25,261 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 2233 transitions.
[2025-03-03 17:20:25,262 INFO  L78                 Accepts]: Start accepts. Automaton has 1513 states and 2233 transitions. Word has length 370
[2025-03-03 17:20:25,262 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 17:20:25,262 INFO  L471      AbstractCegarLoop]: Abstraction has 1513 states and 2233 transitions.
[2025-03-03 17:20:25,262 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 71.6) internal successors, (358), 5 states have internal predecessors, (358), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-03 17:20:25,262 INFO  L276                IsEmpty]: Start isEmpty. Operand 1513 states and 2233 transitions.
[2025-03-03 17:20:25,263 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 372
[2025-03-03 17:20:25,263 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 17:20:25,263 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 17:20:25,263 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30
[2025-03-03 17:20:25,263 INFO  L396      AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 17:20:25,264 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 17:20:25,264 INFO  L85        PathProgramCache]: Analyzing trace with hash -2076225097, now seen corresponding path program 1 times
[2025-03-03 17:20:25,264 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 17:20:25,264 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058392740]
[2025-03-03 17:20:25,264 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 17:20:25,264 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 17:20:25,335 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 371 statements into 1 equivalence classes.
[2025-03-03 17:20:25,402 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 371 of 371 statements.
[2025-03-03 17:20:25,402 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 17:20:25,402 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 17:20:25,692 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-03-03 17:20:25,692 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 17:20:25,692 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058392740]
[2025-03-03 17:20:25,692 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058392740] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 17:20:25,692 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 17:20:25,692 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 17:20:25,692 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039111476]
[2025-03-03 17:20:25,692 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 17:20:25,692 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 17:20:25,692 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 17:20:25,693 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 17:20:25,693 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-03 17:20:25,693 INFO  L87              Difference]: Start difference. First operand 1513 states and 2233 transitions. Second operand  has 5 states, 5 states have (on average 71.8) internal successors, (359), 5 states have internal predecessors, (359), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-03 17:20:26,291 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 17:20:26,291 INFO  L93              Difference]: Finished difference Result 2732 states and 4026 transitions.
[2025-03-03 17:20:26,291 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 17:20:26,291 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 71.8) internal successors, (359), 5 states have internal predecessors, (359), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 371
[2025-03-03 17:20:26,291 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 17:20:26,293 INFO  L225             Difference]: With dead ends: 2732
[2025-03-03 17:20:26,293 INFO  L226             Difference]: Without dead ends: 1513
[2025-03-03 17:20:26,294 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-03-03 17:20:26,294 INFO  L435           NwaCegarLoop]: 1625 mSDtfsCounter, 2139 mSDsluCounter, 1634 mSDsCounter, 0 mSdLazyCounter, 1208 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2142 SdHoareTripleChecker+Valid, 3259 SdHoareTripleChecker+Invalid, 1209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-03 17:20:26,295 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2142 Valid, 3259 Invalid, 1209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1208 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-03 17:20:26,297 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1513 states.
[2025-03-03 17:20:26,305 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1513.
[2025-03-03 17:20:26,306 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1513 states, 1508 states have (on average 1.476127320954907) internal successors, (2226), 1508 states have internal predecessors, (2226), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2025-03-03 17:20:26,308 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 2232 transitions.
[2025-03-03 17:20:26,308 INFO  L78                 Accepts]: Start accepts. Automaton has 1513 states and 2232 transitions. Word has length 371
[2025-03-03 17:20:26,308 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 17:20:26,308 INFO  L471      AbstractCegarLoop]: Abstraction has 1513 states and 2232 transitions.
[2025-03-03 17:20:26,309 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 71.8) internal successors, (359), 5 states have internal predecessors, (359), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-03 17:20:26,309 INFO  L276                IsEmpty]: Start isEmpty. Operand 1513 states and 2232 transitions.
[2025-03-03 17:20:26,310 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 373
[2025-03-03 17:20:26,310 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 17:20:26,310 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 17:20:26,310 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31
[2025-03-03 17:20:26,310 INFO  L396      AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 17:20:26,311 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 17:20:26,311 INFO  L85        PathProgramCache]: Analyzing trace with hash -1074615894, now seen corresponding path program 1 times
[2025-03-03 17:20:26,311 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 17:20:26,311 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70455662]
[2025-03-03 17:20:26,311 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 17:20:26,311 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 17:20:26,380 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 372 statements into 1 equivalence classes.
[2025-03-03 17:20:26,451 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 372 of 372 statements.
[2025-03-03 17:20:26,451 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 17:20:26,451 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 17:20:26,713 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-03-03 17:20:26,713 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 17:20:26,713 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70455662]
[2025-03-03 17:20:26,713 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70455662] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 17:20:26,713 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 17:20:26,713 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 17:20:26,713 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537322221]
[2025-03-03 17:20:26,713 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 17:20:26,714 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 17:20:26,714 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 17:20:26,714 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 17:20:26,714 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-03 17:20:26,714 INFO  L87              Difference]: Start difference. First operand 1513 states and 2232 transitions. Second operand  has 5 states, 5 states have (on average 72.0) internal successors, (360), 5 states have internal predecessors, (360), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-03 17:20:27,299 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 17:20:27,300 INFO  L93              Difference]: Finished difference Result 2732 states and 4024 transitions.
[2025-03-03 17:20:27,300 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 17:20:27,300 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 72.0) internal successors, (360), 5 states have internal predecessors, (360), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 372
[2025-03-03 17:20:27,300 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 17:20:27,302 INFO  L225             Difference]: With dead ends: 2732
[2025-03-03 17:20:27,302 INFO  L226             Difference]: Without dead ends: 1513
[2025-03-03 17:20:27,303 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-03-03 17:20:27,303 INFO  L435           NwaCegarLoop]: 1625 mSDtfsCounter, 2135 mSDsluCounter, 1634 mSDsCounter, 0 mSdLazyCounter, 1206 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2138 SdHoareTripleChecker+Valid, 3259 SdHoareTripleChecker+Invalid, 1207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-03 17:20:27,303 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2138 Valid, 3259 Invalid, 1207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1206 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-03 17:20:27,304 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1513 states.
[2025-03-03 17:20:27,312 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1513.
[2025-03-03 17:20:27,312 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1513 states, 1508 states have (on average 1.4754641909814323) internal successors, (2225), 1508 states have internal predecessors, (2225), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2025-03-03 17:20:27,313 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 2231 transitions.
[2025-03-03 17:20:27,314 INFO  L78                 Accepts]: Start accepts. Automaton has 1513 states and 2231 transitions. Word has length 372
[2025-03-03 17:20:27,314 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 17:20:27,314 INFO  L471      AbstractCegarLoop]: Abstraction has 1513 states and 2231 transitions.
[2025-03-03 17:20:27,314 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 72.0) internal successors, (360), 5 states have internal predecessors, (360), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-03 17:20:27,314 INFO  L276                IsEmpty]: Start isEmpty. Operand 1513 states and 2231 transitions.
[2025-03-03 17:20:27,315 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 374
[2025-03-03 17:20:27,315 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 17:20:27,315 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 17:20:27,315 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32
[2025-03-03 17:20:27,315 INFO  L396      AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 17:20:27,316 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 17:20:27,316 INFO  L85        PathProgramCache]: Analyzing trace with hash 1437580658, now seen corresponding path program 1 times
[2025-03-03 17:20:27,316 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 17:20:27,316 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807066309]
[2025-03-03 17:20:27,316 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 17:20:27,316 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 17:20:27,385 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 373 statements into 1 equivalence classes.
[2025-03-03 17:20:27,453 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 373 of 373 statements.
[2025-03-03 17:20:27,453 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 17:20:27,453 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 17:20:27,745 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-03-03 17:20:27,745 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 17:20:27,745 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807066309]
[2025-03-03 17:20:27,745 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807066309] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 17:20:27,745 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 17:20:27,745 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 17:20:27,746 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447086307]
[2025-03-03 17:20:27,746 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 17:20:27,746 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 17:20:27,746 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 17:20:27,746 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 17:20:27,746 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-03 17:20:27,746 INFO  L87              Difference]: Start difference. First operand 1513 states and 2231 transitions. Second operand  has 5 states, 5 states have (on average 72.2) internal successors, (361), 5 states have internal predecessors, (361), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-03 17:20:28,333 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 17:20:28,333 INFO  L93              Difference]: Finished difference Result 2732 states and 4022 transitions.
[2025-03-03 17:20:28,334 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 17:20:28,334 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 72.2) internal successors, (361), 5 states have internal predecessors, (361), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 373
[2025-03-03 17:20:28,334 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 17:20:28,336 INFO  L225             Difference]: With dead ends: 2732
[2025-03-03 17:20:28,336 INFO  L226             Difference]: Without dead ends: 1513
[2025-03-03 17:20:28,337 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-03-03 17:20:28,337 INFO  L435           NwaCegarLoop]: 1625 mSDtfsCounter, 4009 mSDsluCounter, 1627 mSDsCounter, 0 mSdLazyCounter, 1204 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4012 SdHoareTripleChecker+Valid, 3252 SdHoareTripleChecker+Invalid, 1205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-03 17:20:28,337 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [4012 Valid, 3252 Invalid, 1205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1204 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-03 17:20:28,338 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1513 states.
[2025-03-03 17:20:28,347 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1513.
[2025-03-03 17:20:28,348 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1513 states, 1508 states have (on average 1.4748010610079576) internal successors, (2224), 1508 states have internal predecessors, (2224), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2025-03-03 17:20:28,349 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 2230 transitions.
[2025-03-03 17:20:28,349 INFO  L78                 Accepts]: Start accepts. Automaton has 1513 states and 2230 transitions. Word has length 373
[2025-03-03 17:20:28,350 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 17:20:28,350 INFO  L471      AbstractCegarLoop]: Abstraction has 1513 states and 2230 transitions.
[2025-03-03 17:20:28,350 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 72.2) internal successors, (361), 5 states have internal predecessors, (361), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-03 17:20:28,350 INFO  L276                IsEmpty]: Start isEmpty. Operand 1513 states and 2230 transitions.
[2025-03-03 17:20:28,351 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 375
[2025-03-03 17:20:28,351 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 17:20:28,351 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 17:20:28,352 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33
[2025-03-03 17:20:28,352 INFO  L396      AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 17:20:28,352 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 17:20:28,352 INFO  L85        PathProgramCache]: Analyzing trace with hash 1614555845, now seen corresponding path program 1 times
[2025-03-03 17:20:28,352 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 17:20:28,352 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953198985]
[2025-03-03 17:20:28,352 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 17:20:28,352 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 17:20:28,423 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 374 statements into 1 equivalence classes.
[2025-03-03 17:20:28,496 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 374 of 374 statements.
[2025-03-03 17:20:28,496 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 17:20:28,496 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 17:20:28,771 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-03-03 17:20:28,771 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 17:20:28,771 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953198985]
[2025-03-03 17:20:28,771 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953198985] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 17:20:28,771 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 17:20:28,772 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 17:20:28,772 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537632649]
[2025-03-03 17:20:28,772 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 17:20:28,772 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 17:20:28,772 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 17:20:28,772 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 17:20:28,772 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-03 17:20:28,773 INFO  L87              Difference]: Start difference. First operand 1513 states and 2230 transitions. Second operand  has 5 states, 5 states have (on average 72.4) internal successors, (362), 5 states have internal predecessors, (362), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-03 17:20:29,367 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 17:20:29,367 INFO  L93              Difference]: Finished difference Result 2732 states and 4020 transitions.
[2025-03-03 17:20:29,368 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 17:20:29,368 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 72.4) internal successors, (362), 5 states have internal predecessors, (362), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 374
[2025-03-03 17:20:29,368 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 17:20:29,369 INFO  L225             Difference]: With dead ends: 2732
[2025-03-03 17:20:29,369 INFO  L226             Difference]: Without dead ends: 1513
[2025-03-03 17:20:29,370 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-03-03 17:20:29,371 INFO  L435           NwaCegarLoop]: 1625 mSDtfsCounter, 4001 mSDsluCounter, 1627 mSDsCounter, 0 mSdLazyCounter, 1202 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4004 SdHoareTripleChecker+Valid, 3252 SdHoareTripleChecker+Invalid, 1203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-03 17:20:29,371 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [4004 Valid, 3252 Invalid, 1203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1202 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-03 17:20:29,372 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1513 states.
[2025-03-03 17:20:29,379 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1513.
[2025-03-03 17:20:29,380 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1513 states, 1508 states have (on average 1.4741379310344827) internal successors, (2223), 1508 states have internal predecessors, (2223), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2025-03-03 17:20:29,381 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 2229 transitions.
[2025-03-03 17:20:29,381 INFO  L78                 Accepts]: Start accepts. Automaton has 1513 states and 2229 transitions. Word has length 374
[2025-03-03 17:20:29,381 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 17:20:29,381 INFO  L471      AbstractCegarLoop]: Abstraction has 1513 states and 2229 transitions.
[2025-03-03 17:20:29,381 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 72.4) internal successors, (362), 5 states have internal predecessors, (362), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-03 17:20:29,381 INFO  L276                IsEmpty]: Start isEmpty. Operand 1513 states and 2229 transitions.
[2025-03-03 17:20:29,382 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 376
[2025-03-03 17:20:29,383 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 17:20:29,383 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 17:20:29,383 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34
[2025-03-03 17:20:29,383 INFO  L396      AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 17:20:29,383 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 17:20:29,383 INFO  L85        PathProgramCache]: Analyzing trace with hash -1431455059, now seen corresponding path program 1 times
[2025-03-03 17:20:29,383 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 17:20:29,383 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008318997]
[2025-03-03 17:20:29,383 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 17:20:29,383 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 17:20:29,448 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 375 statements into 1 equivalence classes.
[2025-03-03 17:20:29,553 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 375 of 375 statements.
[2025-03-03 17:20:29,553 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 17:20:29,553 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 17:20:29,805 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-03-03 17:20:29,806 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 17:20:29,806 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008318997]
[2025-03-03 17:20:29,806 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008318997] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 17:20:29,806 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 17:20:29,806 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 17:20:29,806 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594223147]
[2025-03-03 17:20:29,806 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 17:20:29,806 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 17:20:29,806 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 17:20:29,807 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 17:20:29,807 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-03 17:20:29,807 INFO  L87              Difference]: Start difference. First operand 1513 states and 2229 transitions. Second operand  has 5 states, 5 states have (on average 72.6) internal successors, (363), 5 states have internal predecessors, (363), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-03 17:20:30,392 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 17:20:30,392 INFO  L93              Difference]: Finished difference Result 2732 states and 4018 transitions.
[2025-03-03 17:20:30,393 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 17:20:30,393 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 72.6) internal successors, (363), 5 states have internal predecessors, (363), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 375
[2025-03-03 17:20:30,393 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 17:20:30,394 INFO  L225             Difference]: With dead ends: 2732
[2025-03-03 17:20:30,394 INFO  L226             Difference]: Without dead ends: 1513
[2025-03-03 17:20:30,395 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-03-03 17:20:30,395 INFO  L435           NwaCegarLoop]: 1625 mSDtfsCounter, 3993 mSDsluCounter, 1627 mSDsCounter, 0 mSdLazyCounter, 1200 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3996 SdHoareTripleChecker+Valid, 3252 SdHoareTripleChecker+Invalid, 1201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-03 17:20:30,396 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [3996 Valid, 3252 Invalid, 1201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1200 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-03 17:20:30,397 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1513 states.
[2025-03-03 17:20:30,404 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1513.
[2025-03-03 17:20:30,405 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1513 states, 1508 states have (on average 1.473474801061008) internal successors, (2222), 1508 states have internal predecessors, (2222), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2025-03-03 17:20:30,406 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 2228 transitions.
[2025-03-03 17:20:30,406 INFO  L78                 Accepts]: Start accepts. Automaton has 1513 states and 2228 transitions. Word has length 375
[2025-03-03 17:20:30,406 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 17:20:30,406 INFO  L471      AbstractCegarLoop]: Abstraction has 1513 states and 2228 transitions.
[2025-03-03 17:20:30,406 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 72.6) internal successors, (363), 5 states have internal predecessors, (363), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-03 17:20:30,406 INFO  L276                IsEmpty]: Start isEmpty. Operand 1513 states and 2228 transitions.
[2025-03-03 17:20:30,408 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 377
[2025-03-03 17:20:30,408 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 17:20:30,408 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 17:20:30,408 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35
[2025-03-03 17:20:30,408 INFO  L396      AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 17:20:30,408 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 17:20:30,408 INFO  L85        PathProgramCache]: Analyzing trace with hash -537168544, now seen corresponding path program 1 times
[2025-03-03 17:20:30,408 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 17:20:30,408 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596284474]
[2025-03-03 17:20:30,408 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 17:20:30,408 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 17:20:30,473 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 376 statements into 1 equivalence classes.
[2025-03-03 17:20:30,557 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 376 of 376 statements.
[2025-03-03 17:20:30,557 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 17:20:30,557 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 17:20:30,925 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-03-03 17:20:30,926 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 17:20:30,926 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596284474]
[2025-03-03 17:20:30,926 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596284474] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 17:20:30,926 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 17:20:30,926 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-03 17:20:30,926 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033564658]
[2025-03-03 17:20:30,926 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 17:20:30,926 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-03 17:20:30,926 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 17:20:30,927 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-03 17:20:30,927 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-03 17:20:30,927 INFO  L87              Difference]: Start difference. First operand 1513 states and 2228 transitions. Second operand  has 4 states, 4 states have (on average 91.0) internal successors, (364), 4 states have internal predecessors, (364), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-03 17:20:31,455 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 17:20:31,455 INFO  L93              Difference]: Finished difference Result 2732 states and 4016 transitions.
[2025-03-03 17:20:31,455 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 17:20:31,456 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 91.0) internal successors, (364), 4 states have internal predecessors, (364), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 376
[2025-03-03 17:20:31,456 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 17:20:31,457 INFO  L225             Difference]: With dead ends: 2732
[2025-03-03 17:20:31,457 INFO  L226             Difference]: Without dead ends: 1513
[2025-03-03 17:20:31,458 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-03-03 17:20:31,458 INFO  L435           NwaCegarLoop]: 1721 mSDtfsCounter, 1966 mSDsluCounter, 1723 mSDsCounter, 0 mSdLazyCounter, 1006 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1966 SdHoareTripleChecker+Valid, 3444 SdHoareTripleChecker+Invalid, 1006 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1006 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-03 17:20:31,458 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1966 Valid, 3444 Invalid, 1006 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1006 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-03 17:20:31,459 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1513 states.
[2025-03-03 17:20:31,472 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1513.
[2025-03-03 17:20:31,472 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1513 states, 1508 states have (on average 1.4728116710875332) internal successors, (2221), 1508 states have internal predecessors, (2221), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2025-03-03 17:20:31,474 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 2227 transitions.
[2025-03-03 17:20:31,474 INFO  L78                 Accepts]: Start accepts. Automaton has 1513 states and 2227 transitions. Word has length 376
[2025-03-03 17:20:31,475 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 17:20:31,475 INFO  L471      AbstractCegarLoop]: Abstraction has 1513 states and 2227 transitions.
[2025-03-03 17:20:31,475 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 91.0) internal successors, (364), 4 states have internal predecessors, (364), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-03 17:20:31,475 INFO  L276                IsEmpty]: Start isEmpty. Operand 1513 states and 2227 transitions.
[2025-03-03 17:20:31,477 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 378
[2025-03-03 17:20:31,477 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 17:20:31,477 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 17:20:31,477 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36
[2025-03-03 17:20:31,478 INFO  L396      AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 17:20:31,480 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 17:20:31,481 INFO  L85        PathProgramCache]: Analyzing trace with hash -1141705971, now seen corresponding path program 1 times
[2025-03-03 17:20:31,481 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 17:20:31,481 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369714074]
[2025-03-03 17:20:31,481 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 17:20:31,481 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 17:20:31,580 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 377 statements into 1 equivalence classes.
[2025-03-03 17:20:31,705 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 377 of 377 statements.
[2025-03-03 17:20:31,706 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 17:20:31,706 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 17:20:32,037 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-03-03 17:20:32,037 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 17:20:32,037 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369714074]
[2025-03-03 17:20:32,037 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369714074] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 17:20:32,037 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 17:20:32,037 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 17:20:32,037 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072069886]
[2025-03-03 17:20:32,037 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 17:20:32,038 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 17:20:32,038 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 17:20:32,038 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 17:20:32,038 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-03 17:20:32,038 INFO  L87              Difference]: Start difference. First operand 1513 states and 2227 transitions. Second operand  has 5 states, 5 states have (on average 73.0) internal successors, (365), 5 states have internal predecessors, (365), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-03 17:20:32,594 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 17:20:32,594 INFO  L93              Difference]: Finished difference Result 2762 states and 4058 transitions.
[2025-03-03 17:20:32,595 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-03 17:20:32,595 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 73.0) internal successors, (365), 5 states have internal predecessors, (365), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 377
[2025-03-03 17:20:32,595 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 17:20:32,596 INFO  L225             Difference]: With dead ends: 2762
[2025-03-03 17:20:32,596 INFO  L226             Difference]: Without dead ends: 1513
[2025-03-03 17:20:32,597 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2025-03-03 17:20:32,598 INFO  L435           NwaCegarLoop]: 1830 mSDtfsCounter, 2025 mSDsluCounter, 3555 mSDsCounter, 0 mSdLazyCounter, 1287 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2025 SdHoareTripleChecker+Valid, 5385 SdHoareTripleChecker+Invalid, 1301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-03 17:20:32,598 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2025 Valid, 5385 Invalid, 1301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1287 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-03 17:20:32,599 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1513 states.
[2025-03-03 17:20:32,607 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1513.
[2025-03-03 17:20:32,607 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1513 states, 1508 states have (on average 1.4721485411140585) internal successors, (2220), 1508 states have internal predecessors, (2220), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2025-03-03 17:20:32,608 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 2226 transitions.
[2025-03-03 17:20:32,609 INFO  L78                 Accepts]: Start accepts. Automaton has 1513 states and 2226 transitions. Word has length 377
[2025-03-03 17:20:32,609 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 17:20:32,609 INFO  L471      AbstractCegarLoop]: Abstraction has 1513 states and 2226 transitions.
[2025-03-03 17:20:32,609 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 73.0) internal successors, (365), 5 states have internal predecessors, (365), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-03 17:20:32,609 INFO  L276                IsEmpty]: Start isEmpty. Operand 1513 states and 2226 transitions.
[2025-03-03 17:20:32,610 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 379
[2025-03-03 17:20:32,610 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 17:20:32,610 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 17:20:32,610 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37
[2025-03-03 17:20:32,611 INFO  L396      AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 17:20:32,611 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 17:20:32,611 INFO  L85        PathProgramCache]: Analyzing trace with hash 1997080501, now seen corresponding path program 1 times
[2025-03-03 17:20:32,611 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 17:20:32,611 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261838435]
[2025-03-03 17:20:32,611 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 17:20:32,611 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 17:20:32,678 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 378 statements into 1 equivalence classes.
[2025-03-03 17:20:32,754 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 378 of 378 statements.
[2025-03-03 17:20:32,754 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 17:20:32,754 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 17:20:33,003 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-03-03 17:20:33,003 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 17:20:33,003 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261838435]
[2025-03-03 17:20:33,003 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261838435] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 17:20:33,003 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 17:20:33,003 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 17:20:33,003 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778654977]
[2025-03-03 17:20:33,003 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 17:20:33,004 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 17:20:33,004 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 17:20:33,004 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 17:20:33,004 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-03 17:20:33,004 INFO  L87              Difference]: Start difference. First operand 1513 states and 2226 transitions. Second operand  has 5 states, 5 states have (on average 73.2) internal successors, (366), 5 states have internal predecessors, (366), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-03 17:20:33,498 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 17:20:33,499 INFO  L93              Difference]: Finished difference Result 2732 states and 4012 transitions.
[2025-03-03 17:20:33,499 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 17:20:33,499 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 73.2) internal successors, (366), 5 states have internal predecessors, (366), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 378
[2025-03-03 17:20:33,499 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 17:20:33,500 INFO  L225             Difference]: With dead ends: 2732
[2025-03-03 17:20:33,500 INFO  L226             Difference]: Without dead ends: 1513
[2025-03-03 17:20:33,502 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-03-03 17:20:33,503 INFO  L435           NwaCegarLoop]: 1721 mSDtfsCounter, 4199 mSDsluCounter, 1723 mSDsCounter, 0 mSdLazyCounter, 1002 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4202 SdHoareTripleChecker+Valid, 3444 SdHoareTripleChecker+Invalid, 1003 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1002 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-03 17:20:33,503 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [4202 Valid, 3444 Invalid, 1003 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1002 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-03 17:20:33,504 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1513 states.
[2025-03-03 17:20:33,513 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1513.
[2025-03-03 17:20:33,514 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1513 states, 1508 states have (on average 1.4714854111405835) internal successors, (2219), 1508 states have internal predecessors, (2219), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2025-03-03 17:20:33,515 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 2225 transitions.
[2025-03-03 17:20:33,515 INFO  L78                 Accepts]: Start accepts. Automaton has 1513 states and 2225 transitions. Word has length 378
[2025-03-03 17:20:33,516 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 17:20:33,516 INFO  L471      AbstractCegarLoop]: Abstraction has 1513 states and 2225 transitions.
[2025-03-03 17:20:33,516 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 73.2) internal successors, (366), 5 states have internal predecessors, (366), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-03 17:20:33,516 INFO  L276                IsEmpty]: Start isEmpty. Operand 1513 states and 2225 transitions.
[2025-03-03 17:20:33,517 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 380
[2025-03-03 17:20:33,517 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 17:20:33,517 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 17:20:33,517 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38
[2025-03-03 17:20:33,518 INFO  L396      AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 17:20:33,518 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 17:20:33,518 INFO  L85        PathProgramCache]: Analyzing trace with hash 923027538, now seen corresponding path program 1 times
[2025-03-03 17:20:33,518 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 17:20:33,518 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100846727]
[2025-03-03 17:20:33,518 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 17:20:33,518 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 17:20:33,592 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 379 statements into 1 equivalence classes.
[2025-03-03 17:20:33,671 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 379 of 379 statements.
[2025-03-03 17:20:33,671 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 17:20:33,671 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 17:20:33,948 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-03-03 17:20:33,948 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 17:20:33,948 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100846727]
[2025-03-03 17:20:33,948 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100846727] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 17:20:33,948 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 17:20:33,948 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 17:20:33,948 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562270444]
[2025-03-03 17:20:33,948 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 17:20:33,949 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 17:20:33,949 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 17:20:33,949 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 17:20:33,949 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-03 17:20:33,949 INFO  L87              Difference]: Start difference. First operand 1513 states and 2225 transitions. Second operand  has 5 states, 5 states have (on average 73.4) internal successors, (367), 5 states have internal predecessors, (367), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-03 17:20:34,460 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 17:20:34,460 INFO  L93              Difference]: Finished difference Result 2732 states and 4010 transitions.
[2025-03-03 17:20:34,460 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 17:20:34,460 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 73.4) internal successors, (367), 5 states have internal predecessors, (367), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 379
[2025-03-03 17:20:34,461 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 17:20:34,462 INFO  L225             Difference]: With dead ends: 2732
[2025-03-03 17:20:34,462 INFO  L226             Difference]: Without dead ends: 1513
[2025-03-03 17:20:34,463 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-03-03 17:20:34,463 INFO  L435           NwaCegarLoop]: 1721 mSDtfsCounter, 2206 mSDsluCounter, 1730 mSDsCounter, 0 mSdLazyCounter, 1000 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2209 SdHoareTripleChecker+Valid, 3451 SdHoareTripleChecker+Invalid, 1001 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1000 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-03 17:20:34,463 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2209 Valid, 3451 Invalid, 1001 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1000 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-03 17:20:34,464 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1513 states.
[2025-03-03 17:20:34,472 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1513.
[2025-03-03 17:20:34,473 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1513 states, 1508 states have (on average 1.4708222811671088) internal successors, (2218), 1508 states have internal predecessors, (2218), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2025-03-03 17:20:34,474 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 2224 transitions.
[2025-03-03 17:20:34,474 INFO  L78                 Accepts]: Start accepts. Automaton has 1513 states and 2224 transitions. Word has length 379
[2025-03-03 17:20:34,474 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 17:20:34,474 INFO  L471      AbstractCegarLoop]: Abstraction has 1513 states and 2224 transitions.
[2025-03-03 17:20:34,474 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 73.4) internal successors, (367), 5 states have internal predecessors, (367), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-03 17:20:34,474 INFO  L276                IsEmpty]: Start isEmpty. Operand 1513 states and 2224 transitions.
[2025-03-03 17:20:34,476 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 381
[2025-03-03 17:20:34,476 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 17:20:34,476 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 17:20:34,476 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39
[2025-03-03 17:20:34,476 INFO  L396      AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 17:20:34,476 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 17:20:34,476 INFO  L85        PathProgramCache]: Analyzing trace with hash -443733798, now seen corresponding path program 1 times
[2025-03-03 17:20:34,476 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 17:20:34,476 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894478710]
[2025-03-03 17:20:34,476 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 17:20:34,476 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 17:20:34,543 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 380 statements into 1 equivalence classes.
[2025-03-03 17:20:34,624 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 380 of 380 statements.
[2025-03-03 17:20:34,624 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 17:20:34,624 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 17:20:34,876 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-03-03 17:20:34,877 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 17:20:34,877 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894478710]
[2025-03-03 17:20:34,877 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894478710] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 17:20:34,877 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 17:20:34,877 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 17:20:34,877 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240936066]
[2025-03-03 17:20:34,877 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 17:20:34,877 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 17:20:34,877 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 17:20:34,878 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 17:20:34,878 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-03 17:20:34,878 INFO  L87              Difference]: Start difference. First operand 1513 states and 2224 transitions. Second operand  has 5 states, 5 states have (on average 73.6) internal successors, (368), 5 states have internal predecessors, (368), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-03 17:20:35,377 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 17:20:35,377 INFO  L93              Difference]: Finished difference Result 2732 states and 4008 transitions.
[2025-03-03 17:20:35,378 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 17:20:35,378 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 73.6) internal successors, (368), 5 states have internal predecessors, (368), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 380
[2025-03-03 17:20:35,378 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 17:20:35,380 INFO  L225             Difference]: With dead ends: 2732
[2025-03-03 17:20:35,380 INFO  L226             Difference]: Without dead ends: 1513
[2025-03-03 17:20:35,381 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-03-03 17:20:35,381 INFO  L435           NwaCegarLoop]: 1721 mSDtfsCounter, 4183 mSDsluCounter, 1723 mSDsCounter, 0 mSdLazyCounter, 998 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4186 SdHoareTripleChecker+Valid, 3444 SdHoareTripleChecker+Invalid, 999 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 998 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-03 17:20:35,381 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [4186 Valid, 3444 Invalid, 999 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 998 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-03 17:20:35,383 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1513 states.
[2025-03-03 17:20:35,391 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1513.
[2025-03-03 17:20:35,392 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1513 states, 1508 states have (on average 1.470159151193634) internal successors, (2217), 1508 states have internal predecessors, (2217), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2025-03-03 17:20:35,393 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 2223 transitions.
[2025-03-03 17:20:35,393 INFO  L78                 Accepts]: Start accepts. Automaton has 1513 states and 2223 transitions. Word has length 380
[2025-03-03 17:20:35,393 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 17:20:35,393 INFO  L471      AbstractCegarLoop]: Abstraction has 1513 states and 2223 transitions.
[2025-03-03 17:20:35,393 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 73.6) internal successors, (368), 5 states have internal predecessors, (368), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-03 17:20:35,394 INFO  L276                IsEmpty]: Start isEmpty. Operand 1513 states and 2223 transitions.
[2025-03-03 17:20:35,395 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 382
[2025-03-03 17:20:35,395 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 17:20:35,395 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 17:20:35,395 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40
[2025-03-03 17:20:35,395 INFO  L396      AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 17:20:35,395 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 17:20:35,396 INFO  L85        PathProgramCache]: Analyzing trace with hash -545520617, now seen corresponding path program 1 times
[2025-03-03 17:20:35,396 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 17:20:35,396 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735183971]
[2025-03-03 17:20:35,396 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 17:20:35,396 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 17:20:35,464 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 381 statements into 1 equivalence classes.
[2025-03-03 17:20:35,538 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 381 of 381 statements.
[2025-03-03 17:20:35,538 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 17:20:35,538 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 17:20:35,834 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-03-03 17:20:35,834 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 17:20:35,834 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735183971]
[2025-03-03 17:20:35,834 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735183971] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 17:20:35,834 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 17:20:35,834 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 17:20:35,834 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640211792]
[2025-03-03 17:20:35,834 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 17:20:35,835 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 17:20:35,835 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 17:20:35,835 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 17:20:35,835 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-03 17:20:35,835 INFO  L87              Difference]: Start difference. First operand 1513 states and 2223 transitions. Second operand  has 5 states, 5 states have (on average 73.8) internal successors, (369), 5 states have internal predecessors, (369), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-03 17:20:36,343 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 17:20:36,344 INFO  L93              Difference]: Finished difference Result 2732 states and 4006 transitions.
[2025-03-03 17:20:36,344 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 17:20:36,344 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 73.8) internal successors, (369), 5 states have internal predecessors, (369), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 381
[2025-03-03 17:20:36,344 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 17:20:36,346 INFO  L225             Difference]: With dead ends: 2732
[2025-03-03 17:20:36,346 INFO  L226             Difference]: Without dead ends: 1513
[2025-03-03 17:20:36,347 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-03-03 17:20:36,347 INFO  L435           NwaCegarLoop]: 1721 mSDtfsCounter, 4175 mSDsluCounter, 1723 mSDsCounter, 0 mSdLazyCounter, 996 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4178 SdHoareTripleChecker+Valid, 3444 SdHoareTripleChecker+Invalid, 997 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 996 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-03 17:20:36,347 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [4178 Valid, 3444 Invalid, 997 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 996 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-03 17:20:36,349 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1513 states.
[2025-03-03 17:20:36,357 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1513.
[2025-03-03 17:20:36,358 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1513 states, 1508 states have (on average 1.469496021220159) internal successors, (2216), 1508 states have internal predecessors, (2216), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2025-03-03 17:20:36,359 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 2222 transitions.
[2025-03-03 17:20:36,359 INFO  L78                 Accepts]: Start accepts. Automaton has 1513 states and 2222 transitions. Word has length 381
[2025-03-03 17:20:36,359 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 17:20:36,359 INFO  L471      AbstractCegarLoop]: Abstraction has 1513 states and 2222 transitions.
[2025-03-03 17:20:36,359 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 73.8) internal successors, (369), 5 states have internal predecessors, (369), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-03 17:20:36,360 INFO  L276                IsEmpty]: Start isEmpty. Operand 1513 states and 2222 transitions.
[2025-03-03 17:20:36,361 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 383
[2025-03-03 17:20:36,362 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 17:20:36,362 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 17:20:36,362 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41
[2025-03-03 17:20:36,362 INFO  L396      AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 17:20:36,363 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 17:20:36,363 INFO  L85        PathProgramCache]: Analyzing trace with hash -859166593, now seen corresponding path program 1 times
[2025-03-03 17:20:36,363 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 17:20:36,364 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862602583]
[2025-03-03 17:20:36,364 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 17:20:36,364 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 17:20:36,436 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 382 statements into 1 equivalence classes.
[2025-03-03 17:20:36,516 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 382 of 382 statements.
[2025-03-03 17:20:36,516 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 17:20:36,517 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 17:20:36,766 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-03-03 17:20:36,766 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 17:20:36,766 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862602583]
[2025-03-03 17:20:36,766 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862602583] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 17:20:36,766 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 17:20:36,766 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 17:20:36,766 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960284162]
[2025-03-03 17:20:36,766 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 17:20:36,767 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 17:20:36,767 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 17:20:36,767 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 17:20:36,767 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-03 17:20:36,767 INFO  L87              Difference]: Start difference. First operand 1513 states and 2222 transitions. Second operand  has 5 states, 5 states have (on average 74.0) internal successors, (370), 5 states have internal predecessors, (370), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-03 17:20:37,259 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 17:20:37,260 INFO  L93              Difference]: Finished difference Result 2732 states and 4004 transitions.
[2025-03-03 17:20:37,260 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 17:20:37,261 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 74.0) internal successors, (370), 5 states have internal predecessors, (370), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 382
[2025-03-03 17:20:37,261 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 17:20:37,263 INFO  L225             Difference]: With dead ends: 2732
[2025-03-03 17:20:37,263 INFO  L226             Difference]: Without dead ends: 1513
[2025-03-03 17:20:37,265 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-03-03 17:20:37,265 INFO  L435           NwaCegarLoop]: 1721 mSDtfsCounter, 4167 mSDsluCounter, 1723 mSDsCounter, 0 mSdLazyCounter, 994 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4170 SdHoareTripleChecker+Valid, 3444 SdHoareTripleChecker+Invalid, 995 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 994 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-03 17:20:37,265 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [4170 Valid, 3444 Invalid, 995 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 994 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-03 17:20:37,266 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1513 states.
[2025-03-03 17:20:37,277 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1513.
[2025-03-03 17:20:37,278 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1513 states, 1508 states have (on average 1.4688328912466844) internal successors, (2215), 1508 states have internal predecessors, (2215), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2025-03-03 17:20:37,280 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 2221 transitions.
[2025-03-03 17:20:37,280 INFO  L78                 Accepts]: Start accepts. Automaton has 1513 states and 2221 transitions. Word has length 382
[2025-03-03 17:20:37,281 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 17:20:37,282 INFO  L471      AbstractCegarLoop]: Abstraction has 1513 states and 2221 transitions.
[2025-03-03 17:20:37,282 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 74.0) internal successors, (370), 5 states have internal predecessors, (370), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-03 17:20:37,282 INFO  L276                IsEmpty]: Start isEmpty. Operand 1513 states and 2221 transitions.
[2025-03-03 17:20:37,283 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 384
[2025-03-03 17:20:37,284 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 17:20:37,284 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 17:20:37,284 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42
[2025-03-03 17:20:37,284 INFO  L396      AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 17:20:37,284 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 17:20:37,284 INFO  L85        PathProgramCache]: Analyzing trace with hash -876452260, now seen corresponding path program 1 times
[2025-03-03 17:20:37,284 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 17:20:37,285 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249189065]
[2025-03-03 17:20:37,285 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 17:20:37,285 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 17:20:37,359 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 383 statements into 1 equivalence classes.
[2025-03-03 17:20:37,460 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 383 of 383 statements.
[2025-03-03 17:20:37,461 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 17:20:37,461 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 17:20:37,722 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-03-03 17:20:37,722 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 17:20:37,722 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249189065]
[2025-03-03 17:20:37,722 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249189065] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 17:20:37,722 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 17:20:37,722 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 17:20:37,722 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648299010]
[2025-03-03 17:20:37,722 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 17:20:37,722 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 17:20:37,723 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 17:20:37,723 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 17:20:37,723 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-03 17:20:37,723 INFO  L87              Difference]: Start difference. First operand 1513 states and 2221 transitions. Second operand  has 5 states, 5 states have (on average 74.2) internal successors, (371), 5 states have internal predecessors, (371), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-03 17:20:38,228 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 17:20:38,228 INFO  L93              Difference]: Finished difference Result 2732 states and 4002 transitions.
[2025-03-03 17:20:38,228 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 17:20:38,229 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 74.2) internal successors, (371), 5 states have internal predecessors, (371), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 383
[2025-03-03 17:20:38,229 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 17:20:38,230 INFO  L225             Difference]: With dead ends: 2732
[2025-03-03 17:20:38,230 INFO  L226             Difference]: Without dead ends: 1513
[2025-03-03 17:20:38,231 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-03-03 17:20:38,232 INFO  L435           NwaCegarLoop]: 1721 mSDtfsCounter, 2190 mSDsluCounter, 1730 mSDsCounter, 0 mSdLazyCounter, 992 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2193 SdHoareTripleChecker+Valid, 3451 SdHoareTripleChecker+Invalid, 993 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 992 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-03 17:20:38,232 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2193 Valid, 3451 Invalid, 993 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 992 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-03 17:20:38,233 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1513 states.
[2025-03-03 17:20:38,240 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1513.
[2025-03-03 17:20:38,241 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1513 states, 1508 states have (on average 1.4681697612732096) internal successors, (2214), 1508 states have internal predecessors, (2214), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2025-03-03 17:20:38,242 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 2220 transitions.
[2025-03-03 17:20:38,242 INFO  L78                 Accepts]: Start accepts. Automaton has 1513 states and 2220 transitions. Word has length 383
[2025-03-03 17:20:38,243 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 17:20:38,243 INFO  L471      AbstractCegarLoop]: Abstraction has 1513 states and 2220 transitions.
[2025-03-03 17:20:38,243 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 74.2) internal successors, (371), 5 states have internal predecessors, (371), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-03 17:20:38,243 INFO  L276                IsEmpty]: Start isEmpty. Operand 1513 states and 2220 transitions.
[2025-03-03 17:20:38,244 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 385
[2025-03-03 17:20:38,244 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 17:20:38,244 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 17:20:38,244 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43
[2025-03-03 17:20:38,244 INFO  L396      AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 17:20:38,245 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 17:20:38,245 INFO  L85        PathProgramCache]: Analyzing trace with hash -253606236, now seen corresponding path program 1 times
[2025-03-03 17:20:38,245 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 17:20:38,245 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594908563]
[2025-03-03 17:20:38,245 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 17:20:38,245 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 17:20:38,314 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 384 statements into 1 equivalence classes.
[2025-03-03 17:20:38,424 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 384 of 384 statements.
[2025-03-03 17:20:38,425 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 17:20:38,425 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 17:20:38,659 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-03-03 17:20:38,659 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 17:20:38,659 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594908563]
[2025-03-03 17:20:38,659 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594908563] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 17:20:38,659 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 17:20:38,659 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 17:20:38,659 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018915317]
[2025-03-03 17:20:38,659 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 17:20:38,659 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 17:20:38,659 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 17:20:38,660 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 17:20:38,660 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-03 17:20:38,660 INFO  L87              Difference]: Start difference. First operand 1513 states and 2220 transitions. Second operand  has 5 states, 5 states have (on average 74.4) internal successors, (372), 5 states have internal predecessors, (372), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-03 17:20:39,162 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 17:20:39,162 INFO  L93              Difference]: Finished difference Result 2732 states and 4000 transitions.
[2025-03-03 17:20:39,162 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 17:20:39,162 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 74.4) internal successors, (372), 5 states have internal predecessors, (372), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 384
[2025-03-03 17:20:39,163 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 17:20:39,164 INFO  L225             Difference]: With dead ends: 2732
[2025-03-03 17:20:39,164 INFO  L226             Difference]: Without dead ends: 1513
[2025-03-03 17:20:39,165 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-03-03 17:20:39,165 INFO  L435           NwaCegarLoop]: 1721 mSDtfsCounter, 4151 mSDsluCounter, 1723 mSDsCounter, 0 mSdLazyCounter, 990 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4154 SdHoareTripleChecker+Valid, 3444 SdHoareTripleChecker+Invalid, 991 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 990 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-03 17:20:39,165 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [4154 Valid, 3444 Invalid, 991 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 990 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-03 17:20:39,166 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1513 states.
[2025-03-03 17:20:39,173 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1513.
[2025-03-03 17:20:39,174 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1513 states, 1508 states have (on average 1.4675066312997347) internal successors, (2213), 1508 states have internal predecessors, (2213), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2025-03-03 17:20:39,175 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 2219 transitions.
[2025-03-03 17:20:39,175 INFO  L78                 Accepts]: Start accepts. Automaton has 1513 states and 2219 transitions. Word has length 384
[2025-03-03 17:20:39,176 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 17:20:39,176 INFO  L471      AbstractCegarLoop]: Abstraction has 1513 states and 2219 transitions.
[2025-03-03 17:20:39,176 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 74.4) internal successors, (372), 5 states have internal predecessors, (372), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-03 17:20:39,176 INFO  L276                IsEmpty]: Start isEmpty. Operand 1513 states and 2219 transitions.
[2025-03-03 17:20:39,177 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 386
[2025-03-03 17:20:39,177 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 17:20:39,177 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 17:20:39,177 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44
[2025-03-03 17:20:39,177 INFO  L396      AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 17:20:39,177 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 17:20:39,178 INFO  L85        PathProgramCache]: Analyzing trace with hash 1210036001, now seen corresponding path program 1 times
[2025-03-03 17:20:39,178 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 17:20:39,178 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697792322]
[2025-03-03 17:20:39,178 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 17:20:39,178 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 17:20:39,252 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 385 statements into 1 equivalence classes.
[2025-03-03 17:20:39,336 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 385 of 385 statements.
[2025-03-03 17:20:39,336 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 17:20:39,336 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 17:20:39,586 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-03-03 17:20:39,586 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 17:20:39,586 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697792322]
[2025-03-03 17:20:39,586 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697792322] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 17:20:39,586 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 17:20:39,586 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 17:20:39,586 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686577787]
[2025-03-03 17:20:39,586 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 17:20:39,586 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 17:20:39,586 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 17:20:39,587 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 17:20:39,587 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-03 17:20:39,587 INFO  L87              Difference]: Start difference. First operand 1513 states and 2219 transitions. Second operand  has 5 states, 5 states have (on average 74.6) internal successors, (373), 5 states have internal predecessors, (373), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-03 17:20:40,091 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 17:20:40,091 INFO  L93              Difference]: Finished difference Result 2732 states and 3998 transitions.
[2025-03-03 17:20:40,092 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 17:20:40,092 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 74.6) internal successors, (373), 5 states have internal predecessors, (373), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 385
[2025-03-03 17:20:40,092 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 17:20:40,093 INFO  L225             Difference]: With dead ends: 2732
[2025-03-03 17:20:40,093 INFO  L226             Difference]: Without dead ends: 1513
[2025-03-03 17:20:40,094 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-03-03 17:20:40,095 INFO  L435           NwaCegarLoop]: 1721 mSDtfsCounter, 4143 mSDsluCounter, 1723 mSDsCounter, 0 mSdLazyCounter, 988 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4146 SdHoareTripleChecker+Valid, 3444 SdHoareTripleChecker+Invalid, 989 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 988 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-03 17:20:40,095 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [4146 Valid, 3444 Invalid, 989 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 988 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-03 17:20:40,096 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1513 states.
[2025-03-03 17:20:40,104 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1513.
[2025-03-03 17:20:40,105 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1513 states, 1508 states have (on average 1.46684350132626) internal successors, (2212), 1508 states have internal predecessors, (2212), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2025-03-03 17:20:40,106 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 2218 transitions.
[2025-03-03 17:20:40,106 INFO  L78                 Accepts]: Start accepts. Automaton has 1513 states and 2218 transitions. Word has length 385
[2025-03-03 17:20:40,106 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 17:20:40,106 INFO  L471      AbstractCegarLoop]: Abstraction has 1513 states and 2218 transitions.
[2025-03-03 17:20:40,106 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 74.6) internal successors, (373), 5 states have internal predecessors, (373), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-03 17:20:40,106 INFO  L276                IsEmpty]: Start isEmpty. Operand 1513 states and 2218 transitions.
[2025-03-03 17:20:40,107 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 387
[2025-03-03 17:20:40,107 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 17:20:40,108 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 17:20:40,108 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45
[2025-03-03 17:20:40,108 INFO  L396      AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 17:20:40,108 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 17:20:40,108 INFO  L85        PathProgramCache]: Analyzing trace with hash -1051212983, now seen corresponding path program 1 times
[2025-03-03 17:20:40,108 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 17:20:40,108 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465912432]
[2025-03-03 17:20:40,108 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 17:20:40,108 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 17:20:40,180 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 386 statements into 1 equivalence classes.
[2025-03-03 17:20:40,263 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 386 of 386 statements.
[2025-03-03 17:20:40,263 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 17:20:40,263 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 17:20:40,550 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-03-03 17:20:40,550 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 17:20:40,550 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465912432]
[2025-03-03 17:20:40,550 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465912432] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 17:20:40,550 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 17:20:40,550 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 17:20:40,550 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802584614]
[2025-03-03 17:20:40,550 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 17:20:40,550 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 17:20:40,550 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 17:20:40,551 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 17:20:40,551 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-03 17:20:40,551 INFO  L87              Difference]: Start difference. First operand 1513 states and 2218 transitions. Second operand  has 5 states, 5 states have (on average 74.8) internal successors, (374), 5 states have internal predecessors, (374), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-03 17:20:41,056 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 17:20:41,056 INFO  L93              Difference]: Finished difference Result 2732 states and 3996 transitions.
[2025-03-03 17:20:41,056 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 17:20:41,056 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 74.8) internal successors, (374), 5 states have internal predecessors, (374), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 386
[2025-03-03 17:20:41,057 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 17:20:41,058 INFO  L225             Difference]: With dead ends: 2732
[2025-03-03 17:20:41,058 INFO  L226             Difference]: Without dead ends: 1513
[2025-03-03 17:20:41,059 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-03-03 17:20:41,059 INFO  L435           NwaCegarLoop]: 1721 mSDtfsCounter, 2178 mSDsluCounter, 1730 mSDsCounter, 0 mSdLazyCounter, 986 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2181 SdHoareTripleChecker+Valid, 3451 SdHoareTripleChecker+Invalid, 987 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 986 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-03 17:20:41,059 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2181 Valid, 3451 Invalid, 987 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 986 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-03 17:20:41,061 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1513 states.
[2025-03-03 17:20:41,069 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1513.
[2025-03-03 17:20:41,070 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1513 states, 1508 states have (on average 1.4661803713527852) internal successors, (2211), 1508 states have internal predecessors, (2211), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2025-03-03 17:20:41,071 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 2217 transitions.
[2025-03-03 17:20:41,071 INFO  L78                 Accepts]: Start accepts. Automaton has 1513 states and 2217 transitions. Word has length 386
[2025-03-03 17:20:41,071 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 17:20:41,071 INFO  L471      AbstractCegarLoop]: Abstraction has 1513 states and 2217 transitions.
[2025-03-03 17:20:41,071 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 74.8) internal successors, (374), 5 states have internal predecessors, (374), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-03 17:20:41,071 INFO  L276                IsEmpty]: Start isEmpty. Operand 1513 states and 2217 transitions.
[2025-03-03 17:20:41,073 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 388
[2025-03-03 17:20:41,073 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 17:20:41,073 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 17:20:41,073 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46
[2025-03-03 17:20:41,073 INFO  L396      AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 17:20:41,073 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 17:20:41,073 INFO  L85        PathProgramCache]: Analyzing trace with hash -692314522, now seen corresponding path program 1 times
[2025-03-03 17:20:41,073 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 17:20:41,073 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342200308]
[2025-03-03 17:20:41,073 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 17:20:41,074 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 17:20:41,148 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 387 statements into 1 equivalence classes.
[2025-03-03 17:20:41,232 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 387 of 387 statements.
[2025-03-03 17:20:41,232 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 17:20:41,232 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 17:20:41,483 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-03-03 17:20:41,483 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 17:20:41,483 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342200308]
[2025-03-03 17:20:41,483 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342200308] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 17:20:41,483 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 17:20:41,483 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 17:20:41,483 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088596765]
[2025-03-03 17:20:41,483 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 17:20:41,483 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 17:20:41,483 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 17:20:41,484 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 17:20:41,484 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-03 17:20:41,484 INFO  L87              Difference]: Start difference. First operand 1513 states and 2217 transitions. Second operand  has 5 states, 5 states have (on average 75.0) internal successors, (375), 5 states have internal predecessors, (375), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-03 17:20:42,005 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 17:20:42,005 INFO  L93              Difference]: Finished difference Result 2732 states and 3994 transitions.
[2025-03-03 17:20:42,005 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 17:20:42,006 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 75.0) internal successors, (375), 5 states have internal predecessors, (375), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 387
[2025-03-03 17:20:42,006 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 17:20:42,007 INFO  L225             Difference]: With dead ends: 2732
[2025-03-03 17:20:42,007 INFO  L226             Difference]: Without dead ends: 1513
[2025-03-03 17:20:42,009 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-03-03 17:20:42,009 INFO  L435           NwaCegarLoop]: 1721 mSDtfsCounter, 4127 mSDsluCounter, 1723 mSDsCounter, 0 mSdLazyCounter, 984 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4130 SdHoareTripleChecker+Valid, 3444 SdHoareTripleChecker+Invalid, 985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 984 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-03 17:20:42,009 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [4130 Valid, 3444 Invalid, 985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 984 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-03 17:20:42,010 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1513 states.
[2025-03-03 17:20:42,018 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1513.
[2025-03-03 17:20:42,019 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1513 states, 1508 states have (on average 1.4655172413793103) internal successors, (2210), 1508 states have internal predecessors, (2210), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2025-03-03 17:20:42,020 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 2216 transitions.
[2025-03-03 17:20:42,020 INFO  L78                 Accepts]: Start accepts. Automaton has 1513 states and 2216 transitions. Word has length 387
[2025-03-03 17:20:42,021 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 17:20:42,021 INFO  L471      AbstractCegarLoop]: Abstraction has 1513 states and 2216 transitions.
[2025-03-03 17:20:42,021 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 75.0) internal successors, (375), 5 states have internal predecessors, (375), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-03 17:20:42,021 INFO  L276                IsEmpty]: Start isEmpty. Operand 1513 states and 2216 transitions.
[2025-03-03 17:20:42,022 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 389
[2025-03-03 17:20:42,022 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 17:20:42,022 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 17:20:42,022 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47
[2025-03-03 17:20:42,022 INFO  L396      AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 17:20:42,023 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 17:20:42,023 INFO  L85        PathProgramCache]: Analyzing trace with hash -116597138, now seen corresponding path program 1 times
[2025-03-03 17:20:42,023 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 17:20:42,023 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115401343]
[2025-03-03 17:20:42,023 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 17:20:42,023 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 17:20:42,100 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 388 statements into 1 equivalence classes.
[2025-03-03 17:20:42,180 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 388 of 388 statements.
[2025-03-03 17:20:42,180 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 17:20:42,180 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 17:20:42,445 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-03-03 17:20:42,445 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 17:20:42,445 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115401343]
[2025-03-03 17:20:42,445 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115401343] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 17:20:42,445 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 17:20:42,445 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 17:20:42,445 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102477654]
[2025-03-03 17:20:42,445 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 17:20:42,446 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 17:20:42,446 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 17:20:42,446 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 17:20:42,446 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-03 17:20:42,446 INFO  L87              Difference]: Start difference. First operand 1513 states and 2216 transitions. Second operand  has 5 states, 5 states have (on average 75.2) internal successors, (376), 5 states have internal predecessors, (376), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-03 17:20:42,968 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 17:20:42,968 INFO  L93              Difference]: Finished difference Result 2732 states and 3992 transitions.
[2025-03-03 17:20:42,968 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 17:20:42,968 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 75.2) internal successors, (376), 5 states have internal predecessors, (376), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 388
[2025-03-03 17:20:42,969 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 17:20:42,970 INFO  L225             Difference]: With dead ends: 2732
[2025-03-03 17:20:42,970 INFO  L226             Difference]: Without dead ends: 1513
[2025-03-03 17:20:42,971 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-03-03 17:20:42,971 INFO  L435           NwaCegarLoop]: 1721 mSDtfsCounter, 2170 mSDsluCounter, 1730 mSDsCounter, 0 mSdLazyCounter, 982 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2173 SdHoareTripleChecker+Valid, 3451 SdHoareTripleChecker+Invalid, 983 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 982 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-03 17:20:42,972 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2173 Valid, 3451 Invalid, 983 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 982 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-03 17:20:42,973 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1513 states.
[2025-03-03 17:20:42,982 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1513.
[2025-03-03 17:20:42,983 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1513 states, 1508 states have (on average 1.4648541114058355) internal successors, (2209), 1508 states have internal predecessors, (2209), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2025-03-03 17:20:42,984 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 2215 transitions.
[2025-03-03 17:20:42,985 INFO  L78                 Accepts]: Start accepts. Automaton has 1513 states and 2215 transitions. Word has length 388
[2025-03-03 17:20:42,985 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 17:20:42,985 INFO  L471      AbstractCegarLoop]: Abstraction has 1513 states and 2215 transitions.
[2025-03-03 17:20:42,985 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 75.2) internal successors, (376), 5 states have internal predecessors, (376), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-03 17:20:42,985 INFO  L276                IsEmpty]: Start isEmpty. Operand 1513 states and 2215 transitions.
[2025-03-03 17:20:42,986 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 390
[2025-03-03 17:20:42,986 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 17:20:42,987 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 17:20:42,987 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48
[2025-03-03 17:20:42,987 INFO  L396      AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 17:20:42,987 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 17:20:42,987 INFO  L85        PathProgramCache]: Analyzing trace with hash 799011883, now seen corresponding path program 1 times
[2025-03-03 17:20:42,987 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 17:20:42,988 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549354646]
[2025-03-03 17:20:42,988 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 17:20:42,988 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 17:20:43,074 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 389 statements into 1 equivalence classes.
[2025-03-03 17:20:43,164 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 389 of 389 statements.
[2025-03-03 17:20:43,164 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 17:20:43,164 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 17:20:43,430 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-03-03 17:20:43,430 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 17:20:43,430 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549354646]
[2025-03-03 17:20:43,430 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549354646] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 17:20:43,430 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 17:20:43,430 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 17:20:43,430 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100659214]
[2025-03-03 17:20:43,430 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 17:20:43,430 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 17:20:43,430 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 17:20:43,431 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 17:20:43,431 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-03 17:20:43,431 INFO  L87              Difference]: Start difference. First operand 1513 states and 2215 transitions. Second operand  has 5 states, 5 states have (on average 75.4) internal successors, (377), 5 states have internal predecessors, (377), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-03 17:20:43,940 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 17:20:43,941 INFO  L93              Difference]: Finished difference Result 2732 states and 3990 transitions.
[2025-03-03 17:20:43,941 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 17:20:43,941 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 75.4) internal successors, (377), 5 states have internal predecessors, (377), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 389
[2025-03-03 17:20:43,942 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 17:20:43,943 INFO  L225             Difference]: With dead ends: 2732
[2025-03-03 17:20:43,943 INFO  L226             Difference]: Without dead ends: 1513
[2025-03-03 17:20:43,945 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-03-03 17:20:43,945 INFO  L435           NwaCegarLoop]: 1721 mSDtfsCounter, 4111 mSDsluCounter, 1723 mSDsCounter, 0 mSdLazyCounter, 980 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4114 SdHoareTripleChecker+Valid, 3444 SdHoareTripleChecker+Invalid, 981 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 980 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-03 17:20:43,945 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [4114 Valid, 3444 Invalid, 981 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 980 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-03 17:20:43,946 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1513 states.
[2025-03-03 17:20:43,958 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1513.
[2025-03-03 17:20:43,960 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1513 states, 1508 states have (on average 1.4641909814323608) internal successors, (2208), 1508 states have internal predecessors, (2208), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2025-03-03 17:20:43,961 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 2214 transitions.
[2025-03-03 17:20:43,961 INFO  L78                 Accepts]: Start accepts. Automaton has 1513 states and 2214 transitions. Word has length 389
[2025-03-03 17:20:43,962 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 17:20:43,962 INFO  L471      AbstractCegarLoop]: Abstraction has 1513 states and 2214 transitions.
[2025-03-03 17:20:43,962 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 75.4) internal successors, (377), 5 states have internal predecessors, (377), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-03 17:20:43,962 INFO  L276                IsEmpty]: Start isEmpty. Operand 1513 states and 2214 transitions.
[2025-03-03 17:20:43,963 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 391
[2025-03-03 17:20:43,963 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 17:20:43,964 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 17:20:43,964 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49
[2025-03-03 17:20:43,964 INFO  L396      AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 17:20:43,964 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 17:20:43,964 INFO  L85        PathProgramCache]: Analyzing trace with hash 1044633619, now seen corresponding path program 1 times
[2025-03-03 17:20:43,964 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 17:20:43,964 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975744741]
[2025-03-03 17:20:43,964 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 17:20:43,964 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 17:20:44,040 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 390 statements into 1 equivalence classes.
[2025-03-03 17:20:44,128 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 390 of 390 statements.
[2025-03-03 17:20:44,129 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 17:20:44,129 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 17:20:44,398 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-03-03 17:20:44,398 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 17:20:44,398 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975744741]
[2025-03-03 17:20:44,398 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975744741] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 17:20:44,398 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 17:20:44,398 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 17:20:44,398 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389855599]
[2025-03-03 17:20:44,398 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 17:20:44,399 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 17:20:44,399 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 17:20:44,399 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 17:20:44,399 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-03 17:20:44,399 INFO  L87              Difference]: Start difference. First operand 1513 states and 2214 transitions. Second operand  has 5 states, 5 states have (on average 75.6) internal successors, (378), 5 states have internal predecessors, (378), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-03 17:20:44,916 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 17:20:44,916 INFO  L93              Difference]: Finished difference Result 2732 states and 3988 transitions.
[2025-03-03 17:20:44,916 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 17:20:44,917 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 75.6) internal successors, (378), 5 states have internal predecessors, (378), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 390
[2025-03-03 17:20:44,917 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 17:20:44,918 INFO  L225             Difference]: With dead ends: 2732
[2025-03-03 17:20:44,918 INFO  L226             Difference]: Without dead ends: 1513
[2025-03-03 17:20:44,919 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-03-03 17:20:44,920 INFO  L435           NwaCegarLoop]: 1721 mSDtfsCounter, 2162 mSDsluCounter, 1730 mSDsCounter, 0 mSdLazyCounter, 978 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2165 SdHoareTripleChecker+Valid, 3451 SdHoareTripleChecker+Invalid, 979 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 978 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-03 17:20:44,920 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2165 Valid, 3451 Invalid, 979 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 978 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-03 17:20:44,921 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1513 states.
[2025-03-03 17:20:44,929 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1513.
[2025-03-03 17:20:44,930 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1513 states, 1508 states have (on average 1.4635278514588859) internal successors, (2207), 1508 states have internal predecessors, (2207), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2025-03-03 17:20:44,931 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 2213 transitions.
[2025-03-03 17:20:44,932 INFO  L78                 Accepts]: Start accepts. Automaton has 1513 states and 2213 transitions. Word has length 390
[2025-03-03 17:20:44,932 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 17:20:44,932 INFO  L471      AbstractCegarLoop]: Abstraction has 1513 states and 2213 transitions.
[2025-03-03 17:20:44,932 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 75.6) internal successors, (378), 5 states have internal predecessors, (378), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-03 17:20:44,932 INFO  L276                IsEmpty]: Start isEmpty. Operand 1513 states and 2213 transitions.
[2025-03-03 17:20:44,933 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 392
[2025-03-03 17:20:44,933 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 17:20:44,934 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 17:20:44,934 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50
[2025-03-03 17:20:44,934 INFO  L396      AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 17:20:44,934 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 17:20:44,934 INFO  L85        PathProgramCache]: Analyzing trace with hash 1085501552, now seen corresponding path program 1 times
[2025-03-03 17:20:44,934 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 17:20:44,934 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054209826]
[2025-03-03 17:20:44,934 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 17:20:44,934 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 17:20:45,010 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 391 statements into 1 equivalence classes.
[2025-03-03 17:20:45,134 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 391 of 391 statements.
[2025-03-03 17:20:45,134 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 17:20:45,134 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 17:20:45,401 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-03-03 17:20:45,402 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 17:20:45,402 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054209826]
[2025-03-03 17:20:45,402 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054209826] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 17:20:45,402 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 17:20:45,402 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 17:20:45,402 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708199965]
[2025-03-03 17:20:45,402 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 17:20:45,402 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 17:20:45,402 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 17:20:45,403 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 17:20:45,403 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-03 17:20:45,403 INFO  L87              Difference]: Start difference. First operand 1513 states and 2213 transitions. Second operand  has 5 states, 5 states have (on average 75.8) internal successors, (379), 5 states have internal predecessors, (379), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-03 17:20:45,889 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 17:20:45,889 INFO  L93              Difference]: Finished difference Result 2732 states and 3986 transitions.
[2025-03-03 17:20:45,889 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 17:20:45,889 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 75.8) internal successors, (379), 5 states have internal predecessors, (379), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 391
[2025-03-03 17:20:45,890 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 17:20:45,891 INFO  L225             Difference]: With dead ends: 2732
[2025-03-03 17:20:45,891 INFO  L226             Difference]: Without dead ends: 1513
[2025-03-03 17:20:45,892 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-03-03 17:20:45,892 INFO  L435           NwaCegarLoop]: 1721 mSDtfsCounter, 4095 mSDsluCounter, 1723 mSDsCounter, 0 mSdLazyCounter, 976 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4098 SdHoareTripleChecker+Valid, 3444 SdHoareTripleChecker+Invalid, 977 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 976 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-03 17:20:45,892 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [4098 Valid, 3444 Invalid, 977 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 976 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-03 17:20:45,893 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1513 states.
[2025-03-03 17:20:45,900 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1513.
[2025-03-03 17:20:45,901 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1513 states, 1508 states have (on average 1.4628647214854111) internal successors, (2206), 1508 states have internal predecessors, (2206), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2025-03-03 17:20:45,902 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 2212 transitions.
[2025-03-03 17:20:45,902 INFO  L78                 Accepts]: Start accepts. Automaton has 1513 states and 2212 transitions. Word has length 391
[2025-03-03 17:20:45,902 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 17:20:45,902 INFO  L471      AbstractCegarLoop]: Abstraction has 1513 states and 2212 transitions.
[2025-03-03 17:20:45,902 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 75.8) internal successors, (379), 5 states have internal predecessors, (379), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-03 17:20:45,902 INFO  L276                IsEmpty]: Start isEmpty. Operand 1513 states and 2212 transitions.
[2025-03-03 17:20:45,903 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 393
[2025-03-03 17:20:45,903 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 17:20:45,903 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 17:20:45,903 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51
[2025-03-03 17:20:45,903 INFO  L396      AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 17:20:45,904 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 17:20:45,904 INFO  L85        PathProgramCache]: Analyzing trace with hash -1029771208, now seen corresponding path program 1 times
[2025-03-03 17:20:45,904 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 17:20:45,904 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429585723]
[2025-03-03 17:20:45,904 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 17:20:45,904 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 17:20:45,973 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 392 statements into 1 equivalence classes.
[2025-03-03 17:20:46,077 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 392 of 392 statements.
[2025-03-03 17:20:46,077 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 17:20:46,077 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 17:20:46,452 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-03-03 17:20:46,452 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 17:20:46,452 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429585723]
[2025-03-03 17:20:46,452 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429585723] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 17:20:46,452 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 17:20:46,452 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-03 17:20:46,452 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875128070]
[2025-03-03 17:20:46,452 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 17:20:46,453 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-03 17:20:46,453 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 17:20:46,453 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-03 17:20:46,453 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-03 17:20:46,453 INFO  L87              Difference]: Start difference. First operand 1513 states and 2212 transitions. Second operand  has 4 states, 4 states have (on average 95.0) internal successors, (380), 4 states have internal predecessors, (380), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3)
[2025-03-03 17:20:46,864 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 17:20:46,865 INFO  L93              Difference]: Finished difference Result 2732 states and 3984 transitions.
[2025-03-03 17:20:46,865 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 17:20:46,865 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), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 392
[2025-03-03 17:20:46,865 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 17:20:46,867 INFO  L225             Difference]: With dead ends: 2732
[2025-03-03 17:20:46,867 INFO  L226             Difference]: Without dead ends: 1513
[2025-03-03 17:20:46,868 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-03-03 17:20:46,868 INFO  L435           NwaCegarLoop]: 1822 mSDtfsCounter, 2045 mSDsluCounter, 1824 mSDsCounter, 0 mSdLazyCounter, 772 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2047 SdHoareTripleChecker+Valid, 3646 SdHoareTripleChecker+Invalid, 772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 772 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-03 17:20:46,868 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2047 Valid, 3646 Invalid, 772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 772 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-03 17:20:46,873 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1513 states.
[2025-03-03 17:20:46,882 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1513.
[2025-03-03 17:20:46,883 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1513 states, 1508 states have (on average 1.4622015915119364) internal successors, (2205), 1508 states have internal predecessors, (2205), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2025-03-03 17:20:46,884 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 2211 transitions.
[2025-03-03 17:20:46,885 INFO  L78                 Accepts]: Start accepts. Automaton has 1513 states and 2211 transitions. Word has length 392
[2025-03-03 17:20:46,885 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 17:20:46,885 INFO  L471      AbstractCegarLoop]: Abstraction has 1513 states and 2211 transitions.
[2025-03-03 17:20:46,885 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), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3)
[2025-03-03 17:20:46,885 INFO  L276                IsEmpty]: Start isEmpty. Operand 1513 states and 2211 transitions.
[2025-03-03 17:20:46,886 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 394
[2025-03-03 17:20:46,886 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 17:20:46,887 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 17:20:46,887 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52
[2025-03-03 17:20:46,887 INFO  L396      AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 17:20:46,887 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 17:20:46,887 INFO  L85        PathProgramCache]: Analyzing trace with hash -1182884751, now seen corresponding path program 1 times
[2025-03-03 17:20:46,887 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 17:20:46,887 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195996311]
[2025-03-03 17:20:46,887 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 17:20:46,887 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 17:20:46,964 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 393 statements into 1 equivalence classes.
[2025-03-03 17:20:47,108 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 393 of 393 statements.
[2025-03-03 17:20:47,108 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 17:20:47,108 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 17:20:47,500 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-03-03 17:20:47,500 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 17:20:47,500 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195996311]
[2025-03-03 17:20:47,500 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195996311] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 17:20:47,500 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 17:20:47,501 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-03 17:20:47,501 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180411664]
[2025-03-03 17:20:47,501 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 17:20:47,501 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-03 17:20:47,501 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 17:20:47,502 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-03 17:20:47,502 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-03 17:20:47,502 INFO  L87              Difference]: Start difference. First operand 1513 states and 2211 transitions. Second operand  has 4 states, 4 states have (on average 95.25) internal successors, (381), 4 states have internal predecessors, (381), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-03 17:20:47,959 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 17:20:47,960 INFO  L93              Difference]: Finished difference Result 2732 states and 3982 transitions.
[2025-03-03 17:20:47,960 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 17:20:47,960 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), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 393
[2025-03-03 17:20:47,960 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 17:20:47,962 INFO  L225             Difference]: With dead ends: 2732
[2025-03-03 17:20:47,962 INFO  L226             Difference]: Without dead ends: 1513
[2025-03-03 17:20:47,962 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-03-03 17:20:47,963 INFO  L435           NwaCegarLoop]: 1768 mSDtfsCounter, 1980 mSDsluCounter, 1770 mSDsCounter, 0 mSdLazyCounter, 878 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1980 SdHoareTripleChecker+Valid, 3538 SdHoareTripleChecker+Invalid, 878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 878 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-03 17:20:47,963 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1980 Valid, 3538 Invalid, 878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 878 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-03 17:20:47,964 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1513 states.
[2025-03-03 17:20:47,971 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1513.
[2025-03-03 17:20:47,972 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1513 states, 1508 states have (on average 1.4615384615384615) internal successors, (2204), 1508 states have internal predecessors, (2204), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2025-03-03 17:20:47,973 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 2210 transitions.
[2025-03-03 17:20:47,974 INFO  L78                 Accepts]: Start accepts. Automaton has 1513 states and 2210 transitions. Word has length 393
[2025-03-03 17:20:47,974 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 17:20:47,974 INFO  L471      AbstractCegarLoop]: Abstraction has 1513 states and 2210 transitions.
[2025-03-03 17:20:47,974 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), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-03 17:20:47,974 INFO  L276                IsEmpty]: Start isEmpty. Operand 1513 states and 2210 transitions.
[2025-03-03 17:20:47,975 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 395
[2025-03-03 17:20:47,975 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 17:20:47,975 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 17:20:47,975 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53
[2025-03-03 17:20:47,976 INFO  L396      AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 17:20:47,976 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 17:20:47,976 INFO  L85        PathProgramCache]: Analyzing trace with hash -661479652, now seen corresponding path program 1 times
[2025-03-03 17:20:47,976 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 17:20:47,976 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337905185]
[2025-03-03 17:20:47,976 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 17:20:47,976 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 17:20:48,051 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 394 statements into 1 equivalence classes.
[2025-03-03 17:20:48,149 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 394 of 394 statements.
[2025-03-03 17:20:48,149 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 17:20:48,149 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 17:20:48,408 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-03-03 17:20:48,408 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 17:20:48,408 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337905185]
[2025-03-03 17:20:48,408 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337905185] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 17:20:48,408 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 17:20:48,408 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 17:20:48,408 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536572962]
[2025-03-03 17:20:48,408 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 17:20:48,408 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 17:20:48,408 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 17:20:48,409 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 17:20:48,409 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-03 17:20:48,409 INFO  L87              Difference]: Start difference. First operand 1513 states and 2210 transitions. Second operand  has 5 states, 5 states have (on average 76.4) internal successors, (382), 5 states have internal predecessors, (382), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-03 17:20:48,925 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 17:20:48,925 INFO  L93              Difference]: Finished difference Result 2746 states and 4000 transitions.
[2025-03-03 17:20:48,925 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-03 17:20:48,925 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 76.4) internal successors, (382), 5 states have internal predecessors, (382), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 394
[2025-03-03 17:20:48,925 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 17:20:48,927 INFO  L225             Difference]: With dead ends: 2746
[2025-03-03 17:20:48,927 INFO  L226             Difference]: Without dead ends: 1513
[2025-03-03 17:20:48,928 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2025-03-03 17:20:48,928 INFO  L435           NwaCegarLoop]: 1821 mSDtfsCounter, 2007 mSDsluCounter, 3593 mSDsCounter, 0 mSdLazyCounter, 1207 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2007 SdHoareTripleChecker+Valid, 5414 SdHoareTripleChecker+Invalid, 1213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-03 17:20:48,928 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2007 Valid, 5414 Invalid, 1213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1207 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-03 17:20:48,929 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1513 states.
[2025-03-03 17:20:48,938 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1513.
[2025-03-03 17:20:48,939 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1513 states, 1508 states have (on average 1.4608753315649867) internal successors, (2203), 1508 states have internal predecessors, (2203), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2025-03-03 17:20:48,940 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 2209 transitions.
[2025-03-03 17:20:48,940 INFO  L78                 Accepts]: Start accepts. Automaton has 1513 states and 2209 transitions. Word has length 394
[2025-03-03 17:20:48,940 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 17:20:48,940 INFO  L471      AbstractCegarLoop]: Abstraction has 1513 states and 2209 transitions.
[2025-03-03 17:20:48,940 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 76.4) internal successors, (382), 5 states have internal predecessors, (382), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-03 17:20:48,941 INFO  L276                IsEmpty]: Start isEmpty. Operand 1513 states and 2209 transitions.
[2025-03-03 17:20:48,942 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 396
[2025-03-03 17:20:48,942 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 17:20:48,942 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 17:20:48,942 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54
[2025-03-03 17:20:48,942 INFO  L396      AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 17:20:48,942 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 17:20:48,943 INFO  L85        PathProgramCache]: Analyzing trace with hash -1887128146, now seen corresponding path program 1 times
[2025-03-03 17:20:48,943 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 17:20:48,943 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665902893]
[2025-03-03 17:20:48,943 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 17:20:48,943 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 17:20:49,019 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 395 statements into 1 equivalence classes.
[2025-03-03 17:20:49,156 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 395 of 395 statements.
[2025-03-03 17:20:49,156 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 17:20:49,156 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 17:20:49,400 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-03-03 17:20:49,400 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 17:20:49,400 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665902893]
[2025-03-03 17:20:49,400 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665902893] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 17:20:49,400 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 17:20:49,400 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 17:20:49,400 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639785985]
[2025-03-03 17:20:49,400 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 17:20:49,400 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 17:20:49,400 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 17:20:49,401 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 17:20:49,401 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-03 17:20:49,401 INFO  L87              Difference]: Start difference. First operand 1513 states and 2209 transitions. Second operand  has 5 states, 5 states have (on average 76.6) internal successors, (383), 5 states have internal predecessors, (383), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-03 17:20:49,854 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 17:20:49,854 INFO  L93              Difference]: Finished difference Result 2732 states and 3978 transitions.
[2025-03-03 17:20:49,854 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 17:20:49,855 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 76.6) internal successors, (383), 5 states have internal predecessors, (383), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 395
[2025-03-03 17:20:49,855 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 17:20:49,856 INFO  L225             Difference]: With dead ends: 2732
[2025-03-03 17:20:49,856 INFO  L226             Difference]: Without dead ends: 1513
[2025-03-03 17:20:49,857 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-03-03 17:20:49,857 INFO  L435           NwaCegarLoop]: 1768 mSDtfsCounter, 4180 mSDsluCounter, 1770 mSDsCounter, 0 mSdLazyCounter, 874 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4183 SdHoareTripleChecker+Valid, 3538 SdHoareTripleChecker+Invalid, 875 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 874 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-03 17:20:49,857 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [4183 Valid, 3538 Invalid, 875 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 874 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-03 17:20:49,858 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1513 states.
[2025-03-03 17:20:49,866 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1513.
[2025-03-03 17:20:49,867 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1513 states, 1508 states have (on average 1.460212201591512) internal successors, (2202), 1508 states have internal predecessors, (2202), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2025-03-03 17:20:49,868 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 2208 transitions.
[2025-03-03 17:20:49,868 INFO  L78                 Accepts]: Start accepts. Automaton has 1513 states and 2208 transitions. Word has length 395
[2025-03-03 17:20:49,869 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 17:20:49,869 INFO  L471      AbstractCegarLoop]: Abstraction has 1513 states and 2208 transitions.
[2025-03-03 17:20:49,869 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 76.6) internal successors, (383), 5 states have internal predecessors, (383), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-03 17:20:49,869 INFO  L276                IsEmpty]: Start isEmpty. Operand 1513 states and 2208 transitions.
[2025-03-03 17:20:49,870 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 397
[2025-03-03 17:20:49,870 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 17:20:49,870 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 17:20:49,870 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55
[2025-03-03 17:20:49,871 INFO  L396      AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 17:20:49,871 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 17:20:49,871 INFO  L85        PathProgramCache]: Analyzing trace with hash -817242719, now seen corresponding path program 1 times
[2025-03-03 17:20:49,871 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 17:20:49,871 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443140330]
[2025-03-03 17:20:49,871 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 17:20:49,871 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 17:20:49,945 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 396 statements into 1 equivalence classes.
[2025-03-03 17:20:50,043 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 396 of 396 statements.
[2025-03-03 17:20:50,044 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 17:20:50,044 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 17:20:50,300 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-03-03 17:20:50,300 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 17:20:50,300 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443140330]
[2025-03-03 17:20:50,301 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443140330] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 17:20:50,301 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 17:20:50,301 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 17:20:50,301 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863286979]
[2025-03-03 17:20:50,301 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 17:20:50,301 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 17:20:50,301 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 17:20:50,301 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 17:20:50,301 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-03 17:20:50,302 INFO  L87              Difference]: Start difference. First operand 1513 states and 2208 transitions. Second operand  has 5 states, 5 states have (on average 76.8) internal successors, (384), 5 states have internal predecessors, (384), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-03 17:20:50,763 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 17:20:50,763 INFO  L93              Difference]: Finished difference Result 2732 states and 3976 transitions.
[2025-03-03 17:20:50,763 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 17:20:50,764 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), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 396
[2025-03-03 17:20:50,764 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 17:20:50,765 INFO  L225             Difference]: With dead ends: 2732
[2025-03-03 17:20:50,765 INFO  L226             Difference]: Without dead ends: 1513
[2025-03-03 17:20:50,766 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-03-03 17:20:50,767 INFO  L435           NwaCegarLoop]: 1768 mSDtfsCounter, 2189 mSDsluCounter, 1777 mSDsCounter, 0 mSdLazyCounter, 872 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2192 SdHoareTripleChecker+Valid, 3545 SdHoareTripleChecker+Invalid, 873 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 872 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-03 17:20:50,767 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2192 Valid, 3545 Invalid, 873 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 872 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-03 17:20:50,768 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1513 states.
[2025-03-03 17:20:50,778 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1513.
[2025-03-03 17:20:50,779 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1513 states, 1508 states have (on average 1.459549071618037) internal successors, (2201), 1508 states have internal predecessors, (2201), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2025-03-03 17:20:50,780 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 2207 transitions.
[2025-03-03 17:20:50,781 INFO  L78                 Accepts]: Start accepts. Automaton has 1513 states and 2207 transitions. Word has length 396
[2025-03-03 17:20:50,781 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 17:20:50,781 INFO  L471      AbstractCegarLoop]: Abstraction has 1513 states and 2207 transitions.
[2025-03-03 17:20:50,781 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), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-03 17:20:50,781 INFO  L276                IsEmpty]: Start isEmpty. Operand 1513 states and 2207 transitions.
[2025-03-03 17:20:50,782 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 398
[2025-03-03 17:20:50,782 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 17:20:50,783 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 17:20:50,783 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56
[2025-03-03 17:20:50,783 INFO  L396      AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 17:20:50,783 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 17:20:50,783 INFO  L85        PathProgramCache]: Analyzing trace with hash -588878445, now seen corresponding path program 1 times
[2025-03-03 17:20:50,783 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 17:20:50,783 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231075036]
[2025-03-03 17:20:50,783 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 17:20:50,783 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 17:20:50,859 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 397 statements into 1 equivalence classes.
[2025-03-03 17:20:50,967 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 397 of 397 statements.
[2025-03-03 17:20:50,967 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 17:20:50,967 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 17:20:51,275 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-03-03 17:20:51,275 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 17:20:51,275 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231075036]
[2025-03-03 17:20:51,275 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231075036] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 17:20:51,275 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 17:20:51,275 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 17:20:51,275 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773823248]
[2025-03-03 17:20:51,275 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 17:20:51,276 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 17:20:51,276 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 17:20:51,276 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 17:20:51,276 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-03 17:20:51,276 INFO  L87              Difference]: Start difference. First operand 1513 states and 2207 transitions. Second operand  has 5 states, 5 states have (on average 77.0) internal successors, (385), 5 states have internal predecessors, (385), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-03 17:20:51,729 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 17:20:51,729 INFO  L93              Difference]: Finished difference Result 2732 states and 3974 transitions.
[2025-03-03 17:20:51,730 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 17:20:51,730 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 77.0) internal successors, (385), 5 states have internal predecessors, (385), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 397
[2025-03-03 17:20:51,730 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 17:20:51,732 INFO  L225             Difference]: With dead ends: 2732
[2025-03-03 17:20:51,732 INFO  L226             Difference]: Without dead ends: 1513
[2025-03-03 17:20:51,733 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-03-03 17:20:51,733 INFO  L435           NwaCegarLoop]: 1768 mSDtfsCounter, 4164 mSDsluCounter, 1770 mSDsCounter, 0 mSdLazyCounter, 870 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4167 SdHoareTripleChecker+Valid, 3538 SdHoareTripleChecker+Invalid, 871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 870 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-03 17:20:51,733 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [4167 Valid, 3538 Invalid, 871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 870 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-03 17:20:51,734 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1513 states.
[2025-03-03 17:20:51,743 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1513.
[2025-03-03 17:20:51,744 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1513 states, 1508 states have (on average 1.4588859416445623) internal successors, (2200), 1508 states have internal predecessors, (2200), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2025-03-03 17:20:51,746 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 2206 transitions.
[2025-03-03 17:20:51,746 INFO  L78                 Accepts]: Start accepts. Automaton has 1513 states and 2206 transitions. Word has length 397
[2025-03-03 17:20:51,746 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 17:20:51,746 INFO  L471      AbstractCegarLoop]: Abstraction has 1513 states and 2206 transitions.
[2025-03-03 17:20:51,746 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 77.0) internal successors, (385), 5 states have internal predecessors, (385), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-03 17:20:51,746 INFO  L276                IsEmpty]: Start isEmpty. Operand 1513 states and 2206 transitions.
[2025-03-03 17:20:51,748 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 399
[2025-03-03 17:20:51,748 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 17:20:51,748 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 17:20:51,748 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57
[2025-03-03 17:20:51,749 INFO  L396      AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 17:20:51,749 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 17:20:51,749 INFO  L85        PathProgramCache]: Analyzing trace with hash 1209217702, now seen corresponding path program 1 times
[2025-03-03 17:20:51,749 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 17:20:51,749 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424307776]
[2025-03-03 17:20:51,749 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 17:20:51,749 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 17:20:51,835 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 398 statements into 1 equivalence classes.
[2025-03-03 17:20:51,943 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 398 of 398 statements.
[2025-03-03 17:20:51,943 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 17:20:51,943 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 17:20:52,255 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-03-03 17:20:52,255 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 17:20:52,255 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424307776]
[2025-03-03 17:20:52,255 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424307776] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 17:20:52,255 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 17:20:52,255 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 17:20:52,255 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37276198]
[2025-03-03 17:20:52,255 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 17:20:52,256 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 17:20:52,256 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 17:20:52,256 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 17:20:52,256 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-03 17:20:52,256 INFO  L87              Difference]: Start difference. First operand 1513 states and 2206 transitions. Second operand  has 5 states, 5 states have (on average 77.2) internal successors, (386), 5 states have internal predecessors, (386), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-03 17:20:52,703 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 17:20:52,703 INFO  L93              Difference]: Finished difference Result 2732 states and 3972 transitions.
[2025-03-03 17:20:52,703 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 17:20:52,703 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 77.2) internal successors, (386), 5 states have internal predecessors, (386), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 398
[2025-03-03 17:20:52,704 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 17:20:52,705 INFO  L225             Difference]: With dead ends: 2732
[2025-03-03 17:20:52,705 INFO  L226             Difference]: Without dead ends: 1513
[2025-03-03 17:20:52,706 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-03-03 17:20:52,706 INFO  L435           NwaCegarLoop]: 1768 mSDtfsCounter, 2181 mSDsluCounter, 1777 mSDsCounter, 0 mSdLazyCounter, 868 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2184 SdHoareTripleChecker+Valid, 3545 SdHoareTripleChecker+Invalid, 869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 868 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-03 17:20:52,706 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2184 Valid, 3545 Invalid, 869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 868 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-03 17:20:52,708 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1513 states.
[2025-03-03 17:20:52,718 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1513.
[2025-03-03 17:20:52,719 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1513 states, 1508 states have (on average 1.4582228116710876) internal successors, (2199), 1508 states have internal predecessors, (2199), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2025-03-03 17:20:52,721 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 2205 transitions.
[2025-03-03 17:20:52,721 INFO  L78                 Accepts]: Start accepts. Automaton has 1513 states and 2205 transitions. Word has length 398
[2025-03-03 17:20:52,721 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 17:20:52,721 INFO  L471      AbstractCegarLoop]: Abstraction has 1513 states and 2205 transitions.
[2025-03-03 17:20:52,721 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 77.2) internal successors, (386), 5 states have internal predecessors, (386), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-03 17:20:52,722 INFO  L276                IsEmpty]: Start isEmpty. Operand 1513 states and 2205 transitions.
[2025-03-03 17:20:52,723 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 400
[2025-03-03 17:20:52,723 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 17:20:52,723 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 17:20:52,723 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58
[2025-03-03 17:20:52,723 INFO  L396      AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 17:20:52,724 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 17:20:52,724 INFO  L85        PathProgramCache]: Analyzing trace with hash -1263053832, now seen corresponding path program 1 times
[2025-03-03 17:20:52,724 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 17:20:52,724 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788989332]
[2025-03-03 17:20:52,724 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 17:20:52,724 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 17:20:52,807 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 399 statements into 1 equivalence classes.
[2025-03-03 17:20:52,908 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 399 of 399 statements.
[2025-03-03 17:20:52,909 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 17:20:52,909 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 17:20:53,274 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-03-03 17:20:53,275 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 17:20:53,275 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788989332]
[2025-03-03 17:20:53,275 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788989332] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 17:20:53,275 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 17:20:53,275 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 17:20:53,275 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517210002]
[2025-03-03 17:20:53,275 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 17:20:53,275 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 17:20:53,275 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 17:20:53,276 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 17:20:53,276 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-03 17:20:53,276 INFO  L87              Difference]: Start difference. First operand 1513 states and 2205 transitions. Second operand  has 5 states, 5 states have (on average 77.4) internal successors, (387), 5 states have internal predecessors, (387), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-03 17:20:53,896 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 17:20:53,896 INFO  L93              Difference]: Finished difference Result 2732 states and 3970 transitions.
[2025-03-03 17:20:53,896 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 17:20:53,896 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), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 399
[2025-03-03 17:20:53,896 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 17:20:53,898 INFO  L225             Difference]: With dead ends: 2732
[2025-03-03 17:20:53,898 INFO  L226             Difference]: Without dead ends: 1513
[2025-03-03 17:20:53,899 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-03-03 17:20:53,899 INFO  L435           NwaCegarLoop]: 1768 mSDtfsCounter, 4148 mSDsluCounter, 1770 mSDsCounter, 0 mSdLazyCounter, 866 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4151 SdHoareTripleChecker+Valid, 3538 SdHoareTripleChecker+Invalid, 867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 866 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-03 17:20:53,900 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [4151 Valid, 3538 Invalid, 867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 866 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-03 17:20:53,901 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1513 states.
[2025-03-03 17:20:53,915 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1513.
[2025-03-03 17:20:53,916 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1513 states, 1508 states have (on average 1.4575596816976126) internal successors, (2198), 1508 states have internal predecessors, (2198), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2025-03-03 17:20:53,918 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 2204 transitions.
[2025-03-03 17:20:53,918 INFO  L78                 Accepts]: Start accepts. Automaton has 1513 states and 2204 transitions. Word has length 399
[2025-03-03 17:20:53,919 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 17:20:53,919 INFO  L471      AbstractCegarLoop]: Abstraction has 1513 states and 2204 transitions.
[2025-03-03 17:20:53,919 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), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-03 17:20:53,919 INFO  L276                IsEmpty]: Start isEmpty. Operand 1513 states and 2204 transitions.
[2025-03-03 17:20:53,921 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 401
[2025-03-03 17:20:53,922 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 17:20:53,922 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 17:20:53,922 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59
[2025-03-03 17:20:53,922 INFO  L396      AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 17:20:53,923 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 17:20:53,923 INFO  L85        PathProgramCache]: Analyzing trace with hash 1168825899, now seen corresponding path program 1 times
[2025-03-03 17:20:53,923 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 17:20:53,924 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234546487]
[2025-03-03 17:20:53,924 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 17:20:53,924 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 17:20:54,035 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 400 statements into 1 equivalence classes.
[2025-03-03 17:20:54,204 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 400 of 400 statements.
[2025-03-03 17:20:54,204 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 17:20:54,204 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 17:20:54,491 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-03-03 17:20:54,492 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 17:20:54,492 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234546487]
[2025-03-03 17:20:54,492 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234546487] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 17:20:54,492 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 17:20:54,492 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 17:20:54,492 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317817168]
[2025-03-03 17:20:54,492 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 17:20:54,492 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 17:20:54,492 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 17:20:54,492 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 17:20:54,493 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-03 17:20:54,493 INFO  L87              Difference]: Start difference. First operand 1513 states and 2204 transitions. Second operand  has 5 states, 5 states have (on average 77.6) internal successors, (388), 5 states have internal predecessors, (388), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-03 17:20:54,941 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 17:20:54,942 INFO  L93              Difference]: Finished difference Result 2732 states and 3968 transitions.
[2025-03-03 17:20:54,942 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 17:20:54,942 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), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 400
[2025-03-03 17:20:54,942 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 17:20:54,943 INFO  L225             Difference]: With dead ends: 2732
[2025-03-03 17:20:54,944 INFO  L226             Difference]: Without dead ends: 1513
[2025-03-03 17:20:54,944 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-03-03 17:20:54,945 INFO  L435           NwaCegarLoop]: 1768 mSDtfsCounter, 4140 mSDsluCounter, 1770 mSDsCounter, 0 mSdLazyCounter, 864 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4143 SdHoareTripleChecker+Valid, 3538 SdHoareTripleChecker+Invalid, 865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 864 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-03 17:20:54,945 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [4143 Valid, 3538 Invalid, 865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 864 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-03 17:20:54,946 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1513 states.
[2025-03-03 17:20:54,955 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1513.
[2025-03-03 17:20:54,955 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1513 states, 1508 states have (on average 1.456896551724138) internal successors, (2197), 1508 states have internal predecessors, (2197), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2025-03-03 17:20:54,957 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 2203 transitions.
[2025-03-03 17:20:54,957 INFO  L78                 Accepts]: Start accepts. Automaton has 1513 states and 2203 transitions. Word has length 400
[2025-03-03 17:20:54,958 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 17:20:54,958 INFO  L471      AbstractCegarLoop]: Abstraction has 1513 states and 2203 transitions.
[2025-03-03 17:20:54,958 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), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-03 17:20:54,958 INFO  L276                IsEmpty]: Start isEmpty. Operand 1513 states and 2203 transitions.
[2025-03-03 17:20:54,959 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 402
[2025-03-03 17:20:54,959 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 17:20:54,959 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 17:20:54,959 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60
[2025-03-03 17:20:54,960 INFO  L396      AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 17:20:54,960 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 17:20:54,960 INFO  L85        PathProgramCache]: Analyzing trace with hash -817518371, now seen corresponding path program 1 times
[2025-03-03 17:20:54,960 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 17:20:54,960 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258901800]
[2025-03-03 17:20:54,960 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 17:20:54,960 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 17:20:55,044 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 401 statements into 1 equivalence classes.
[2025-03-03 17:20:55,164 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 401 of 401 statements.
[2025-03-03 17:20:55,164 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 17:20:55,164 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat