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


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


Checking for ERROR reachability
Using default analysis
Version 48c9605d
Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w16_d16_e0.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) )

 --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 222be94abfdbb514b1917b4bfb3a2a13389b64e1e049c782003790d790f6753f
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-48c9605-m
[2025-02-07 22:55:35,571 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-02-07 22:55:35,626 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf
[2025-02-07 22:55:35,632 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-02-07 22:55:35,632 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-02-07 22:55:35,648 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-02-07 22:55:35,648 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-02-07 22:55:35,648 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-02-07 22:55:35,648 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-02-07 22:55:35,649 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-02-07 22:55:35,649 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-02-07 22:55:35,649 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-02-07 22:55:35,649 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-02-07 22:55:35,649 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-02-07 22:55:35,652 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-02-07 22:55:35,653 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-02-07 22:55:35,653 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-02-07 22:55:35,653 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-02-07 22:55:35,653 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-02-07 22:55:35,653 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-02-07 22:55:35,653 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-02-07 22:55:35,653 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-02-07 22:55:35,653 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-02-07 22:55:35,653 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-02-07 22:55:35,653 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-02-07 22:55:35,653 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-02-07 22:55:35,653 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-02-07 22:55:35,653 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-02-07 22:55:35,653 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-02-07 22:55:35,653 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-02-07 22:55:35,653 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-02-07 22:55:35,653 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-02-07 22:55:35,653 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-02-07 22:55:35,653 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-02-07 22:55:35,653 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-02-07 22:55:35,653 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-02-07 22:55:35,653 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-02-07 22:55:35,653 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-02-07 22:55:35,653 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-02-07 22:55:35,653 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-02-07 22:55:35,654 INFO  L153        SettingsManager]:  * Looper check in Petri net analysis=SEMANTIC
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) )


Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 222be94abfdbb514b1917b4bfb3a2a13389b64e1e049c782003790d790f6753f
[2025-02-07 22:55:35,865 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-02-07 22:55:35,871 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-02-07 22:55:35,872 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-02-07 22:55:35,873 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-02-07 22:55:35,873 INFO  L274        PluginConnector]: CDTParser initialized
[2025-02-07 22:55:35,873 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w16_d16_e0.c
[2025-02-07 22:55:37,091 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5ac5578c7/311490c46aa64654be577322f9846a36/FLAGc30bda11c
[2025-02-07 22:55:37,442 INFO  L384              CDTParser]: Found 1 translation units.
[2025-02-07 22:55:37,442 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w16_d16_e0.c
[2025-02-07 22:55:37,450 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5ac5578c7/311490c46aa64654be577322f9846a36/FLAGc30bda11c
[2025-02-07 22:55:37,673 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5ac5578c7/311490c46aa64654be577322f9846a36
[2025-02-07 22:55:37,676 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-02-07 22:55:37,677 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-02-07 22:55:37,678 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-02-07 22:55:37,678 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-02-07 22:55:37,681 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-02-07 22:55:37,681 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 10:55:37" (1/1) ...
[2025-02-07 22:55:37,683 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22d995cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:55:37, skipping insertion in model container
[2025-02-07 22:55:37,683 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 10:55:37" (1/1) ...
[2025-02-07 22:55:37,713 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-02-07 22:55:37,828 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w16_d16_e0.c[1280,1293]
[2025-02-07 22:55:37,997 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-07 22:55:38,005 INFO  L200         MainTranslator]: Completed pre-run
[2025-02-07 22:55:38,011 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w16_d16_e0.c[1280,1293]
[2025-02-07 22:55:38,090 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-07 22:55:38,099 INFO  L204         MainTranslator]: Completed translation
[2025-02-07 22:55:38,099 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:55:38 WrapperNode
[2025-02-07 22:55:38,099 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-02-07 22:55:38,100 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-02-07 22:55:38,100 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-02-07 22:55:38,100 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-02-07 22:55:38,105 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:55:38" (1/1) ...
[2025-02-07 22:55:38,131 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:55:38" (1/1) ...
[2025-02-07 22:55:38,300 INFO  L138                Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1976
[2025-02-07 22:55:38,301 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-02-07 22:55:38,302 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-02-07 22:55:38,302 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-02-07 22:55:38,302 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-02-07 22:55:38,308 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:55:38" (1/1) ...
[2025-02-07 22:55:38,308 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:55:38" (1/1) ...
[2025-02-07 22:55:38,342 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:55:38" (1/1) ...
[2025-02-07 22:55:38,393 INFO  L175           MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2025-02-07 22:55:38,393 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:55:38" (1/1) ...
[2025-02-07 22:55:38,393 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:55:38" (1/1) ...
[2025-02-07 22:55:38,434 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:55:38" (1/1) ...
[2025-02-07 22:55:38,442 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:55:38" (1/1) ...
[2025-02-07 22:55:38,452 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:55:38" (1/1) ...
[2025-02-07 22:55:38,459 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:55:38" (1/1) ...
[2025-02-07 22:55:38,481 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-02-07 22:55:38,482 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-02-07 22:55:38,482 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-02-07 22:55:38,482 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-02-07 22:55:38,482 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:55:38" (1/1) ...
[2025-02-07 22:55:38,486 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-02-07 22:55:38,493 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-07 22:55:38,504 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2025-02-07 22:55:38,505 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2025-02-07 22:55:38,520 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-02-07 22:55:38,520 INFO  L130     BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2025-02-07 22:55:38,520 INFO  L138     BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2025-02-07 22:55:38,520 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-02-07 22:55:38,520 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-02-07 22:55:38,520 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-02-07 22:55:38,798 INFO  L257             CfgBuilder]: Building ICFG
[2025-02-07 22:55:38,799 INFO  L287             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-02-07 22:55:40,431 INFO  L?                        ?]: Removed 1089 outVars from TransFormulas that were not future-live.
[2025-02-07 22:55:40,431 INFO  L308             CfgBuilder]: Performing block encoding
[2025-02-07 22:55:40,506 INFO  L332             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-02-07 22:55:40,506 INFO  L337             CfgBuilder]: Removed 0 assume(true) statements.
[2025-02-07 22:55:40,506 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 10:55:40 BoogieIcfgContainer
[2025-02-07 22:55:40,507 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-02-07 22:55:40,508 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-02-07 22:55:40,508 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-02-07 22:55:40,517 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-02-07 22:55:40,517 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 10:55:37" (1/3) ...
[2025-02-07 22:55:40,518 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8357e50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 10:55:40, skipping insertion in model container
[2025-02-07 22:55:40,518 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:55:38" (2/3) ...
[2025-02-07 22:55:40,518 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8357e50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 10:55:40, skipping insertion in model container
[2025-02-07 22:55:40,518 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 10:55:40" (3/3) ...
[2025-02-07 22:55:40,519 INFO  L128   eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.circular_pointer_top_w16_d16_e0.c
[2025-02-07 22:55:40,538 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-02-07 22:55:40,539 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.circular_pointer_top_w16_d16_e0.c that has 2 procedures, 550 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-02-07 22:55:40,581 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-02-07 22:55:40,588 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;@43065c4d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-02-07 22:55:40,588 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-02-07 22:55:40,592 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 550 states, 544 states have (on average 1.4963235294117647) internal successors, (814), 545 states have internal predecessors, (814), 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-02-07 22:55:40,601 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 149
[2025-02-07 22:55:40,601 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:55:40,602 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]
[2025-02-07 22:55:40,602 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:55:40,609 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:55:40,613 INFO  L85        PathProgramCache]: Analyzing trace with hash 75293469, now seen corresponding path program 1 times
[2025-02-07 22:55:40,622 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:55:40,626 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483780221]
[2025-02-07 22:55:40,626 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:55:40,626 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:55:40,723 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes.
[2025-02-07 22:55:40,784 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements.
[2025-02-07 22:55:40,786 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:55:40,786 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:55:40,996 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked.
[2025-02-07 22:55:40,996 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:55:40,996 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483780221]
[2025-02-07 22:55:40,997 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483780221] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-07 22:55:40,997 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [619570740]
[2025-02-07 22:55:40,997 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:55:40,997 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-07 22:55:40,997 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-07 22:55:41,000 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-02-07 22:55:41,003 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2025-02-07 22:55:41,278 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes.
[2025-02-07 22:55:41,390 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements.
[2025-02-07 22:55:41,390 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:55:41,391 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:55:41,396 INFO  L256         TraceCheckSpWp]: Trace formula consists of 929 conjuncts, 1 conjuncts are in the unsatisfiable core
[2025-02-07 22:55:41,402 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-07 22:55:41,421 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked.
[2025-02-07 22:55:41,423 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-02-07 22:55:41,423 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [619570740] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:55:41,423 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-02-07 22:55:41,423 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2
[2025-02-07 22:55:41,425 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616089960]
[2025-02-07 22:55:41,425 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:55:41,428 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2025-02-07 22:55:41,428 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:55:41,441 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2025-02-07 22:55:41,441 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-02-07 22:55:41,444 INFO  L87              Difference]: Start difference. First operand  has 550 states, 544 states have (on average 1.4963235294117647) internal successors, (814), 545 states have internal predecessors, (814), 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 69.0) internal successors, (138), 2 states have internal predecessors, (138), 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-02-07 22:55:41,627 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:55:41,628 INFO  L93              Difference]: Finished difference Result 997 states and 1491 transitions.
[2025-02-07 22:55:41,628 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2025-02-07 22:55:41,629 INFO  L78                 Accepts]: Start accepts. Automaton has  has 2 states, 2 states have (on average 69.0) internal successors, (138), 2 states have internal predecessors, (138), 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 148
[2025-02-07 22:55:41,630 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:55:41,637 INFO  L225             Difference]: With dead ends: 997
[2025-02-07 22:55:41,638 INFO  L226             Difference]: Without dead ends: 548
[2025-02-07 22:55:41,640 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 149 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-02-07 22:55:41,642 INFO  L435           NwaCegarLoop]: 683 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 683 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-02-07 22:55:41,642 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 683 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-02-07 22:55:41,652 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 548 states.
[2025-02-07 22:55:41,678 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 548.
[2025-02-07 22:55:41,679 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 548 states, 543 states have (on average 1.4917127071823204) internal successors, (810), 543 states have internal predecessors, (810), 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-02-07 22:55:41,683 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 816 transitions.
[2025-02-07 22:55:41,684 INFO  L78                 Accepts]: Start accepts. Automaton has 548 states and 816 transitions. Word has length 148
[2025-02-07 22:55:41,685 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:55:41,685 INFO  L471      AbstractCegarLoop]: Abstraction has 548 states and 816 transitions.
[2025-02-07 22:55:41,685 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 69.0) internal successors, (138), 2 states have internal predecessors, (138), 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-02-07 22:55:41,685 INFO  L276                IsEmpty]: Start isEmpty. Operand 548 states and 816 transitions.
[2025-02-07 22:55:41,687 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 149
[2025-02-07 22:55:41,687 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:55:41,687 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]
[2025-02-07 22:55:41,699 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2025-02-07 22:55:41,892 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0
[2025-02-07 22:55:41,893 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:55:41,893 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:55:41,893 INFO  L85        PathProgramCache]: Analyzing trace with hash 361194170, now seen corresponding path program 1 times
[2025-02-07 22:55:41,893 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:55:41,893 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595478584]
[2025-02-07 22:55:41,893 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:55:41,894 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:55:41,926 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes.
[2025-02-07 22:55:42,031 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements.
[2025-02-07 22:55:42,031 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:55:42,031 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:55:42,661 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-02-07 22:55:42,662 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:55:42,662 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595478584]
[2025-02-07 22:55:42,662 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595478584] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:55:42,662 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:55:42,662 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-07 22:55:42,662 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467942516]
[2025-02-07 22:55:42,662 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:55:42,663 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-07 22:55:42,663 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:55:42,664 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-07 22:55:42,664 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-07 22:55:42,664 INFO  L87              Difference]: Start difference. First operand 548 states and 816 transitions. Second operand  has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 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-02-07 22:55:42,918 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:55:42,918 INFO  L93              Difference]: Finished difference Result 552 states and 820 transitions.
[2025-02-07 22:55:42,918 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-07 22:55:42,919 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 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 148
[2025-02-07 22:55:42,919 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:55:42,921 INFO  L225             Difference]: With dead ends: 552
[2025-02-07 22:55:42,921 INFO  L226             Difference]: Without dead ends: 550
[2025-02-07 22:55:42,922 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-02-07 22:55:42,922 INFO  L435           NwaCegarLoop]: 681 mSDtfsCounter, 0 mSDsluCounter, 1357 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2038 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-02-07 22:55:42,923 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2038 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 409 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-02-07 22:55:42,923 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 550 states.
[2025-02-07 22:55:42,932 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 550.
[2025-02-07 22:55:42,933 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 550 states, 545 states have (on average 1.489908256880734) internal successors, (812), 545 states have internal predecessors, (812), 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-02-07 22:55:42,935 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 818 transitions.
[2025-02-07 22:55:42,935 INFO  L78                 Accepts]: Start accepts. Automaton has 550 states and 818 transitions. Word has length 148
[2025-02-07 22:55:42,936 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:55:42,936 INFO  L471      AbstractCegarLoop]: Abstraction has 550 states and 818 transitions.
[2025-02-07 22:55:42,936 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 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-02-07 22:55:42,936 INFO  L276                IsEmpty]: Start isEmpty. Operand 550 states and 818 transitions.
[2025-02-07 22:55:42,939 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 150
[2025-02-07 22:55:42,941 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:55:42,941 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]
[2025-02-07 22:55:42,941 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-02-07 22:55:42,941 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:55:42,942 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:55:42,942 INFO  L85        PathProgramCache]: Analyzing trace with hash -1683202985, now seen corresponding path program 1 times
[2025-02-07 22:55:42,942 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:55:42,943 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735070955]
[2025-02-07 22:55:42,943 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:55:42,943 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:55:42,980 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes.
[2025-02-07 22:55:43,050 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements.
[2025-02-07 22:55:43,051 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:55:43,051 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:55:43,342 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-02-07 22:55:43,343 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:55:43,343 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735070955]
[2025-02-07 22:55:43,343 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735070955] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:55:43,343 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:55:43,343 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-07 22:55:43,343 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405269058]
[2025-02-07 22:55:43,343 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:55:43,343 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-07 22:55:43,344 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:55:43,344 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-07 22:55:43,344 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-02-07 22:55:43,344 INFO  L87              Difference]: Start difference. First operand 550 states and 818 transitions. Second operand  has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 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-02-07 22:55:43,997 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:55:43,998 INFO  L93              Difference]: Finished difference Result 1370 states and 2040 transitions.
[2025-02-07 22:55:43,998 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-02-07 22:55:43,998 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 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 149
[2025-02-07 22:55:43,999 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:55:44,001 INFO  L225             Difference]: With dead ends: 1370
[2025-02-07 22:55:44,002 INFO  L226             Difference]: Without dead ends: 550
[2025-02-07 22:55:44,002 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-02-07 22:55:44,003 INFO  L435           NwaCegarLoop]: 716 mSDtfsCounter, 1618 mSDsluCounter, 1248 mSDsCounter, 0 mSdLazyCounter, 685 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1618 SdHoareTripleChecker+Valid, 1964 SdHoareTripleChecker+Invalid, 722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-02-07 22:55:44,003 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1618 Valid, 1964 Invalid, 722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 685 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-02-07 22:55:44,004 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 550 states.
[2025-02-07 22:55:44,011 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 550.
[2025-02-07 22:55:44,012 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 550 states, 545 states have (on average 1.4880733944954128) internal successors, (811), 545 states have internal predecessors, (811), 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-02-07 22:55:44,014 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 817 transitions.
[2025-02-07 22:55:44,014 INFO  L78                 Accepts]: Start accepts. Automaton has 550 states and 817 transitions. Word has length 149
[2025-02-07 22:55:44,014 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:55:44,014 INFO  L471      AbstractCegarLoop]: Abstraction has 550 states and 817 transitions.
[2025-02-07 22:55:44,015 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 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-02-07 22:55:44,015 INFO  L276                IsEmpty]: Start isEmpty. Operand 550 states and 817 transitions.
[2025-02-07 22:55:44,016 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 151
[2025-02-07 22:55:44,016 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:55:44,016 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]
[2025-02-07 22:55:44,016 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-02-07 22:55:44,016 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:55:44,017 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:55:44,017 INFO  L85        PathProgramCache]: Analyzing trace with hash 1457131840, now seen corresponding path program 1 times
[2025-02-07 22:55:44,017 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:55:44,017 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419401164]
[2025-02-07 22:55:44,017 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:55:44,017 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:55:44,055 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes.
[2025-02-07 22:55:44,111 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements.
[2025-02-07 22:55:44,111 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:55:44,111 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:55:44,369 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-02-07 22:55:44,370 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:55:44,370 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419401164]
[2025-02-07 22:55:44,370 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419401164] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:55:44,370 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:55:44,370 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-07 22:55:44,370 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769887636]
[2025-02-07 22:55:44,370 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:55:44,370 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-07 22:55:44,370 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:55:44,371 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-07 22:55:44,371 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-07 22:55:44,371 INFO  L87              Difference]: Start difference. First operand 550 states and 817 transitions. Second operand  has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 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-02-07 22:55:44,596 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:55:44,596 INFO  L93              Difference]: Finished difference Result 1001 states and 1486 transitions.
[2025-02-07 22:55:44,597 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-07 22:55:44,597 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 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 150
[2025-02-07 22:55:44,597 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:55:44,599 INFO  L225             Difference]: With dead ends: 1001
[2025-02-07 22:55:44,599 INFO  L226             Difference]: Without dead ends: 552
[2025-02-07 22:55:44,600 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-02-07 22:55:44,600 INFO  L435           NwaCegarLoop]: 680 mSDtfsCounter, 0 mSDsluCounter, 1352 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2032 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-02-07 22:55:44,600 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2032 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-02-07 22:55:44,601 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 552 states.
[2025-02-07 22:55:44,607 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552.
[2025-02-07 22:55:44,608 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 552 states, 547 states have (on average 1.4862888482632541) internal successors, (813), 547 states have internal predecessors, (813), 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-02-07 22:55:44,610 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 819 transitions.
[2025-02-07 22:55:44,610 INFO  L78                 Accepts]: Start accepts. Automaton has 552 states and 819 transitions. Word has length 150
[2025-02-07 22:55:44,610 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:55:44,610 INFO  L471      AbstractCegarLoop]: Abstraction has 552 states and 819 transitions.
[2025-02-07 22:55:44,610 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 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-02-07 22:55:44,610 INFO  L276                IsEmpty]: Start isEmpty. Operand 552 states and 819 transitions.
[2025-02-07 22:55:44,611 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 152
[2025-02-07 22:55:44,611 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:55:44,611 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]
[2025-02-07 22:55:44,612 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-02-07 22:55:44,612 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:55:44,612 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:55:44,612 INFO  L85        PathProgramCache]: Analyzing trace with hash -142043508, now seen corresponding path program 1 times
[2025-02-07 22:55:44,612 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:55:44,612 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821732372]
[2025-02-07 22:55:44,612 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:55:44,612 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:55:44,642 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes.
[2025-02-07 22:55:44,678 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements.
[2025-02-07 22:55:44,678 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:55:44,678 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:55:45,035 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-02-07 22:55:45,036 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:55:45,036 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821732372]
[2025-02-07 22:55:45,036 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821732372] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:55:45,036 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:55:45,036 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-07 22:55:45,036 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676205831]
[2025-02-07 22:55:45,036 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:55:45,037 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-07 22:55:45,037 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:55:45,037 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-07 22:55:45,037 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-07 22:55:45,037 INFO  L87              Difference]: Start difference. First operand 552 states and 819 transitions. Second operand  has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 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-02-07 22:55:45,306 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:55:45,307 INFO  L93              Difference]: Finished difference Result 1003 states and 1487 transitions.
[2025-02-07 22:55:45,307 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-07 22:55:45,307 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 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 151
[2025-02-07 22:55:45,307 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:55:45,309 INFO  L225             Difference]: With dead ends: 1003
[2025-02-07 22:55:45,309 INFO  L226             Difference]: Without dead ends: 552
[2025-02-07 22:55:45,310 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-02-07 22:55:45,310 INFO  L435           NwaCegarLoop]: 616 mSDtfsCounter, 691 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 691 SdHoareTripleChecker+Valid, 1233 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-02-07 22:55:45,310 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [691 Valid, 1233 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-02-07 22:55:45,311 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 552 states.
[2025-02-07 22:55:45,320 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552.
[2025-02-07 22:55:45,320 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 552 states, 547 states have (on average 1.482632541133455) internal successors, (811), 547 states have internal predecessors, (811), 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-02-07 22:55:45,322 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 817 transitions.
[2025-02-07 22:55:45,322 INFO  L78                 Accepts]: Start accepts. Automaton has 552 states and 817 transitions. Word has length 151
[2025-02-07 22:55:45,322 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:55:45,322 INFO  L471      AbstractCegarLoop]: Abstraction has 552 states and 817 transitions.
[2025-02-07 22:55:45,322 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 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-02-07 22:55:45,322 INFO  L276                IsEmpty]: Start isEmpty. Operand 552 states and 817 transitions.
[2025-02-07 22:55:45,323 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 154
[2025-02-07 22:55:45,323 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:55:45,323 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]
[2025-02-07 22:55:45,324 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-02-07 22:55:45,324 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:55:45,324 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:55:45,324 INFO  L85        PathProgramCache]: Analyzing trace with hash -775926310, now seen corresponding path program 1 times
[2025-02-07 22:55:45,324 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:55:45,324 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262462978]
[2025-02-07 22:55:45,324 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:55:45,324 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:55:45,352 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes.
[2025-02-07 22:55:45,381 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements.
[2025-02-07 22:55:45,382 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:55:45,382 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:55:45,635 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-02-07 22:55:45,635 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:55:45,636 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262462978]
[2025-02-07 22:55:45,636 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262462978] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:55:45,636 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:55:45,637 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-07 22:55:45,637 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368401023]
[2025-02-07 22:55:45,637 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:55:45,637 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-07 22:55:45,637 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:55:45,637 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-07 22:55:45,637 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-02-07 22:55:45,638 INFO  L87              Difference]: Start difference. First operand 552 states and 817 transitions. Second operand  has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 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-02-07 22:55:45,941 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:55:45,941 INFO  L93              Difference]: Finished difference Result 1011 states and 1494 transitions.
[2025-02-07 22:55:45,942 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-07 22:55:45,942 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 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 153
[2025-02-07 22:55:45,942 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:55:45,944 INFO  L225             Difference]: With dead ends: 1011
[2025-02-07 22:55:45,944 INFO  L226             Difference]: Without dead ends: 552
[2025-02-07 22:55:45,944 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-02-07 22:55:45,945 INFO  L435           NwaCegarLoop]: 671 mSDtfsCounter, 706 mSDsluCounter, 1290 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 706 SdHoareTripleChecker+Valid, 1961 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-02-07 22:55:45,945 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [706 Valid, 1961 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 480 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-02-07 22:55:45,948 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 552 states.
[2025-02-07 22:55:45,956 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552.
[2025-02-07 22:55:45,959 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 552 states, 547 states have (on average 1.4808043875685557) internal successors, (810), 547 states have internal predecessors, (810), 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-02-07 22:55:45,960 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 816 transitions.
[2025-02-07 22:55:45,960 INFO  L78                 Accepts]: Start accepts. Automaton has 552 states and 816 transitions. Word has length 153
[2025-02-07 22:55:45,961 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:55:45,961 INFO  L471      AbstractCegarLoop]: Abstraction has 552 states and 816 transitions.
[2025-02-07 22:55:45,961 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 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-02-07 22:55:45,961 INFO  L276                IsEmpty]: Start isEmpty. Operand 552 states and 816 transitions.
[2025-02-07 22:55:45,962 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 155
[2025-02-07 22:55:45,962 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:55:45,962 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]
[2025-02-07 22:55:45,962 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-02-07 22:55:45,962 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:55:45,963 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:55:45,963 INFO  L85        PathProgramCache]: Analyzing trace with hash 1472752064, now seen corresponding path program 1 times
[2025-02-07 22:55:45,963 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:55:45,963 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808110542]
[2025-02-07 22:55:45,963 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:55:45,963 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:55:45,992 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes.
[2025-02-07 22:55:46,024 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements.
[2025-02-07 22:55:46,024 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:55:46,024 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:55:46,214 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-02-07 22:55:46,215 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:55:46,215 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808110542]
[2025-02-07 22:55:46,215 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808110542] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:55:46,215 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:55:46,215 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-07 22:55:46,215 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302900556]
[2025-02-07 22:55:46,215 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:55:46,216 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-07 22:55:46,216 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:55:46,216 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-07 22:55:46,216 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-07 22:55:46,216 INFO  L87              Difference]: Start difference. First operand 552 states and 816 transitions. Second operand  has 5 states, 5 states have (on average 28.4) internal successors, (142), 5 states have internal predecessors, (142), 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-02-07 22:55:46,523 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:55:46,524 INFO  L93              Difference]: Finished difference Result 1003 states and 1481 transitions.
[2025-02-07 22:55:46,524 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-07 22:55:46,524 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 28.4) internal successors, (142), 5 states have internal predecessors, (142), 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 154
[2025-02-07 22:55:46,524 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:55:46,526 INFO  L225             Difference]: With dead ends: 1003
[2025-02-07 22:55:46,526 INFO  L226             Difference]: Without dead ends: 552
[2025-02-07 22:55:46,527 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-02-07 22:55:46,527 INFO  L435           NwaCegarLoop]: 616 mSDtfsCounter, 801 mSDsluCounter, 623 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 804 SdHoareTripleChecker+Valid, 1239 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-02-07 22:55:46,527 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [804 Valid, 1239 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-02-07 22:55:46,528 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 552 states.
[2025-02-07 22:55:46,537 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552.
[2025-02-07 22:55:46,539 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 552 states, 547 states have (on average 1.4789762340036563) internal successors, (809), 547 states have internal predecessors, (809), 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-02-07 22:55:46,540 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 815 transitions.
[2025-02-07 22:55:46,541 INFO  L78                 Accepts]: Start accepts. Automaton has 552 states and 815 transitions. Word has length 154
[2025-02-07 22:55:46,542 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:55:46,542 INFO  L471      AbstractCegarLoop]: Abstraction has 552 states and 815 transitions.
[2025-02-07 22:55:46,542 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 28.4) internal successors, (142), 5 states have internal predecessors, (142), 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-02-07 22:55:46,542 INFO  L276                IsEmpty]: Start isEmpty. Operand 552 states and 815 transitions.
[2025-02-07 22:55:46,543 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 156
[2025-02-07 22:55:46,543 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:55:46,544 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]
[2025-02-07 22:55:46,544 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-02-07 22:55:46,544 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:55:46,544 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:55:46,545 INFO  L85        PathProgramCache]: Analyzing trace with hash -262165259, now seen corresponding path program 1 times
[2025-02-07 22:55:46,545 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:55:46,545 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425923193]
[2025-02-07 22:55:46,545 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:55:46,545 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:55:46,587 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes.
[2025-02-07 22:55:46,637 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements.
[2025-02-07 22:55:46,637 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:55:46,638 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:55:46,832 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-02-07 22:55:46,832 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:55:46,832 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425923193]
[2025-02-07 22:55:46,833 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425923193] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:55:46,833 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:55:46,833 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-07 22:55:46,833 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672741353]
[2025-02-07 22:55:46,833 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:55:46,833 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-07 22:55:46,833 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:55:46,834 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-07 22:55:46,834 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-07 22:55:46,834 INFO  L87              Difference]: Start difference. First operand 552 states and 815 transitions. Second operand  has 5 states, 5 states have (on average 28.6) internal successors, (143), 5 states have internal predecessors, (143), 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-02-07 22:55:47,097 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:55:47,098 INFO  L93              Difference]: Finished difference Result 1003 states and 1479 transitions.
[2025-02-07 22:55:47,098 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-07 22:55:47,098 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 28.6) internal successors, (143), 5 states have internal predecessors, (143), 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 155
[2025-02-07 22:55:47,098 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:55:47,100 INFO  L225             Difference]: With dead ends: 1003
[2025-02-07 22:55:47,100 INFO  L226             Difference]: Without dead ends: 552
[2025-02-07 22:55:47,100 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-02-07 22:55:47,101 INFO  L435           NwaCegarLoop]: 616 mSDtfsCounter, 797 mSDsluCounter, 623 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 800 SdHoareTripleChecker+Valid, 1239 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-02-07 22:55:47,101 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [800 Valid, 1239 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-02-07 22:55:47,102 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 552 states.
[2025-02-07 22:55:47,107 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552.
[2025-02-07 22:55:47,108 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 552 states, 547 states have (on average 1.477148080438757) internal successors, (808), 547 states have internal predecessors, (808), 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-02-07 22:55:47,109 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 814 transitions.
[2025-02-07 22:55:47,109 INFO  L78                 Accepts]: Start accepts. Automaton has 552 states and 814 transitions. Word has length 155
[2025-02-07 22:55:47,110 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:55:47,110 INFO  L471      AbstractCegarLoop]: Abstraction has 552 states and 814 transitions.
[2025-02-07 22:55:47,110 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 28.6) internal successors, (143), 5 states have internal predecessors, (143), 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-02-07 22:55:47,110 INFO  L276                IsEmpty]: Start isEmpty. Operand 552 states and 814 transitions.
[2025-02-07 22:55:47,111 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 157
[2025-02-07 22:55:47,111 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:55:47,111 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]
[2025-02-07 22:55:47,111 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-02-07 22:55:47,111 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:55:47,111 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:55:47,112 INFO  L85        PathProgramCache]: Analyzing trace with hash -2096657029, now seen corresponding path program 1 times
[2025-02-07 22:55:47,112 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:55:47,112 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068969878]
[2025-02-07 22:55:47,112 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:55:47,112 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:55:47,140 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes.
[2025-02-07 22:55:47,168 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements.
[2025-02-07 22:55:47,168 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:55:47,168 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:55:47,336 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-02-07 22:55:47,336 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:55:47,336 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068969878]
[2025-02-07 22:55:47,336 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068969878] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:55:47,336 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:55:47,336 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-07 22:55:47,336 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66741240]
[2025-02-07 22:55:47,337 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:55:47,337 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-07 22:55:47,337 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:55:47,337 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-07 22:55:47,337 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-07 22:55:47,338 INFO  L87              Difference]: Start difference. First operand 552 states and 814 transitions. Second operand  has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 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-02-07 22:55:47,611 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:55:47,611 INFO  L93              Difference]: Finished difference Result 1003 states and 1477 transitions.
[2025-02-07 22:55:47,611 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-07 22:55:47,612 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 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 156
[2025-02-07 22:55:47,612 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:55:47,613 INFO  L225             Difference]: With dead ends: 1003
[2025-02-07 22:55:47,613 INFO  L226             Difference]: Without dead ends: 552
[2025-02-07 22:55:47,614 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-02-07 22:55:47,614 INFO  L435           NwaCegarLoop]: 616 mSDtfsCounter, 1477 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1480 SdHoareTripleChecker+Valid, 1233 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-02-07 22:55:47,615 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1480 Valid, 1233 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-02-07 22:55:47,615 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 552 states.
[2025-02-07 22:55:47,621 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552.
[2025-02-07 22:55:47,621 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 552 states, 547 states have (on average 1.4753199268738575) internal successors, (807), 547 states have internal predecessors, (807), 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-02-07 22:55:47,623 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 813 transitions.
[2025-02-07 22:55:47,623 INFO  L78                 Accepts]: Start accepts. Automaton has 552 states and 813 transitions. Word has length 156
[2025-02-07 22:55:47,624 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:55:47,624 INFO  L471      AbstractCegarLoop]: Abstraction has 552 states and 813 transitions.
[2025-02-07 22:55:47,624 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 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-02-07 22:55:47,624 INFO  L276                IsEmpty]: Start isEmpty. Operand 552 states and 813 transitions.
[2025-02-07 22:55:47,625 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 158
[2025-02-07 22:55:47,625 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:55:47,625 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]
[2025-02-07 22:55:47,625 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-02-07 22:55:47,625 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:55:47,626 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:55:47,626 INFO  L85        PathProgramCache]: Analyzing trace with hash -1696266864, now seen corresponding path program 1 times
[2025-02-07 22:55:47,626 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:55:47,626 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143940177]
[2025-02-07 22:55:47,626 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:55:47,626 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:55:47,656 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes.
[2025-02-07 22:55:47,687 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements.
[2025-02-07 22:55:47,687 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:55:47,687 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:55:47,878 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-02-07 22:55:47,878 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:55:47,878 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143940177]
[2025-02-07 22:55:47,878 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143940177] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:55:47,878 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:55:47,878 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-07 22:55:47,879 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154340771]
[2025-02-07 22:55:47,879 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:55:47,879 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-07 22:55:47,879 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:55:47,879 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-07 22:55:47,879 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-07 22:55:47,880 INFO  L87              Difference]: Start difference. First operand 552 states and 813 transitions. Second operand  has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 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-02-07 22:55:48,153 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:55:48,154 INFO  L93              Difference]: Finished difference Result 1003 states and 1475 transitions.
[2025-02-07 22:55:48,154 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-07 22:55:48,154 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 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 157
[2025-02-07 22:55:48,154 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:55:48,156 INFO  L225             Difference]: With dead ends: 1003
[2025-02-07 22:55:48,156 INFO  L226             Difference]: Without dead ends: 552
[2025-02-07 22:55:48,156 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-02-07 22:55:48,157 INFO  L435           NwaCegarLoop]: 616 mSDtfsCounter, 1461 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1464 SdHoareTripleChecker+Valid, 1233 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-02-07 22:55:48,157 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1464 Valid, 1233 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-02-07 22:55:48,157 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 552 states.
[2025-02-07 22:55:48,163 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552.
[2025-02-07 22:55:48,163 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 552 states, 547 states have (on average 1.4734917733089579) internal successors, (806), 547 states have internal predecessors, (806), 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-02-07 22:55:48,165 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 812 transitions.
[2025-02-07 22:55:48,165 INFO  L78                 Accepts]: Start accepts. Automaton has 552 states and 812 transitions. Word has length 157
[2025-02-07 22:55:48,165 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:55:48,165 INFO  L471      AbstractCegarLoop]: Abstraction has 552 states and 812 transitions.
[2025-02-07 22:55:48,166 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 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-02-07 22:55:48,166 INFO  L276                IsEmpty]: Start isEmpty. Operand 552 states and 812 transitions.
[2025-02-07 22:55:48,166 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 159
[2025-02-07 22:55:48,167 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:55:48,167 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]
[2025-02-07 22:55:48,167 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-02-07 22:55:48,167 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:55:48,167 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:55:48,167 INFO  L85        PathProgramCache]: Analyzing trace with hash -1045437835, now seen corresponding path program 1 times
[2025-02-07 22:55:48,167 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:55:48,167 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890273952]
[2025-02-07 22:55:48,168 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:55:48,168 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:55:48,198 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes.
[2025-02-07 22:55:48,221 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements.
[2025-02-07 22:55:48,221 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:55:48,221 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:55:48,377 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-02-07 22:55:48,377 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:55:48,377 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890273952]
[2025-02-07 22:55:48,377 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890273952] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:55:48,377 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:55:48,377 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-07 22:55:48,377 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969185227]
[2025-02-07 22:55:48,377 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:55:48,378 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-07 22:55:48,378 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:55:48,379 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-07 22:55:48,379 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-07 22:55:48,379 INFO  L87              Difference]: Start difference. First operand 552 states and 812 transitions. Second operand  has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 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-02-07 22:55:48,715 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:55:48,716 INFO  L93              Difference]: Finished difference Result 1003 states and 1473 transitions.
[2025-02-07 22:55:48,717 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-07 22:55:48,717 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 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 158
[2025-02-07 22:55:48,717 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:55:48,719 INFO  L225             Difference]: With dead ends: 1003
[2025-02-07 22:55:48,719 INFO  L226             Difference]: Without dead ends: 552
[2025-02-07 22:55:48,720 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-02-07 22:55:48,721 INFO  L435           NwaCegarLoop]: 616 mSDtfsCounter, 1453 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1456 SdHoareTripleChecker+Valid, 1233 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-02-07 22:55:48,721 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1456 Valid, 1233 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-02-07 22:55:48,722 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 552 states.
[2025-02-07 22:55:48,727 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552.
[2025-02-07 22:55:48,728 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 552 states, 547 states have (on average 1.4716636197440585) internal successors, (805), 547 states have internal predecessors, (805), 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-02-07 22:55:48,730 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 811 transitions.
[2025-02-07 22:55:48,730 INFO  L78                 Accepts]: Start accepts. Automaton has 552 states and 811 transitions. Word has length 158
[2025-02-07 22:55:48,730 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:55:48,730 INFO  L471      AbstractCegarLoop]: Abstraction has 552 states and 811 transitions.
[2025-02-07 22:55:48,730 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 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-02-07 22:55:48,731 INFO  L276                IsEmpty]: Start isEmpty. Operand 552 states and 811 transitions.
[2025-02-07 22:55:48,731 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 160
[2025-02-07 22:55:48,731 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:55:48,732 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]
[2025-02-07 22:55:48,732 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-02-07 22:55:48,732 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:55:48,733 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:55:48,733 INFO  L85        PathProgramCache]: Analyzing trace with hash 2008085771, now seen corresponding path program 1 times
[2025-02-07 22:55:48,733 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:55:48,733 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301385602]
[2025-02-07 22:55:48,733 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:55:48,733 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:55:48,769 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes.
[2025-02-07 22:55:48,823 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements.
[2025-02-07 22:55:48,823 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:55:48,824 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:55:48,975 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-02-07 22:55:48,975 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:55:48,975 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301385602]
[2025-02-07 22:55:48,976 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301385602] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:55:48,976 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:55:48,976 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-07 22:55:48,976 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108084880]
[2025-02-07 22:55:48,976 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:55:48,976 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-07 22:55:48,976 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:55:48,977 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-07 22:55:48,977 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-07 22:55:48,977 INFO  L87              Difference]: Start difference. First operand 552 states and 811 transitions. Second operand  has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 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-02-07 22:55:49,298 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:55:49,298 INFO  L93              Difference]: Finished difference Result 1003 states and 1471 transitions.
[2025-02-07 22:55:49,299 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-07 22:55:49,299 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 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 159
[2025-02-07 22:55:49,299 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:55:49,301 INFO  L225             Difference]: With dead ends: 1003
[2025-02-07 22:55:49,301 INFO  L226             Difference]: Without dead ends: 552
[2025-02-07 22:55:49,301 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-02-07 22:55:49,302 INFO  L435           NwaCegarLoop]: 616 mSDtfsCounter, 777 mSDsluCounter, 623 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 780 SdHoareTripleChecker+Valid, 1239 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-02-07 22:55:49,302 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [780 Valid, 1239 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 382 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-02-07 22:55:49,302 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 552 states.
[2025-02-07 22:55:49,308 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552.
[2025-02-07 22:55:49,308 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 552 states, 547 states have (on average 1.469835466179159) internal successors, (804), 547 states have internal predecessors, (804), 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-02-07 22:55:49,310 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 810 transitions.
[2025-02-07 22:55:49,310 INFO  L78                 Accepts]: Start accepts. Automaton has 552 states and 810 transitions. Word has length 159
[2025-02-07 22:55:49,310 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:55:49,310 INFO  L471      AbstractCegarLoop]: Abstraction has 552 states and 810 transitions.
[2025-02-07 22:55:49,311 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 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-02-07 22:55:49,311 INFO  L276                IsEmpty]: Start isEmpty. Operand 552 states and 810 transitions.
[2025-02-07 22:55:49,311 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 161
[2025-02-07 22:55:49,311 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:55:49,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]
[2025-02-07 22:55:49,312 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2025-02-07 22:55:49,312 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:55:49,312 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:55:49,312 INFO  L85        PathProgramCache]: Analyzing trace with hash -1285586224, now seen corresponding path program 1 times
[2025-02-07 22:55:49,312 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:55:49,312 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931417383]
[2025-02-07 22:55:49,312 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:55:49,312 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:55:49,347 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes.
[2025-02-07 22:55:49,382 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements.
[2025-02-07 22:55:49,383 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:55:49,383 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:55:49,716 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-02-07 22:55:49,717 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:55:49,718 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931417383]
[2025-02-07 22:55:49,718 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931417383] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:55:49,718 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:55:49,718 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-07 22:55:49,718 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973676488]
[2025-02-07 22:55:49,718 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:55:49,718 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-07 22:55:49,718 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:55:49,719 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-07 22:55:49,719 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-07 22:55:49,719 INFO  L87              Difference]: Start difference. First operand 552 states and 810 transitions. Second operand  has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 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-02-07 22:55:50,196 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:55:50,196 INFO  L93              Difference]: Finished difference Result 1003 states and 1469 transitions.
[2025-02-07 22:55:50,197 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-07 22:55:50,197 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 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 160
[2025-02-07 22:55:50,197 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:55:50,199 INFO  L225             Difference]: With dead ends: 1003
[2025-02-07 22:55:50,199 INFO  L226             Difference]: Without dead ends: 552
[2025-02-07 22:55:50,199 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-02-07 22:55:50,200 INFO  L435           NwaCegarLoop]: 655 mSDtfsCounter, 703 mSDsluCounter, 656 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 703 SdHoareTripleChecker+Valid, 1311 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-02-07 22:55:50,201 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [703 Valid, 1311 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-02-07 22:55:50,201 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 552 states.
[2025-02-07 22:55:50,207 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552.
[2025-02-07 22:55:50,208 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 552 states, 547 states have (on average 1.4680073126142597) internal successors, (803), 547 states have internal predecessors, (803), 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-02-07 22:55:50,210 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 809 transitions.
[2025-02-07 22:55:50,210 INFO  L78                 Accepts]: Start accepts. Automaton has 552 states and 809 transitions. Word has length 160
[2025-02-07 22:55:50,210 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:55:50,210 INFO  L471      AbstractCegarLoop]: Abstraction has 552 states and 809 transitions.
[2025-02-07 22:55:50,211 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 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-02-07 22:55:50,211 INFO  L276                IsEmpty]: Start isEmpty. Operand 552 states and 809 transitions.
[2025-02-07 22:55:50,212 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 162
[2025-02-07 22:55:50,212 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:55:50,212 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]
[2025-02-07 22:55:50,212 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2025-02-07 22:55:50,212 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:55:50,212 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:55:50,212 INFO  L85        PathProgramCache]: Analyzing trace with hash -1265137972, now seen corresponding path program 1 times
[2025-02-07 22:55:50,213 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:55:50,213 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036133371]
[2025-02-07 22:55:50,214 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:55:50,214 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:55:50,250 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes.
[2025-02-07 22:55:50,280 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements.
[2025-02-07 22:55:50,280 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:55:50,280 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:55:50,451 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-02-07 22:55:50,452 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:55:50,452 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036133371]
[2025-02-07 22:55:50,452 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036133371] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:55:50,452 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:55:50,452 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-07 22:55:50,452 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062074352]
[2025-02-07 22:55:50,452 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:55:50,453 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-07 22:55:50,453 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:55:50,454 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-07 22:55:50,454 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-07 22:55:50,454 INFO  L87              Difference]: Start difference. First operand 552 states and 809 transitions. Second operand  has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 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-02-07 22:55:50,726 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:55:50,726 INFO  L93              Difference]: Finished difference Result 1003 states and 1467 transitions.
[2025-02-07 22:55:50,726 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-07 22:55:50,726 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 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 161
[2025-02-07 22:55:50,727 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:55:50,728 INFO  L225             Difference]: With dead ends: 1003
[2025-02-07 22:55:50,728 INFO  L226             Difference]: Without dead ends: 552
[2025-02-07 22:55:50,728 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-02-07 22:55:50,729 INFO  L435           NwaCegarLoop]: 655 mSDtfsCounter, 794 mSDsluCounter, 662 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 797 SdHoareTripleChecker+Valid, 1317 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-02-07 22:55:50,729 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [797 Valid, 1317 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-02-07 22:55:50,730 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 552 states.
[2025-02-07 22:55:50,735 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552.
[2025-02-07 22:55:50,736 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 552 states, 547 states have (on average 1.4661791590493602) internal successors, (802), 547 states have internal predecessors, (802), 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-02-07 22:55:50,737 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 808 transitions.
[2025-02-07 22:55:50,738 INFO  L78                 Accepts]: Start accepts. Automaton has 552 states and 808 transitions. Word has length 161
[2025-02-07 22:55:50,738 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:55:50,738 INFO  L471      AbstractCegarLoop]: Abstraction has 552 states and 808 transitions.
[2025-02-07 22:55:50,738 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 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-02-07 22:55:50,738 INFO  L276                IsEmpty]: Start isEmpty. Operand 552 states and 808 transitions.
[2025-02-07 22:55:50,739 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 163
[2025-02-07 22:55:50,739 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:55:50,739 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]
[2025-02-07 22:55:50,739 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2025-02-07 22:55:50,739 INFO  L396      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:55:50,740 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:55:50,740 INFO  L85        PathProgramCache]: Analyzing trace with hash 1588335637, now seen corresponding path program 1 times
[2025-02-07 22:55:50,740 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:55:50,740 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195448082]
[2025-02-07 22:55:50,740 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:55:50,740 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:55:50,770 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes.
[2025-02-07 22:55:50,800 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements.
[2025-02-07 22:55:50,800 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:55:50,800 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:55:51,005 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-02-07 22:55:51,006 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:55:51,006 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195448082]
[2025-02-07 22:55:51,006 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195448082] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:55:51,006 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:55:51,006 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-07 22:55:51,006 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172076338]
[2025-02-07 22:55:51,006 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:55:51,006 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-07 22:55:51,007 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:55:51,007 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-07 22:55:51,007 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-07 22:55:51,007 INFO  L87              Difference]: Start difference. First operand 552 states and 808 transitions. Second operand  has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 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-02-07 22:55:51,239 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:55:51,239 INFO  L93              Difference]: Finished difference Result 1003 states and 1465 transitions.
[2025-02-07 22:55:51,239 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-07 22:55:51,240 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 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 162
[2025-02-07 22:55:51,240 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:55:51,241 INFO  L225             Difference]: With dead ends: 1003
[2025-02-07 22:55:51,241 INFO  L226             Difference]: Without dead ends: 552
[2025-02-07 22:55:51,242 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-02-07 22:55:51,242 INFO  L435           NwaCegarLoop]: 637 mSDtfsCounter, 689 mSDsluCounter, 638 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 689 SdHoareTripleChecker+Valid, 1275 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-02-07 22:55:51,242 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [689 Valid, 1275 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-02-07 22:55:51,243 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 552 states.
[2025-02-07 22:55:51,249 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552.
[2025-02-07 22:55:51,249 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 552 states, 547 states have (on average 1.4643510054844606) internal successors, (801), 547 states have internal predecessors, (801), 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-02-07 22:55:51,251 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 807 transitions.
[2025-02-07 22:55:51,251 INFO  L78                 Accepts]: Start accepts. Automaton has 552 states and 807 transitions. Word has length 162
[2025-02-07 22:55:51,251 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:55:51,251 INFO  L471      AbstractCegarLoop]: Abstraction has 552 states and 807 transitions.
[2025-02-07 22:55:51,251 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 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-02-07 22:55:51,251 INFO  L276                IsEmpty]: Start isEmpty. Operand 552 states and 807 transitions.
[2025-02-07 22:55:51,252 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 164
[2025-02-07 22:55:51,252 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:55:51,252 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]
[2025-02-07 22:55:51,252 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2025-02-07 22:55:51,253 INFO  L396      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:55:51,253 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:55:51,253 INFO  L85        PathProgramCache]: Analyzing trace with hash 971594624, now seen corresponding path program 1 times
[2025-02-07 22:55:51,253 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:55:51,253 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905324763]
[2025-02-07 22:55:51,253 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:55:51,253 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:55:51,282 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes.
[2025-02-07 22:55:51,308 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements.
[2025-02-07 22:55:51,308 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:55:51,309 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:55:51,456 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-02-07 22:55:51,456 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:55:51,456 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905324763]
[2025-02-07 22:55:51,456 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905324763] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:55:51,456 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:55:51,456 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-07 22:55:51,457 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091184897]
[2025-02-07 22:55:51,457 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:55:51,457 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-07 22:55:51,457 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:55:51,457 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-07 22:55:51,457 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-02-07 22:55:51,458 INFO  L87              Difference]: Start difference. First operand 552 states and 807 transitions. Second operand  has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 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-02-07 22:55:51,712 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:55:51,712 INFO  L93              Difference]: Finished difference Result 1009 states and 1471 transitions.
[2025-02-07 22:55:51,713 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-07 22:55:51,713 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 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 163
[2025-02-07 22:55:51,713 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:55:51,715 INFO  L225             Difference]: With dead ends: 1009
[2025-02-07 22:55:51,715 INFO  L226             Difference]: Without dead ends: 552
[2025-02-07 22:55:51,715 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-02-07 22:55:51,716 INFO  L435           NwaCegarLoop]: 662 mSDtfsCounter, 700 mSDsluCounter, 1302 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 700 SdHoareTripleChecker+Valid, 1964 SdHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-02-07 22:55:51,716 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [700 Valid, 1964 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 447 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-02-07 22:55:51,717 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 552 states.
[2025-02-07 22:55:51,723 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552.
[2025-02-07 22:55:51,723 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 552 states, 547 states have (on average 1.4625228519195612) internal successors, (800), 547 states have internal predecessors, (800), 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-02-07 22:55:51,725 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 806 transitions.
[2025-02-07 22:55:51,725 INFO  L78                 Accepts]: Start accepts. Automaton has 552 states and 806 transitions. Word has length 163
[2025-02-07 22:55:51,725 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:55:51,725 INFO  L471      AbstractCegarLoop]: Abstraction has 552 states and 806 transitions.
[2025-02-07 22:55:51,726 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 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-02-07 22:55:51,726 INFO  L276                IsEmpty]: Start isEmpty. Operand 552 states and 806 transitions.
[2025-02-07 22:55:51,727 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 165
[2025-02-07 22:55:51,727 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:55:51,727 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]
[2025-02-07 22:55:51,727 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2025-02-07 22:55:51,727 INFO  L396      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:55:51,727 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:55:51,727 INFO  L85        PathProgramCache]: Analyzing trace with hash -2084053980, now seen corresponding path program 1 times
[2025-02-07 22:55:51,728 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:55:51,728 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978438067]
[2025-02-07 22:55:51,728 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:55:51,728 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:55:51,757 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes.
[2025-02-07 22:55:51,785 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements.
[2025-02-07 22:55:51,785 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:55:51,785 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:55:51,921 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-02-07 22:55:51,921 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:55:51,921 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978438067]
[2025-02-07 22:55:51,922 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978438067] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:55:51,922 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:55:51,922 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-07 22:55:51,922 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364225690]
[2025-02-07 22:55:51,922 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:55:51,922 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-07 22:55:51,922 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:55:51,923 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-07 22:55:51,923 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-07 22:55:51,923 INFO  L87              Difference]: Start difference. First operand 552 states and 806 transitions. Second operand  has 5 states, 5 states have (on average 30.4) internal successors, (152), 5 states have internal predecessors, (152), 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-02-07 22:55:52,151 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:55:52,151 INFO  L93              Difference]: Finished difference Result 1003 states and 1461 transitions.
[2025-02-07 22:55:52,151 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-07 22:55:52,152 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 30.4) internal successors, (152), 5 states have internal predecessors, (152), 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 164
[2025-02-07 22:55:52,152 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:55:52,153 INFO  L225             Difference]: With dead ends: 1003
[2025-02-07 22:55:52,153 INFO  L226             Difference]: Without dead ends: 552
[2025-02-07 22:55:52,154 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-02-07 22:55:52,154 INFO  L435           NwaCegarLoop]: 637 mSDtfsCounter, 1479 mSDsluCounter, 638 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1482 SdHoareTripleChecker+Valid, 1275 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-02-07 22:55:52,154 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1482 Valid, 1275 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-02-07 22:55:52,155 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 552 states.
[2025-02-07 22:55:52,164 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552.
[2025-02-07 22:55:52,164 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 552 states, 547 states have (on average 1.4606946983546618) internal successors, (799), 547 states have internal predecessors, (799), 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-02-07 22:55:52,167 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 805 transitions.
[2025-02-07 22:55:52,167 INFO  L78                 Accepts]: Start accepts. Automaton has 552 states and 805 transitions. Word has length 164
[2025-02-07 22:55:52,167 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:55:52,167 INFO  L471      AbstractCegarLoop]: Abstraction has 552 states and 805 transitions.
[2025-02-07 22:55:52,168 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 30.4) internal successors, (152), 5 states have internal predecessors, (152), 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-02-07 22:55:52,168 INFO  L276                IsEmpty]: Start isEmpty. Operand 552 states and 805 transitions.
[2025-02-07 22:55:52,169 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 166
[2025-02-07 22:55:52,169 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:55:52,169 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]
[2025-02-07 22:55:52,169 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2025-02-07 22:55:52,169 INFO  L396      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:55:52,169 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:55:52,169 INFO  L85        PathProgramCache]: Analyzing trace with hash -541901733, now seen corresponding path program 1 times
[2025-02-07 22:55:52,170 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:55:52,170 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882507409]
[2025-02-07 22:55:52,170 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:55:52,170 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:55:52,200 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes.
[2025-02-07 22:55:52,255 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements.
[2025-02-07 22:55:52,255 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:55:52,255 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:55:52,382 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-02-07 22:55:52,383 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:55:52,383 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882507409]
[2025-02-07 22:55:52,383 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882507409] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:55:52,383 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:55:52,383 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-07 22:55:52,383 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512796532]
[2025-02-07 22:55:52,383 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:55:52,383 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-07 22:55:52,384 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:55:52,384 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-07 22:55:52,384 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-07 22:55:52,385 INFO  L87              Difference]: Start difference. First operand 552 states and 805 transitions. Second operand  has 5 states, 5 states have (on average 30.6) internal successors, (153), 5 states have internal predecessors, (153), 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-02-07 22:55:52,621 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:55:52,621 INFO  L93              Difference]: Finished difference Result 1003 states and 1459 transitions.
[2025-02-07 22:55:52,621 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-07 22:55:52,621 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 30.6) internal successors, (153), 5 states have internal predecessors, (153), 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 165
[2025-02-07 22:55:52,622 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:55:52,623 INFO  L225             Difference]: With dead ends: 1003
[2025-02-07 22:55:52,623 INFO  L226             Difference]: Without dead ends: 552
[2025-02-07 22:55:52,624 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-02-07 22:55:52,624 INFO  L435           NwaCegarLoop]: 637 mSDtfsCounter, 1471 mSDsluCounter, 638 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1474 SdHoareTripleChecker+Valid, 1275 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-02-07 22:55:52,624 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1474 Valid, 1275 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-02-07 22:55:52,625 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 552 states.
[2025-02-07 22:55:52,631 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552.
[2025-02-07 22:55:52,632 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 552 states, 547 states have (on average 1.4588665447897624) internal successors, (798), 547 states have internal predecessors, (798), 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-02-07 22:55:52,633 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 804 transitions.
[2025-02-07 22:55:52,633 INFO  L78                 Accepts]: Start accepts. Automaton has 552 states and 804 transitions. Word has length 165
[2025-02-07 22:55:52,634 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:55:52,634 INFO  L471      AbstractCegarLoop]: Abstraction has 552 states and 804 transitions.
[2025-02-07 22:55:52,635 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 30.6) internal successors, (153), 5 states have internal predecessors, (153), 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-02-07 22:55:52,635 INFO  L276                IsEmpty]: Start isEmpty. Operand 552 states and 804 transitions.
[2025-02-07 22:55:52,636 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 167
[2025-02-07 22:55:52,636 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:55:52,636 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]
[2025-02-07 22:55:52,636 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2025-02-07 22:55:52,636 INFO  L396      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:55:52,636 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:55:52,637 INFO  L85        PathProgramCache]: Analyzing trace with hash -1738864097, now seen corresponding path program 1 times
[2025-02-07 22:55:52,637 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:55:52,637 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738533569]
[2025-02-07 22:55:52,637 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:55:52,637 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:55:52,666 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes.
[2025-02-07 22:55:52,723 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements.
[2025-02-07 22:55:52,725 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:55:52,725 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:55:52,943 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-02-07 22:55:52,943 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:55:52,943 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738533569]
[2025-02-07 22:55:52,943 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738533569] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:55:52,943 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:55:52,943 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-07 22:55:52,943 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105442681]
[2025-02-07 22:55:52,943 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:55:52,943 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-07 22:55:52,943 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:55:52,944 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-07 22:55:52,944 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-07 22:55:52,944 INFO  L87              Difference]: Start difference. First operand 552 states and 804 transitions. Second operand  has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 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-02-07 22:55:53,171 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:55:53,172 INFO  L93              Difference]: Finished difference Result 1003 states and 1457 transitions.
[2025-02-07 22:55:53,172 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-07 22:55:53,172 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 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 166
[2025-02-07 22:55:53,172 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:55:53,174 INFO  L225             Difference]: With dead ends: 1003
[2025-02-07 22:55:53,175 INFO  L226             Difference]: Without dead ends: 552
[2025-02-07 22:55:53,175 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-02-07 22:55:53,176 INFO  L435           NwaCegarLoop]: 654 mSDtfsCounter, 734 mSDsluCounter, 655 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 736 SdHoareTripleChecker+Valid, 1309 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-02-07 22:55:53,176 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [736 Valid, 1309 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-02-07 22:55:53,177 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 552 states.
[2025-02-07 22:55:53,184 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552.
[2025-02-07 22:55:53,185 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 552 states, 547 states have (on average 1.4570383912248628) internal successors, (797), 547 states have internal predecessors, (797), 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-02-07 22:55:53,186 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 803 transitions.
[2025-02-07 22:55:53,187 INFO  L78                 Accepts]: Start accepts. Automaton has 552 states and 803 transitions. Word has length 166
[2025-02-07 22:55:53,187 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:55:53,187 INFO  L471      AbstractCegarLoop]: Abstraction has 552 states and 803 transitions.
[2025-02-07 22:55:53,187 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 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-02-07 22:55:53,187 INFO  L276                IsEmpty]: Start isEmpty. Operand 552 states and 803 transitions.
[2025-02-07 22:55:53,188 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 168
[2025-02-07 22:55:53,188 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:55:53,188 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]
[2025-02-07 22:55:53,189 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2025-02-07 22:55:53,189 INFO  L396      AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:55:53,189 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:55:53,189 INFO  L85        PathProgramCache]: Analyzing trace with hash -140520540, now seen corresponding path program 1 times
[2025-02-07 22:55:53,189 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:55:53,189 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791538174]
[2025-02-07 22:55:53,190 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:55:53,190 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:55:53,226 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes.
[2025-02-07 22:55:53,320 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements.
[2025-02-07 22:55:53,321 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:55:53,321 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:55:53,516 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-02-07 22:55:53,516 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:55:53,516 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791538174]
[2025-02-07 22:55:53,516 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791538174] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:55:53,516 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:55:53,516 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-07 22:55:53,516 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532176072]
[2025-02-07 22:55:53,516 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:55:53,517 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-07 22:55:53,517 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:55:53,517 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-07 22:55:53,517 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-07 22:55:53,517 INFO  L87              Difference]: Start difference. First operand 552 states and 803 transitions. Second operand  has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 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-02-07 22:55:53,756 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:55:53,756 INFO  L93              Difference]: Finished difference Result 1003 states and 1455 transitions.
[2025-02-07 22:55:53,758 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-07 22:55:53,759 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 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 167
[2025-02-07 22:55:53,759 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:55:53,760 INFO  L225             Difference]: With dead ends: 1003
[2025-02-07 22:55:53,760 INFO  L226             Difference]: Without dead ends: 552
[2025-02-07 22:55:53,761 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-02-07 22:55:53,765 INFO  L435           NwaCegarLoop]: 654 mSDtfsCounter, 732 mSDsluCounter, 655 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 734 SdHoareTripleChecker+Valid, 1309 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-02-07 22:55:53,765 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [734 Valid, 1309 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-02-07 22:55:53,765 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 552 states.
[2025-02-07 22:55:53,774 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552.
[2025-02-07 22:55:53,775 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 552 states, 547 states have (on average 1.4552102376599634) internal successors, (796), 547 states have internal predecessors, (796), 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-02-07 22:55:53,780 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 802 transitions.
[2025-02-07 22:55:53,780 INFO  L78                 Accepts]: Start accepts. Automaton has 552 states and 802 transitions. Word has length 167
[2025-02-07 22:55:53,780 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:55:53,780 INFO  L471      AbstractCegarLoop]: Abstraction has 552 states and 802 transitions.
[2025-02-07 22:55:53,780 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 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-02-07 22:55:53,780 INFO  L276                IsEmpty]: Start isEmpty. Operand 552 states and 802 transitions.
[2025-02-07 22:55:53,781 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 169
[2025-02-07 22:55:53,781 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:55:53,781 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]
[2025-02-07 22:55:53,781 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2025-02-07 22:55:53,782 INFO  L396      AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:55:53,782 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:55:53,782 INFO  L85        PathProgramCache]: Analyzing trace with hash 1504434712, now seen corresponding path program 1 times
[2025-02-07 22:55:53,782 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:55:53,782 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623025800]
[2025-02-07 22:55:53,782 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:55:53,782 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:55:53,829 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes.
[2025-02-07 22:55:53,997 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements.
[2025-02-07 22:55:53,998 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:55:53,998 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:55:54,219 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-02-07 22:55:54,219 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:55:54,219 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623025800]
[2025-02-07 22:55:54,219 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623025800] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:55:54,219 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:55:54,219 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-07 22:55:54,220 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668700749]
[2025-02-07 22:55:54,220 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:55:54,220 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-07 22:55:54,220 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:55:54,220 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-07 22:55:54,220 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-07 22:55:54,221 INFO  L87              Difference]: Start difference. First operand 552 states and 802 transitions. Second operand  has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 states have internal predecessors, (156), 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-02-07 22:55:54,498 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:55:54,498 INFO  L93              Difference]: Finished difference Result 1003 states and 1453 transitions.
[2025-02-07 22:55:54,498 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-07 22:55:54,498 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 states have internal predecessors, (156), 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 168
[2025-02-07 22:55:54,499 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:55:54,500 INFO  L225             Difference]: With dead ends: 1003
[2025-02-07 22:55:54,500 INFO  L226             Difference]: Without dead ends: 552
[2025-02-07 22:55:54,501 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-02-07 22:55:54,501 INFO  L435           NwaCegarLoop]: 608 mSDtfsCounter, 676 mSDsluCounter, 609 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 676 SdHoareTripleChecker+Valid, 1217 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-02-07 22:55:54,501 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [676 Valid, 1217 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-02-07 22:55:54,502 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 552 states.
[2025-02-07 22:55:54,508 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552.
[2025-02-07 22:55:54,508 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 552 states, 547 states have (on average 1.453382084095064) internal successors, (795), 547 states have internal predecessors, (795), 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-02-07 22:55:54,509 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 801 transitions.
[2025-02-07 22:55:54,509 INFO  L78                 Accepts]: Start accepts. Automaton has 552 states and 801 transitions. Word has length 168
[2025-02-07 22:55:54,510 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:55:54,510 INFO  L471      AbstractCegarLoop]: Abstraction has 552 states and 801 transitions.
[2025-02-07 22:55:54,510 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 states have internal predecessors, (156), 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-02-07 22:55:54,510 INFO  L276                IsEmpty]: Start isEmpty. Operand 552 states and 801 transitions.
[2025-02-07 22:55:54,511 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 170
[2025-02-07 22:55:54,511 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:55:54,511 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]
[2025-02-07 22:55:54,511 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2025-02-07 22:55:54,511 INFO  L396      AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:55:54,511 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:55:54,511 INFO  L85        PathProgramCache]: Analyzing trace with hash -1849417884, now seen corresponding path program 1 times
[2025-02-07 22:55:54,512 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:55:54,512 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371981955]
[2025-02-07 22:55:54,512 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:55:54,512 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:55:54,539 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes.
[2025-02-07 22:55:54,614 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements.
[2025-02-07 22:55:54,614 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:55:54,614 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:55:54,825 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-02-07 22:55:54,826 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:55:54,826 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371981955]
[2025-02-07 22:55:54,826 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371981955] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:55:54,826 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:55:54,826 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-07 22:55:54,826 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600866718]
[2025-02-07 22:55:54,826 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:55:54,826 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-07 22:55:54,827 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:55:54,827 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-07 22:55:54,827 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-07 22:55:54,827 INFO  L87              Difference]: Start difference. First operand 552 states and 801 transitions. Second operand  has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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-02-07 22:55:55,108 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:55:55,109 INFO  L93              Difference]: Finished difference Result 1003 states and 1451 transitions.
[2025-02-07 22:55:55,109 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-07 22:55:55,109 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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 169
[2025-02-07 22:55:55,110 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:55:55,111 INFO  L225             Difference]: With dead ends: 1003
[2025-02-07 22:55:55,111 INFO  L226             Difference]: Without dead ends: 552
[2025-02-07 22:55:55,112 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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-02-07 22:55:55,113 INFO  L435           NwaCegarLoop]: 608 mSDtfsCounter, 1340 mSDsluCounter, 609 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1340 SdHoareTripleChecker+Valid, 1217 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-02-07 22:55:55,113 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1340 Valid, 1217 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-02-07 22:55:55,114 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 552 states.
[2025-02-07 22:55:55,119 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552.
[2025-02-07 22:55:55,120 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 552 states, 547 states have (on average 1.4515539305301646) internal successors, (794), 547 states have internal predecessors, (794), 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-02-07 22:55:55,121 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 800 transitions.
[2025-02-07 22:55:55,121 INFO  L78                 Accepts]: Start accepts. Automaton has 552 states and 800 transitions. Word has length 169
[2025-02-07 22:55:55,121 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:55:55,121 INFO  L471      AbstractCegarLoop]: Abstraction has 552 states and 800 transitions.
[2025-02-07 22:55:55,121 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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-02-07 22:55:55,122 INFO  L276                IsEmpty]: Start isEmpty. Operand 552 states and 800 transitions.
[2025-02-07 22:55:55,122 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 171
[2025-02-07 22:55:55,122 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:55:55,122 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]
[2025-02-07 22:55:55,123 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2025-02-07 22:55:55,123 INFO  L396      AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:55:55,123 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:55:55,123 INFO  L85        PathProgramCache]: Analyzing trace with hash 40840582, now seen corresponding path program 1 times
[2025-02-07 22:55:55,123 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:55:55,123 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941012634]
[2025-02-07 22:55:55,123 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:55:55,123 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:55:55,151 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes.
[2025-02-07 22:55:55,217 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements.
[2025-02-07 22:55:55,217 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:55:55,217 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:55:55,411 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-02-07 22:55:55,411 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:55:55,411 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941012634]
[2025-02-07 22:55:55,411 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941012634] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:55:55,411 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:55:55,411 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-07 22:55:55,411 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071245848]
[2025-02-07 22:55:55,411 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:55:55,412 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-07 22:55:55,412 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:55:55,412 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-07 22:55:55,412 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-07 22:55:55,412 INFO  L87              Difference]: Start difference. First operand 552 states and 800 transitions. Second operand  has 5 states, 5 states have (on average 31.6) internal successors, (158), 5 states have internal predecessors, (158), 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-02-07 22:55:55,702 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:55:55,702 INFO  L93              Difference]: Finished difference Result 1003 states and 1449 transitions.
[2025-02-07 22:55:55,702 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-07 22:55:55,703 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 31.6) internal successors, (158), 5 states have internal predecessors, (158), 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 170
[2025-02-07 22:55:55,703 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:55:55,705 INFO  L225             Difference]: With dead ends: 1003
[2025-02-07 22:55:55,705 INFO  L226             Difference]: Without dead ends: 552
[2025-02-07 22:55:55,706 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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-02-07 22:55:55,706 INFO  L435           NwaCegarLoop]: 608 mSDtfsCounter, 671 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 671 SdHoareTripleChecker+Valid, 1223 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-02-07 22:55:55,706 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [671 Valid, 1223 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-02-07 22:55:55,707 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 552 states.
[2025-02-07 22:55:55,713 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552.
[2025-02-07 22:55:55,714 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 552 states, 547 states have (on average 1.4497257769652652) internal successors, (793), 547 states have internal predecessors, (793), 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-02-07 22:55:55,715 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 799 transitions.
[2025-02-07 22:55:55,715 INFO  L78                 Accepts]: Start accepts. Automaton has 552 states and 799 transitions. Word has length 170
[2025-02-07 22:55:55,715 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:55:55,715 INFO  L471      AbstractCegarLoop]: Abstraction has 552 states and 799 transitions.
[2025-02-07 22:55:55,715 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 31.6) internal successors, (158), 5 states have internal predecessors, (158), 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-02-07 22:55:55,716 INFO  L276                IsEmpty]: Start isEmpty. Operand 552 states and 799 transitions.
[2025-02-07 22:55:55,716 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 172
[2025-02-07 22:55:55,716 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:55:55,716 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]
[2025-02-07 22:55:55,716 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2025-02-07 22:55:55,717 INFO  L396      AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:55:55,717 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:55:55,717 INFO  L85        PathProgramCache]: Analyzing trace with hash 1595281987, now seen corresponding path program 1 times
[2025-02-07 22:55:55,717 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:55:55,717 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434498020]
[2025-02-07 22:55:55,717 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:55:55,718 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:55:55,745 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes.
[2025-02-07 22:55:55,819 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements.
[2025-02-07 22:55:55,819 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:55:55,819 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:55:56,111 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-02-07 22:55:56,111 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:55:56,112 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434498020]
[2025-02-07 22:55:56,112 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434498020] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:55:56,112 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:55:56,112 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-07 22:55:56,112 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325179595]
[2025-02-07 22:55:56,112 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:55:56,112 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-07 22:55:56,112 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:55:56,112 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-07 22:55:56,112 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-02-07 22:55:56,113 INFO  L87              Difference]: Start difference. First operand 552 states and 799 transitions. Second operand  has 5 states, 5 states have (on average 31.8) internal successors, (159), 5 states have internal predecessors, (159), 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-02-07 22:55:56,477 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:55:56,477 INFO  L93              Difference]: Finished difference Result 1009 states and 1455 transitions.
[2025-02-07 22:55:56,478 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-07 22:55:56,478 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 31.8) internal successors, (159), 5 states have internal predecessors, (159), 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 171
[2025-02-07 22:55:56,478 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:55:56,480 INFO  L225             Difference]: With dead ends: 1009
[2025-02-07 22:55:56,480 INFO  L226             Difference]: Without dead ends: 556
[2025-02-07 22:55:56,481 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-02-07 22:55:56,481 INFO  L435           NwaCegarLoop]: 657 mSDtfsCounter, 2 mSDsluCounter, 1816 mSDsCounter, 0 mSdLazyCounter, 706 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2473 SdHoareTripleChecker+Invalid, 706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 706 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-02-07 22:55:56,482 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2473 Invalid, 706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 706 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-02-07 22:55:56,482 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 556 states.
[2025-02-07 22:55:56,491 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 554.
[2025-02-07 22:55:56,492 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 554 states, 549 states have (on average 1.4480874316939891) internal successors, (795), 549 states have internal predecessors, (795), 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-02-07 22:55:56,493 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 801 transitions.
[2025-02-07 22:55:56,493 INFO  L78                 Accepts]: Start accepts. Automaton has 554 states and 801 transitions. Word has length 171
[2025-02-07 22:55:56,493 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:55:56,493 INFO  L471      AbstractCegarLoop]: Abstraction has 554 states and 801 transitions.
[2025-02-07 22:55:56,493 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 31.8) internal successors, (159), 5 states have internal predecessors, (159), 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-02-07 22:55:56,493 INFO  L276                IsEmpty]: Start isEmpty. Operand 554 states and 801 transitions.
[2025-02-07 22:55:56,494 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 173
[2025-02-07 22:55:56,494 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:55:56,494 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]
[2025-02-07 22:55:56,494 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2025-02-07 22:55:56,494 INFO  L396      AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:55:56,494 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:55:56,495 INFO  L85        PathProgramCache]: Analyzing trace with hash -395287052, now seen corresponding path program 1 times
[2025-02-07 22:55:56,495 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:55:56,495 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979604593]
[2025-02-07 22:55:56,495 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:55:56,495 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:55:56,521 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes.
[2025-02-07 22:55:56,684 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements.
[2025-02-07 22:55:56,685 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:55:56,685 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:55:57,044 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-02-07 22:55:57,044 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:55:57,045 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979604593]
[2025-02-07 22:55:57,045 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979604593] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:55:57,045 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:55:57,045 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-07 22:55:57,045 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694828639]
[2025-02-07 22:55:57,045 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:55:57,045 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-07 22:55:57,045 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:55:57,046 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-07 22:55:57,046 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-02-07 22:55:57,046 INFO  L87              Difference]: Start difference. First operand 554 states and 801 transitions. Second operand  has 5 states, 5 states have (on average 32.0) internal successors, (160), 5 states have internal predecessors, (160), 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-02-07 22:55:57,304 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:55:57,304 INFO  L93              Difference]: Finished difference Result 1085 states and 1548 transitions.
[2025-02-07 22:55:57,304 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-07 22:55:57,305 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 32.0) internal successors, (160), 5 states have internal predecessors, (160), 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 172
[2025-02-07 22:55:57,309 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:55:57,310 INFO  L225             Difference]: With dead ends: 1085
[2025-02-07 22:55:57,310 INFO  L226             Difference]: Without dead ends: 632
[2025-02-07 22:55:57,311 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-02-07 22:55:57,311 INFO  L435           NwaCegarLoop]: 657 mSDtfsCounter, 35 mSDsluCounter, 1963 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 2620 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-02-07 22:55:57,311 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 2620 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 559 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-02-07 22:55:57,312 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 632 states.
[2025-02-07 22:55:57,320 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 630.
[2025-02-07 22:55:57,321 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 630 states, 625 states have (on average 1.4208) internal successors, (888), 625 states have internal predecessors, (888), 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-02-07 22:55:57,322 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 894 transitions.
[2025-02-07 22:55:57,323 INFO  L78                 Accepts]: Start accepts. Automaton has 630 states and 894 transitions. Word has length 172
[2025-02-07 22:55:57,323 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:55:57,323 INFO  L471      AbstractCegarLoop]: Abstraction has 630 states and 894 transitions.
[2025-02-07 22:55:57,323 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 32.0) internal successors, (160), 5 states have internal predecessors, (160), 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-02-07 22:55:57,323 INFO  L276                IsEmpty]: Start isEmpty. Operand 630 states and 894 transitions.
[2025-02-07 22:55:57,324 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 174
[2025-02-07 22:55:57,324 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:55:57,324 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]
[2025-02-07 22:55:57,324 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2025-02-07 22:55:57,324 INFO  L396      AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:55:57,324 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:55:57,325 INFO  L85        PathProgramCache]: Analyzing trace with hash -1775601027, now seen corresponding path program 1 times
[2025-02-07 22:55:57,325 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:55:57,325 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520927908]
[2025-02-07 22:55:57,325 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:55:57,325 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:55:57,353 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes.
[2025-02-07 22:55:57,465 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements.
[2025-02-07 22:55:57,466 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:55:57,466 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:55:57,640 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-02-07 22:55:57,640 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:55:57,640 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520927908]
[2025-02-07 22:55:57,640 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520927908] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:55:57,640 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:55:57,640 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-07 22:55:57,640 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798920128]
[2025-02-07 22:55:57,640 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:55:57,641 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-07 22:55:57,641 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:55:57,641 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-07 22:55:57,641 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-07 22:55:57,642 INFO  L87              Difference]: Start difference. First operand 630 states and 894 transitions. Second operand  has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 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-02-07 22:55:57,951 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:55:57,951 INFO  L93              Difference]: Finished difference Result 1163 states and 1641 transitions.
[2025-02-07 22:55:57,952 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-07 22:55:57,952 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 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 173
[2025-02-07 22:55:57,952 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:55:57,954 INFO  L225             Difference]: With dead ends: 1163
[2025-02-07 22:55:57,954 INFO  L226             Difference]: Without dead ends: 630
[2025-02-07 22:55:57,955 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-02-07 22:55:57,955 INFO  L435           NwaCegarLoop]: 658 mSDtfsCounter, 2 mSDsluCounter, 1163 mSDsCounter, 0 mSdLazyCounter, 560 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1821 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-02-07 22:55:57,956 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1821 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 560 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-02-07 22:55:57,957 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 630 states.
[2025-02-07 22:55:57,963 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 626.
[2025-02-07 22:55:57,964 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 626 states, 621 states have (on average 1.4202898550724639) internal successors, (882), 621 states have internal predecessors, (882), 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-02-07 22:55:57,964 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 888 transitions.
[2025-02-07 22:55:57,964 INFO  L78                 Accepts]: Start accepts. Automaton has 626 states and 888 transitions. Word has length 173
[2025-02-07 22:55:57,965 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:55:57,965 INFO  L471      AbstractCegarLoop]: Abstraction has 626 states and 888 transitions.
[2025-02-07 22:55:57,965 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 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-02-07 22:55:57,965 INFO  L276                IsEmpty]: Start isEmpty. Operand 626 states and 888 transitions.
[2025-02-07 22:55:57,966 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 174
[2025-02-07 22:55:57,966 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:55:57,966 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]
[2025-02-07 22:55:57,966 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2025-02-07 22:55:57,967 INFO  L396      AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:55:57,967 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:55:57,967 INFO  L85        PathProgramCache]: Analyzing trace with hash -1482323112, now seen corresponding path program 1 times
[2025-02-07 22:55:57,967 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:55:57,967 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445846821]
[2025-02-07 22:55:57,967 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:55:57,967 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:55:57,995 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes.
[2025-02-07 22:55:58,079 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements.
[2025-02-07 22:55:58,080 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:55:58,080 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:55:58,262 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-02-07 22:55:58,262 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:55:58,262 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445846821]
[2025-02-07 22:55:58,262 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445846821] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:55:58,262 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:55:58,262 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-07 22:55:58,262 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066844207]
[2025-02-07 22:55:58,262 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:55:58,262 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-07 22:55:58,263 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:55:58,263 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-07 22:55:58,263 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-07 22:55:58,263 INFO  L87              Difference]: Start difference. First operand 626 states and 888 transitions. Second operand  has 5 states, 5 states have (on average 32.2) internal successors, (161), 5 states have internal predecessors, (161), 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-02-07 22:55:58,555 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:55:58,555 INFO  L93              Difference]: Finished difference Result 1151 states and 1625 transitions.
[2025-02-07 22:55:58,555 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-07 22:55:58,555 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 32.2) internal successors, (161), 5 states have internal predecessors, (161), 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 173
[2025-02-07 22:55:58,556 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:55:58,557 INFO  L225             Difference]: With dead ends: 1151
[2025-02-07 22:55:58,557 INFO  L226             Difference]: Without dead ends: 626
[2025-02-07 22:55:58,558 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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-02-07 22:55:58,559 INFO  L435           NwaCegarLoop]: 607 mSDtfsCounter, 1324 mSDsluCounter, 608 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1324 SdHoareTripleChecker+Valid, 1215 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-02-07 22:55:58,559 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1324 Valid, 1215 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-02-07 22:55:58,560 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 626 states.
[2025-02-07 22:55:58,567 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626.
[2025-02-07 22:55:58,568 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 626 states, 621 states have (on average 1.4170692431561998) internal successors, (880), 621 states have internal predecessors, (880), 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-02-07 22:55:58,570 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 886 transitions.
[2025-02-07 22:55:58,570 INFO  L78                 Accepts]: Start accepts. Automaton has 626 states and 886 transitions. Word has length 173
[2025-02-07 22:55:58,570 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:55:58,570 INFO  L471      AbstractCegarLoop]: Abstraction has 626 states and 886 transitions.
[2025-02-07 22:55:58,570 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 32.2) internal successors, (161), 5 states have internal predecessors, (161), 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-02-07 22:55:58,570 INFO  L276                IsEmpty]: Start isEmpty. Operand 626 states and 886 transitions.
[2025-02-07 22:55:58,571 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 175
[2025-02-07 22:55:58,571 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:55:58,571 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]
[2025-02-07 22:55:58,571 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26
[2025-02-07 22:55:58,571 INFO  L396      AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:55:58,572 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:55:58,572 INFO  L85        PathProgramCache]: Analyzing trace with hash -173441211, now seen corresponding path program 1 times
[2025-02-07 22:55:58,572 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:55:58,572 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361260629]
[2025-02-07 22:55:58,572 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:55:58,572 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:55:58,600 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes.
[2025-02-07 22:55:58,655 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements.
[2025-02-07 22:55:58,655 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:55:58,655 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:55:58,839 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-02-07 22:55:58,839 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:55:58,840 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361260629]
[2025-02-07 22:55:58,840 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361260629] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:55:58,840 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:55:58,840 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-07 22:55:58,840 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115268059]
[2025-02-07 22:55:58,840 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:55:58,840 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-07 22:55:58,840 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:55:58,841 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-07 22:55:58,841 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-07 22:55:58,841 INFO  L87              Difference]: Start difference. First operand 626 states and 886 transitions. Second operand  has 5 states, 5 states have (on average 32.4) internal successors, (162), 5 states have internal predecessors, (162), 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-02-07 22:55:59,117 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:55:59,118 INFO  L93              Difference]: Finished difference Result 1151 states and 1621 transitions.
[2025-02-07 22:55:59,118 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-07 22:55:59,118 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 32.4) internal successors, (162), 5 states have internal predecessors, (162), 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 174
[2025-02-07 22:55:59,118 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:55:59,120 INFO  L225             Difference]: With dead ends: 1151
[2025-02-07 22:55:59,120 INFO  L226             Difference]: Without dead ends: 626
[2025-02-07 22:55:59,120 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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-02-07 22:55:59,121 INFO  L435           NwaCegarLoop]: 607 mSDtfsCounter, 667 mSDsluCounter, 614 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 667 SdHoareTripleChecker+Valid, 1221 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-02-07 22:55:59,121 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [667 Valid, 1221 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-02-07 22:55:59,122 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 626 states.
[2025-02-07 22:55:59,131 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626.
[2025-02-07 22:55:59,132 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 626 states, 621 states have (on average 1.4138486312399356) internal successors, (878), 621 states have internal predecessors, (878), 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-02-07 22:55:59,133 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 884 transitions.
[2025-02-07 22:55:59,133 INFO  L78                 Accepts]: Start accepts. Automaton has 626 states and 884 transitions. Word has length 174
[2025-02-07 22:55:59,133 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:55:59,133 INFO  L471      AbstractCegarLoop]: Abstraction has 626 states and 884 transitions.
[2025-02-07 22:55:59,133 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 32.4) internal successors, (162), 5 states have internal predecessors, (162), 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-02-07 22:55:59,133 INFO  L276                IsEmpty]: Start isEmpty. Operand 626 states and 884 transitions.
[2025-02-07 22:55:59,134 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 176
[2025-02-07 22:55:59,134 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:55:59,134 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]
[2025-02-07 22:55:59,134 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27
[2025-02-07 22:55:59,134 INFO  L396      AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:55:59,135 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:55:59,135 INFO  L85        PathProgramCache]: Analyzing trace with hash -1014696907, now seen corresponding path program 1 times
[2025-02-07 22:55:59,135 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:55:59,135 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327446819]
[2025-02-07 22:55:59,135 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:55:59,135 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:55:59,163 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes.
[2025-02-07 22:55:59,220 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements.
[2025-02-07 22:55:59,221 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:55:59,221 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:55:59,427 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-02-07 22:55:59,427 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:55:59,427 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327446819]
[2025-02-07 22:55:59,427 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327446819] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:55:59,427 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:55:59,427 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-07 22:55:59,427 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946125121]
[2025-02-07 22:55:59,427 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:55:59,428 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-07 22:55:59,428 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:55:59,428 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-07 22:55:59,428 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-07 22:55:59,429 INFO  L87              Difference]: Start difference. First operand 626 states and 884 transitions. Second operand  has 5 states, 5 states have (on average 32.6) internal successors, (163), 5 states have internal predecessors, (163), 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-02-07 22:55:59,701 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:55:59,701 INFO  L93              Difference]: Finished difference Result 1151 states and 1617 transitions.
[2025-02-07 22:55:59,702 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-07 22:55:59,702 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 32.6) internal successors, (163), 5 states have internal predecessors, (163), 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 175
[2025-02-07 22:55:59,702 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:55:59,704 INFO  L225             Difference]: With dead ends: 1151
[2025-02-07 22:55:59,704 INFO  L226             Difference]: Without dead ends: 626
[2025-02-07 22:55:59,704 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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-02-07 22:55:59,704 INFO  L435           NwaCegarLoop]: 607 mSDtfsCounter, 1308 mSDsluCounter, 608 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1308 SdHoareTripleChecker+Valid, 1215 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-02-07 22:55:59,705 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1308 Valid, 1215 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-02-07 22:55:59,705 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 626 states.
[2025-02-07 22:55:59,711 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626.
[2025-02-07 22:55:59,712 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 626 states, 621 states have (on average 1.4106280193236715) internal successors, (876), 621 states have internal predecessors, (876), 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-02-07 22:55:59,712 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 882 transitions.
[2025-02-07 22:55:59,712 INFO  L78                 Accepts]: Start accepts. Automaton has 626 states and 882 transitions. Word has length 175
[2025-02-07 22:55:59,713 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:55:59,713 INFO  L471      AbstractCegarLoop]: Abstraction has 626 states and 882 transitions.
[2025-02-07 22:55:59,713 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 32.6) internal successors, (163), 5 states have internal predecessors, (163), 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-02-07 22:55:59,713 INFO  L276                IsEmpty]: Start isEmpty. Operand 626 states and 882 transitions.
[2025-02-07 22:55:59,714 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 177
[2025-02-07 22:55:59,714 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:55:59,714 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]
[2025-02-07 22:55:59,714 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28
[2025-02-07 22:55:59,714 INFO  L396      AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:55:59,714 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:55:59,714 INFO  L85        PathProgramCache]: Analyzing trace with hash 642360426, now seen corresponding path program 1 times
[2025-02-07 22:55:59,714 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:55:59,714 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392372647]
[2025-02-07 22:55:59,715 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:55:59,715 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:55:59,741 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes.
[2025-02-07 22:55:59,807 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements.
[2025-02-07 22:55:59,808 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:55:59,808 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:55:59,943 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-02-07 22:55:59,943 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:55:59,944 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392372647]
[2025-02-07 22:55:59,944 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392372647] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:55:59,944 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:55:59,944 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-07 22:55:59,944 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674765471]
[2025-02-07 22:55:59,944 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:55:59,944 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-07 22:55:59,944 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:55:59,945 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-07 22:55:59,945 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-07 22:55:59,945 INFO  L87              Difference]: Start difference. First operand 626 states and 882 transitions. Second operand  has 4 states, 4 states have (on average 41.0) internal successors, (164), 4 states have internal predecessors, (164), 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-02-07 22:56:00,135 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:56:00,135 INFO  L93              Difference]: Finished difference Result 1151 states and 1613 transitions.
[2025-02-07 22:56:00,136 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-07 22:56:00,136 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 41.0) internal successors, (164), 4 states have internal predecessors, (164), 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 176
[2025-02-07 22:56:00,136 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:56:00,137 INFO  L225             Difference]: With dead ends: 1151
[2025-02-07 22:56:00,138 INFO  L226             Difference]: Without dead ends: 626
[2025-02-07 22:56:00,138 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-02-07 22:56:00,139 INFO  L435           NwaCegarLoop]: 642 mSDtfsCounter, 684 mSDsluCounter, 643 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 684 SdHoareTripleChecker+Valid, 1285 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-02-07 22:56:00,139 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [684 Valid, 1285 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-02-07 22:56:00,140 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 626 states.
[2025-02-07 22:56:00,145 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626.
[2025-02-07 22:56:00,146 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 626 states, 621 states have (on average 1.4074074074074074) internal successors, (874), 621 states have internal predecessors, (874), 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-02-07 22:56:00,146 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 880 transitions.
[2025-02-07 22:56:00,147 INFO  L78                 Accepts]: Start accepts. Automaton has 626 states and 880 transitions. Word has length 176
[2025-02-07 22:56:00,147 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:56:00,147 INFO  L471      AbstractCegarLoop]: Abstraction has 626 states and 880 transitions.
[2025-02-07 22:56:00,147 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 41.0) internal successors, (164), 4 states have internal predecessors, (164), 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-02-07 22:56:00,147 INFO  L276                IsEmpty]: Start isEmpty. Operand 626 states and 880 transitions.
[2025-02-07 22:56:00,148 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 178
[2025-02-07 22:56:00,148 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:56:00,148 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]
[2025-02-07 22:56:00,148 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29
[2025-02-07 22:56:00,148 INFO  L396      AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:56:00,148 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:56:00,149 INFO  L85        PathProgramCache]: Analyzing trace with hash 95739355, now seen corresponding path program 1 times
[2025-02-07 22:56:00,149 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:56:00,149 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433682899]
[2025-02-07 22:56:00,149 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:56:00,149 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:56:00,177 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes.
[2025-02-07 22:56:00,250 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements.
[2025-02-07 22:56:00,250 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:56:00,250 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:56:00,397 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-02-07 22:56:00,397 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:56:00,397 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433682899]
[2025-02-07 22:56:00,397 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433682899] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:56:00,397 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:56:00,397 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-07 22:56:00,397 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755406731]
[2025-02-07 22:56:00,397 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:56:00,398 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-07 22:56:00,398 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:56:00,399 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-07 22:56:00,399 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-07 22:56:00,399 INFO  L87              Difference]: Start difference. First operand 626 states and 880 transitions. Second operand  has 4 states, 4 states have (on average 41.25) internal successors, (165), 4 states have internal predecessors, (165), 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-02-07 22:56:00,660 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:56:00,660 INFO  L93              Difference]: Finished difference Result 1151 states and 1609 transitions.
[2025-02-07 22:56:00,660 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-07 22:56:00,661 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 41.25) internal successors, (165), 4 states have internal predecessors, (165), 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 177
[2025-02-07 22:56:00,661 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:56:00,662 INFO  L225             Difference]: With dead ends: 1151
[2025-02-07 22:56:00,662 INFO  L226             Difference]: Without dead ends: 626
[2025-02-07 22:56:00,663 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-02-07 22:56:00,663 INFO  L435           NwaCegarLoop]: 627 mSDtfsCounter, 676 mSDsluCounter, 628 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 676 SdHoareTripleChecker+Valid, 1255 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-02-07 22:56:00,663 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [676 Valid, 1255 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-02-07 22:56:00,664 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 626 states.
[2025-02-07 22:56:00,673 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626.
[2025-02-07 22:56:00,674 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 626 states, 621 states have (on average 1.4041867954911433) internal successors, (872), 621 states have internal predecessors, (872), 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-02-07 22:56:00,675 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 878 transitions.
[2025-02-07 22:56:00,675 INFO  L78                 Accepts]: Start accepts. Automaton has 626 states and 878 transitions. Word has length 177
[2025-02-07 22:56:00,675 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:56:00,675 INFO  L471      AbstractCegarLoop]: Abstraction has 626 states and 878 transitions.
[2025-02-07 22:56:00,676 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 41.25) internal successors, (165), 4 states have internal predecessors, (165), 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-02-07 22:56:00,676 INFO  L276                IsEmpty]: Start isEmpty. Operand 626 states and 878 transitions.
[2025-02-07 22:56:00,677 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 179
[2025-02-07 22:56:00,677 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:56:00,677 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]
[2025-02-07 22:56:00,677 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30
[2025-02-07 22:56:00,677 INFO  L396      AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:56:00,677 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:56:00,678 INFO  L85        PathProgramCache]: Analyzing trace with hash -1080802719, now seen corresponding path program 1 times
[2025-02-07 22:56:00,678 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:56:00,678 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655265378]
[2025-02-07 22:56:00,678 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:56:00,678 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:56:00,716 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes.
[2025-02-07 22:56:00,784 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements.
[2025-02-07 22:56:00,784 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:56:00,784 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:56:01,040 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-02-07 22:56:01,040 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:56:01,040 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655265378]
[2025-02-07 22:56:01,040 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655265378] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:56:01,040 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:56:01,040 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-07 22:56:01,040 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072530659]
[2025-02-07 22:56:01,040 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:56:01,041 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-07 22:56:01,041 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:56:01,042 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-07 22:56:01,042 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-07 22:56:01,042 INFO  L87              Difference]: Start difference. First operand 626 states and 878 transitions. Second operand  has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 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-02-07 22:56:01,292 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:56:01,292 INFO  L93              Difference]: Finished difference Result 1151 states and 1605 transitions.
[2025-02-07 22:56:01,293 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-07 22:56:01,293 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 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 178
[2025-02-07 22:56:01,293 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:56:01,295 INFO  L225             Difference]: With dead ends: 1151
[2025-02-07 22:56:01,295 INFO  L226             Difference]: Without dead ends: 626
[2025-02-07 22:56:01,295 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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-02-07 22:56:01,295 INFO  L435           NwaCegarLoop]: 627 mSDtfsCounter, 674 mSDsluCounter, 634 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 674 SdHoareTripleChecker+Valid, 1261 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-02-07 22:56:01,296 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [674 Valid, 1261 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-02-07 22:56:01,303 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 626 states.
[2025-02-07 22:56:01,313 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626.
[2025-02-07 22:56:01,319 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 626 states, 621 states have (on average 1.4009661835748792) internal successors, (870), 621 states have internal predecessors, (870), 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-02-07 22:56:01,319 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 876 transitions.
[2025-02-07 22:56:01,320 INFO  L78                 Accepts]: Start accepts. Automaton has 626 states and 876 transitions. Word has length 178
[2025-02-07 22:56:01,320 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:56:01,321 INFO  L471      AbstractCegarLoop]: Abstraction has 626 states and 876 transitions.
[2025-02-07 22:56:01,321 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 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-02-07 22:56:01,321 INFO  L276                IsEmpty]: Start isEmpty. Operand 626 states and 876 transitions.
[2025-02-07 22:56:01,326 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 180
[2025-02-07 22:56:01,326 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:56:01,326 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]
[2025-02-07 22:56:01,326 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31
[2025-02-07 22:56:01,326 INFO  L396      AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:56:01,326 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:56:01,326 INFO  L85        PathProgramCache]: Analyzing trace with hash -2054101659, now seen corresponding path program 1 times
[2025-02-07 22:56:01,326 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:56:01,326 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427841070]
[2025-02-07 22:56:01,326 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:56:01,326 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:56:01,368 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes.
[2025-02-07 22:56:01,469 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements.
[2025-02-07 22:56:01,469 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:56:01,469 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:56:01,786 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-02-07 22:56:01,786 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:56:01,786 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427841070]
[2025-02-07 22:56:01,787 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427841070] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:56:01,787 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:56:01,787 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-07 22:56:01,787 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979871722]
[2025-02-07 22:56:01,787 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:56:01,787 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-07 22:56:01,787 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:56:01,788 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-07 22:56:01,788 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-07 22:56:01,788 INFO  L87              Difference]: Start difference. First operand 626 states and 876 transitions. Second operand  has 5 states, 5 states have (on average 33.4) internal successors, (167), 5 states have internal predecessors, (167), 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-02-07 22:56:02,007 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:56:02,007 INFO  L93              Difference]: Finished difference Result 1151 states and 1601 transitions.
[2025-02-07 22:56:02,008 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-07 22:56:02,008 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 33.4) internal successors, (167), 5 states have internal predecessors, (167), 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 179
[2025-02-07 22:56:02,008 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:56:02,009 INFO  L225             Difference]: With dead ends: 1151
[2025-02-07 22:56:02,009 INFO  L226             Difference]: Without dead ends: 626
[2025-02-07 22:56:02,010 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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-02-07 22:56:02,010 INFO  L435           NwaCegarLoop]: 627 mSDtfsCounter, 673 mSDsluCounter, 634 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 673 SdHoareTripleChecker+Valid, 1261 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-02-07 22:56:02,010 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [673 Valid, 1261 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-02-07 22:56:02,010 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 626 states.
[2025-02-07 22:56:02,016 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626.
[2025-02-07 22:56:02,016 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 626 states, 621 states have (on average 1.3977455716586151) internal successors, (868), 621 states have internal predecessors, (868), 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-02-07 22:56:02,017 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 874 transitions.
[2025-02-07 22:56:02,017 INFO  L78                 Accepts]: Start accepts. Automaton has 626 states and 874 transitions. Word has length 179
[2025-02-07 22:56:02,017 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:56:02,017 INFO  L471      AbstractCegarLoop]: Abstraction has 626 states and 874 transitions.
[2025-02-07 22:56:02,017 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 33.4) internal successors, (167), 5 states have internal predecessors, (167), 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-02-07 22:56:02,017 INFO  L276                IsEmpty]: Start isEmpty. Operand 626 states and 874 transitions.
[2025-02-07 22:56:02,018 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 181
[2025-02-07 22:56:02,018 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:56:02,018 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]
[2025-02-07 22:56:02,018 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32
[2025-02-07 22:56:02,018 INFO  L396      AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:56:02,019 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:56:02,019 INFO  L85        PathProgramCache]: Analyzing trace with hash -523643150, now seen corresponding path program 1 times
[2025-02-07 22:56:02,019 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:56:02,019 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463280268]
[2025-02-07 22:56:02,019 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:56:02,019 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:56:02,057 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes.
[2025-02-07 22:56:02,210 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements.
[2025-02-07 22:56:02,210 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:56:02,210 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:56:02,760 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-02-07 22:56:02,760 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:56:02,760 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463280268]
[2025-02-07 22:56:02,760 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463280268] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:56:02,760 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:56:02,760 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-02-07 22:56:02,760 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750550955]
[2025-02-07 22:56:02,760 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:56:02,761 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-02-07 22:56:02,761 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:56:02,762 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-02-07 22:56:02,762 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2025-02-07 22:56:02,762 INFO  L87              Difference]: Start difference. First operand 626 states and 874 transitions. Second operand  has 6 states, 6 states have (on average 28.0) internal successors, (168), 6 states have internal predecessors, (168), 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-02-07 22:56:03,446 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:56:03,446 INFO  L93              Difference]: Finished difference Result 1672 states and 2317 transitions.
[2025-02-07 22:56:03,446 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-02-07 22:56:03,446 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 28.0) internal successors, (168), 6 states have internal predecessors, (168), 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 180
[2025-02-07 22:56:03,447 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:56:03,449 INFO  L225             Difference]: With dead ends: 1672
[2025-02-07 22:56:03,449 INFO  L226             Difference]: Without dead ends: 1147
[2025-02-07 22:56:03,450 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2025-02-07 22:56:03,450 INFO  L435           NwaCegarLoop]: 603 mSDtfsCounter, 1822 mSDsluCounter, 1539 mSDsCounter, 0 mSdLazyCounter, 1238 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1825 SdHoareTripleChecker+Valid, 2142 SdHoareTripleChecker+Invalid, 1238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-02-07 22:56:03,450 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1825 Valid, 2142 Invalid, 1238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1238 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-02-07 22:56:03,451 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1147 states.
[2025-02-07 22:56:03,461 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1147 to 1145.
[2025-02-07 22:56:03,462 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1145 states, 1137 states have (on average 1.3887423043095866) internal successors, (1579), 1137 states have internal predecessors, (1579), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6)
[2025-02-07 22:56:03,463 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1145 states to 1145 states and 1591 transitions.
[2025-02-07 22:56:03,463 INFO  L78                 Accepts]: Start accepts. Automaton has 1145 states and 1591 transitions. Word has length 180
[2025-02-07 22:56:03,463 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:56:03,463 INFO  L471      AbstractCegarLoop]: Abstraction has 1145 states and 1591 transitions.
[2025-02-07 22:56:03,463 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 28.0) internal successors, (168), 6 states have internal predecessors, (168), 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-02-07 22:56:03,463 INFO  L276                IsEmpty]: Start isEmpty. Operand 1145 states and 1591 transitions.
[2025-02-07 22:56:03,464 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 182
[2025-02-07 22:56:03,464 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:56:03,464 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]
[2025-02-07 22:56:03,464 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33
[2025-02-07 22:56:03,464 INFO  L396      AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:56:03,465 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:56:03,465 INFO  L85        PathProgramCache]: Analyzing trace with hash -1618129637, now seen corresponding path program 1 times
[2025-02-07 22:56:03,465 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:56:03,465 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488904936]
[2025-02-07 22:56:03,465 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:56:03,465 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:56:03,494 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes.
[2025-02-07 22:56:03,560 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements.
[2025-02-07 22:56:03,560 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:56:03,560 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:56:03,872 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-02-07 22:56:03,872 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:56:03,872 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488904936]
[2025-02-07 22:56:03,873 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488904936] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:56:03,873 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:56:03,873 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-02-07 22:56:03,873 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200104267]
[2025-02-07 22:56:03,873 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:56:03,873 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-02-07 22:56:03,873 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:56:03,873 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-02-07 22:56:03,874 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2025-02-07 22:56:03,874 INFO  L87              Difference]: Start difference. First operand 1145 states and 1591 transitions. Second operand  has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 7 states have internal predecessors, (169), 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-02-07 22:56:04,412 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:56:04,412 INFO  L93              Difference]: Finished difference Result 2329 states and 3233 transitions.
[2025-02-07 22:56:04,412 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-02-07 22:56:04,412 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 7 states have internal predecessors, (169), 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 181
[2025-02-07 22:56:04,412 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:56:04,415 INFO  L225             Difference]: With dead ends: 2329
[2025-02-07 22:56:04,415 INFO  L226             Difference]: Without dead ends: 1153
[2025-02-07 22:56:04,417 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110
[2025-02-07 22:56:04,417 INFO  L435           NwaCegarLoop]: 664 mSDtfsCounter, 816 mSDsluCounter, 2487 mSDsCounter, 0 mSdLazyCounter, 937 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 819 SdHoareTripleChecker+Valid, 3151 SdHoareTripleChecker+Invalid, 943 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 937 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-02-07 22:56:04,417 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [819 Valid, 3151 Invalid, 943 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 937 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-02-07 22:56:04,418 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1153 states.
[2025-02-07 22:56:04,428 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1153 to 1149.
[2025-02-07 22:56:04,429 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1149 states, 1141 states have (on average 1.385626643295355) internal successors, (1581), 1141 states have internal predecessors, (1581), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6)
[2025-02-07 22:56:04,430 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1149 states to 1149 states and 1593 transitions.
[2025-02-07 22:56:04,431 INFO  L78                 Accepts]: Start accepts. Automaton has 1149 states and 1593 transitions. Word has length 181
[2025-02-07 22:56:04,431 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:56:04,431 INFO  L471      AbstractCegarLoop]: Abstraction has 1149 states and 1593 transitions.
[2025-02-07 22:56:04,431 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 7 states have internal predecessors, (169), 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-02-07 22:56:04,431 INFO  L276                IsEmpty]: Start isEmpty. Operand 1149 states and 1593 transitions.
[2025-02-07 22:56:04,432 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 183
[2025-02-07 22:56:04,432 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:56:04,432 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]
[2025-02-07 22:56:04,432 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34
[2025-02-07 22:56:04,432 INFO  L396      AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:56:04,432 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:56:04,432 INFO  L85        PathProgramCache]: Analyzing trace with hash -226190565, now seen corresponding path program 1 times
[2025-02-07 22:56:04,432 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:56:04,433 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731865536]
[2025-02-07 22:56:04,433 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:56:04,433 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:56:04,458 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes.
[2025-02-07 22:56:04,531 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements.
[2025-02-07 22:56:04,531 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:56:04,531 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:56:04,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-02-07 22:56:04,725 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:56:04,725 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731865536]
[2025-02-07 22:56:04,725 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731865536] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:56:04,725 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:56:04,725 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-02-07 22:56:04,725 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320895998]
[2025-02-07 22:56:04,725 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:56:04,726 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-02-07 22:56:04,726 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:56:04,726 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-02-07 22:56:04,726 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2025-02-07 22:56:04,726 INFO  L87              Difference]: Start difference. First operand 1149 states and 1593 transitions. Second operand  has 7 states, 7 states have (on average 24.285714285714285) internal successors, (170), 7 states have internal predecessors, (170), 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-02-07 22:56:05,322 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:56:05,322 INFO  L93              Difference]: Finished difference Result 2205 states and 3047 transitions.
[2025-02-07 22:56:05,322 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-02-07 22:56:05,322 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 24.285714285714285) internal successors, (170), 7 states have internal predecessors, (170), 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 182
[2025-02-07 22:56:05,323 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:56:05,325 INFO  L225             Difference]: With dead ends: 2205
[2025-02-07 22:56:05,325 INFO  L226             Difference]: Without dead ends: 1157
[2025-02-07 22:56:05,326 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90
[2025-02-07 22:56:05,326 INFO  L435           NwaCegarLoop]: 490 mSDtfsCounter, 768 mSDsluCounter, 1468 mSDsCounter, 0 mSdLazyCounter, 1190 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 769 SdHoareTripleChecker+Valid, 1958 SdHoareTripleChecker+Invalid, 1192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-02-07 22:56:05,326 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [769 Valid, 1958 Invalid, 1192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1190 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-02-07 22:56:05,327 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1157 states.
[2025-02-07 22:56:05,337 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1157 to 1153.
[2025-02-07 22:56:05,338 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1153 states, 1145 states have (on average 1.3825327510917031) internal successors, (1583), 1145 states have internal predecessors, (1583), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6)
[2025-02-07 22:56:05,339 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1153 states to 1153 states and 1595 transitions.
[2025-02-07 22:56:05,339 INFO  L78                 Accepts]: Start accepts. Automaton has 1153 states and 1595 transitions. Word has length 182
[2025-02-07 22:56:05,339 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:56:05,339 INFO  L471      AbstractCegarLoop]: Abstraction has 1153 states and 1595 transitions.
[2025-02-07 22:56:05,339 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 24.285714285714285) internal successors, (170), 7 states have internal predecessors, (170), 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-02-07 22:56:05,339 INFO  L276                IsEmpty]: Start isEmpty. Operand 1153 states and 1595 transitions.
[2025-02-07 22:56:05,340 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 184
[2025-02-07 22:56:05,340 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:56:05,340 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]
[2025-02-07 22:56:05,340 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35
[2025-02-07 22:56:05,341 INFO  L396      AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:56:05,341 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:56:05,341 INFO  L85        PathProgramCache]: Analyzing trace with hash -118277816, now seen corresponding path program 1 times
[2025-02-07 22:56:05,341 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:56:05,341 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456935055]
[2025-02-07 22:56:05,341 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:56:05,341 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:56:05,368 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes.
[2025-02-07 22:56:05,435 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements.
[2025-02-07 22:56:05,435 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:56:05,435 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:56:05,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-02-07 22:56:05,659 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:56:05,659 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456935055]
[2025-02-07 22:56:05,659 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456935055] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:56:05,660 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:56:05,660 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-02-07 22:56:05,660 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909029681]
[2025-02-07 22:56:05,660 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:56:05,660 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-02-07 22:56:05,660 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:56:05,660 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-02-07 22:56:05,661 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2025-02-07 22:56:05,661 INFO  L87              Difference]: Start difference. First operand 1153 states and 1595 transitions. Second operand  has 7 states, 7 states have (on average 24.428571428571427) internal successors, (171), 7 states have internal predecessors, (171), 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-02-07 22:56:06,250 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:56:06,250 INFO  L93              Difference]: Finished difference Result 2213 states and 3051 transitions.
[2025-02-07 22:56:06,251 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-02-07 22:56:06,251 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 24.428571428571427) internal successors, (171), 7 states have internal predecessors, (171), 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 183
[2025-02-07 22:56:06,251 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:56:06,253 INFO  L225             Difference]: With dead ends: 2213
[2025-02-07 22:56:06,254 INFO  L226             Difference]: Without dead ends: 1161
[2025-02-07 22:56:06,254 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90
[2025-02-07 22:56:06,255 INFO  L435           NwaCegarLoop]: 489 mSDtfsCounter, 774 mSDsluCounter, 1465 mSDsCounter, 0 mSdLazyCounter, 1190 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 776 SdHoareTripleChecker+Valid, 1954 SdHoareTripleChecker+Invalid, 1192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-02-07 22:56:06,255 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [776 Valid, 1954 Invalid, 1192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1190 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-02-07 22:56:06,256 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1161 states.
[2025-02-07 22:56:06,265 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1161 to 1157.
[2025-02-07 22:56:06,266 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1157 states, 1149 states have (on average 1.3794604003481288) internal successors, (1585), 1149 states have internal predecessors, (1585), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6)
[2025-02-07 22:56:06,267 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 1157 states and 1597 transitions.
[2025-02-07 22:56:06,267 INFO  L78                 Accepts]: Start accepts. Automaton has 1157 states and 1597 transitions. Word has length 183
[2025-02-07 22:56:06,267 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:56:06,267 INFO  L471      AbstractCegarLoop]: Abstraction has 1157 states and 1597 transitions.
[2025-02-07 22:56:06,267 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 24.428571428571427) internal successors, (171), 7 states have internal predecessors, (171), 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-02-07 22:56:06,267 INFO  L276                IsEmpty]: Start isEmpty. Operand 1157 states and 1597 transitions.
[2025-02-07 22:56:06,268 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 185
[2025-02-07 22:56:06,268 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:56:06,268 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]
[2025-02-07 22:56:06,268 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36
[2025-02-07 22:56:06,268 INFO  L396      AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:56:06,268 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:56:06,268 INFO  L85        PathProgramCache]: Analyzing trace with hash 585639244, now seen corresponding path program 1 times
[2025-02-07 22:56:06,268 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:56:06,268 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531700148]
[2025-02-07 22:56:06,268 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:56:06,268 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:56:06,296 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes.
[2025-02-07 22:56:06,369 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements.
[2025-02-07 22:56:06,370 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:56:06,370 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:56:06,572 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-02-07 22:56:06,573 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:56:06,573 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531700148]
[2025-02-07 22:56:06,573 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531700148] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:56:06,573 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:56:06,573 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-02-07 22:56:06,573 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863717770]
[2025-02-07 22:56:06,573 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:56:06,573 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-02-07 22:56:06,574 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:56:06,574 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-02-07 22:56:06,574 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-02-07 22:56:06,574 INFO  L87              Difference]: Start difference. First operand 1157 states and 1597 transitions. Second operand  has 6 states, 6 states have (on average 28.666666666666668) internal successors, (172), 6 states have internal predecessors, (172), 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-02-07 22:56:07,142 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:56:07,142 INFO  L93              Difference]: Finished difference Result 2217 states and 3049 transitions.
[2025-02-07 22:56:07,142 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-02-07 22:56:07,143 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 28.666666666666668) internal successors, (172), 6 states have internal predecessors, (172), 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 184
[2025-02-07 22:56:07,143 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:56:07,145 INFO  L225             Difference]: With dead ends: 2217
[2025-02-07 22:56:07,145 INFO  L226             Difference]: Without dead ends: 1161
[2025-02-07 22:56:07,146 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2025-02-07 22:56:07,146 INFO  L435           NwaCegarLoop]: 489 mSDtfsCounter, 717 mSDsluCounter, 1459 mSDsCounter, 0 mSdLazyCounter, 1190 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 719 SdHoareTripleChecker+Valid, 1948 SdHoareTripleChecker+Invalid, 1190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-02-07 22:56:07,147 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [719 Valid, 1948 Invalid, 1190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1190 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-02-07 22:56:07,147 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1161 states.
[2025-02-07 22:56:07,157 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1161 to 1159.
[2025-02-07 22:56:07,158 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1159 states, 1151 states have (on average 1.3788010425716768) internal successors, (1587), 1151 states have internal predecessors, (1587), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6)
[2025-02-07 22:56:07,159 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1159 states to 1159 states and 1599 transitions.
[2025-02-07 22:56:07,159 INFO  L78                 Accepts]: Start accepts. Automaton has 1159 states and 1599 transitions. Word has length 184
[2025-02-07 22:56:07,159 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:56:07,159 INFO  L471      AbstractCegarLoop]: Abstraction has 1159 states and 1599 transitions.
[2025-02-07 22:56:07,160 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 28.666666666666668) internal successors, (172), 6 states have internal predecessors, (172), 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-02-07 22:56:07,160 INFO  L276                IsEmpty]: Start isEmpty. Operand 1159 states and 1599 transitions.
[2025-02-07 22:56:07,160 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 186
[2025-02-07 22:56:07,160 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:56:07,161 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]
[2025-02-07 22:56:07,161 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37
[2025-02-07 22:56:07,161 INFO  L396      AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:56:07,161 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:56:07,161 INFO  L85        PathProgramCache]: Analyzing trace with hash -538571377, now seen corresponding path program 1 times
[2025-02-07 22:56:07,161 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:56:07,161 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139408847]
[2025-02-07 22:56:07,161 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:56:07,161 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:56:07,205 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes.
[2025-02-07 22:56:07,304 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements.
[2025-02-07 22:56:07,304 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:56:07,304 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:56:07,684 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-02-07 22:56:07,684 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:56:07,684 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139408847]
[2025-02-07 22:56:07,684 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139408847] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:56:07,684 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:56:07,684 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-07 22:56:07,685 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527842518]
[2025-02-07 22:56:07,685 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:56:07,685 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-07 22:56:07,685 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:56:07,685 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-07 22:56:07,685 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-02-07 22:56:07,686 INFO  L87              Difference]: Start difference. First operand 1159 states and 1599 transitions. Second operand  has 5 states, 5 states have (on average 34.6) internal successors, (173), 5 states have internal predecessors, (173), 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-02-07 22:56:08,103 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:56:08,103 INFO  L93              Difference]: Finished difference Result 1707 states and 2344 transitions.
[2025-02-07 22:56:08,104 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-07 22:56:08,104 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 34.6) internal successors, (173), 5 states have internal predecessors, (173), 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 185
[2025-02-07 22:56:08,104 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:56:08,106 INFO  L225             Difference]: With dead ends: 1707
[2025-02-07 22:56:08,106 INFO  L226             Difference]: Without dead ends: 1175
[2025-02-07 22:56:08,107 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-02-07 22:56:08,107 INFO  L435           NwaCegarLoop]: 500 mSDtfsCounter, 681 mSDsluCounter, 993 mSDsCounter, 0 mSdLazyCounter, 864 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 681 SdHoareTripleChecker+Valid, 1493 SdHoareTripleChecker+Invalid, 864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 864 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-02-07 22:56:08,108 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [681 Valid, 1493 Invalid, 864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 864 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-02-07 22:56:08,109 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1175 states.
[2025-02-07 22:56:08,119 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 1171.
[2025-02-07 22:56:08,120 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1171 states, 1163 states have (on average 1.3748925193465176) internal successors, (1599), 1163 states have internal predecessors, (1599), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6)
[2025-02-07 22:56:08,121 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1171 states to 1171 states and 1611 transitions.
[2025-02-07 22:56:08,122 INFO  L78                 Accepts]: Start accepts. Automaton has 1171 states and 1611 transitions. Word has length 185
[2025-02-07 22:56:08,122 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:56:08,122 INFO  L471      AbstractCegarLoop]: Abstraction has 1171 states and 1611 transitions.
[2025-02-07 22:56:08,122 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 34.6) internal successors, (173), 5 states have internal predecessors, (173), 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-02-07 22:56:08,122 INFO  L276                IsEmpty]: Start isEmpty. Operand 1171 states and 1611 transitions.
[2025-02-07 22:56:08,123 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 186
[2025-02-07 22:56:08,123 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:56:08,123 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]
[2025-02-07 22:56:08,123 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38
[2025-02-07 22:56:08,123 INFO  L396      AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:56:08,124 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:56:08,124 INFO  L85        PathProgramCache]: Analyzing trace with hash -1974386749, now seen corresponding path program 1 times
[2025-02-07 22:56:08,124 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:56:08,124 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821143851]
[2025-02-07 22:56:08,124 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:56:08,124 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:56:08,153 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes.
[2025-02-07 22:56:08,235 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements.
[2025-02-07 22:56:08,235 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:56:08,235 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:56:08,455 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-02-07 22:56:08,455 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:56:08,455 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821143851]
[2025-02-07 22:56:08,455 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821143851] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:56:08,455 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:56:08,455 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-02-07 22:56:08,455 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964221619]
[2025-02-07 22:56:08,455 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:56:08,456 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-02-07 22:56:08,456 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:56:08,456 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-02-07 22:56:08,456 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-02-07 22:56:08,456 INFO  L87              Difference]: Start difference. First operand 1171 states and 1611 transitions. Second operand  has 6 states, 6 states have (on average 28.833333333333332) internal successors, (173), 6 states have internal predecessors, (173), 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-02-07 22:56:09,016 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:56:09,017 INFO  L93              Difference]: Finished difference Result 2245 states and 3077 transitions.
[2025-02-07 22:56:09,017 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-02-07 22:56:09,017 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 28.833333333333332) internal successors, (173), 6 states have internal predecessors, (173), 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 185
[2025-02-07 22:56:09,017 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:56:09,020 INFO  L225             Difference]: With dead ends: 2245
[2025-02-07 22:56:09,020 INFO  L226             Difference]: Without dead ends: 1175
[2025-02-07 22:56:09,021 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2025-02-07 22:56:09,021 INFO  L435           NwaCegarLoop]: 489 mSDtfsCounter, 729 mSDsluCounter, 1459 mSDsCounter, 0 mSdLazyCounter, 1190 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 732 SdHoareTripleChecker+Valid, 1948 SdHoareTripleChecker+Invalid, 1190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-02-07 22:56:09,021 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [732 Valid, 1948 Invalid, 1190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1190 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-02-07 22:56:09,022 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1175 states.
[2025-02-07 22:56:09,031 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 1173.
[2025-02-07 22:56:09,032 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1173 states, 1165 states have (on average 1.3742489270386267) internal successors, (1601), 1165 states have internal predecessors, (1601), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6)
[2025-02-07 22:56:09,033 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1173 states to 1173 states and 1613 transitions.
[2025-02-07 22:56:09,033 INFO  L78                 Accepts]: Start accepts. Automaton has 1173 states and 1613 transitions. Word has length 185
[2025-02-07 22:56:09,033 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:56:09,033 INFO  L471      AbstractCegarLoop]: Abstraction has 1173 states and 1613 transitions.
[2025-02-07 22:56:09,033 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 28.833333333333332) internal successors, (173), 6 states have internal predecessors, (173), 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-02-07 22:56:09,034 INFO  L276                IsEmpty]: Start isEmpty. Operand 1173 states and 1613 transitions.
[2025-02-07 22:56:09,034 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 187
[2025-02-07 22:56:09,034 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:56:09,034 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]
[2025-02-07 22:56:09,035 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39
[2025-02-07 22:56:09,035 INFO  L396      AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:56:09,035 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:56:09,035 INFO  L85        PathProgramCache]: Analyzing trace with hash -1883102476, now seen corresponding path program 1 times
[2025-02-07 22:56:09,035 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:56:09,035 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495631335]
[2025-02-07 22:56:09,035 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:56:09,035 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:56:09,063 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes.
[2025-02-07 22:56:09,135 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements.
[2025-02-07 22:56:09,135 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:56:09,135 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:56:09,412 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-02-07 22:56:09,412 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:56:09,413 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495631335]
[2025-02-07 22:56:09,413 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495631335] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:56:09,413 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:56:09,413 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-02-07 22:56:09,413 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455712711]
[2025-02-07 22:56:09,413 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:56:09,413 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-02-07 22:56:09,415 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:56:09,416 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-02-07 22:56:09,416 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2025-02-07 22:56:09,416 INFO  L87              Difference]: Start difference. First operand 1173 states and 1613 transitions. Second operand  has 8 states, 8 states have (on average 21.75) internal successors, (174), 8 states have internal predecessors, (174), 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-02-07 22:56:10,503 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:56:10,504 INFO  L93              Difference]: Finished difference Result 3321 states and 4546 transitions.
[2025-02-07 22:56:10,504 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2025-02-07 22:56:10,504 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 21.75) internal successors, (174), 8 states have internal predecessors, (174), 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 186
[2025-02-07 22:56:10,504 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:56:10,510 INFO  L225             Difference]: With dead ends: 3321
[2025-02-07 22:56:10,512 INFO  L226             Difference]: Without dead ends: 2249
[2025-02-07 22:56:10,514 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132
[2025-02-07 22:56:10,514 INFO  L435           NwaCegarLoop]: 961 mSDtfsCounter, 1310 mSDsluCounter, 4152 mSDsCounter, 0 mSdLazyCounter, 2414 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1313 SdHoareTripleChecker+Valid, 5113 SdHoareTripleChecker+Invalid, 2414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time
[2025-02-07 22:56:10,514 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1313 Valid, 5113 Invalid, 2414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2414 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time]
[2025-02-07 22:56:10,515 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2249 states.
[2025-02-07 22:56:10,535 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2249 to 1174.
[2025-02-07 22:56:10,536 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1174 states, 1166 states have (on average 1.3747855917667238) internal successors, (1603), 1166 states have internal predecessors, (1603), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6)
[2025-02-07 22:56:10,536 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1174 states to 1174 states and 1615 transitions.
[2025-02-07 22:56:10,537 INFO  L78                 Accepts]: Start accepts. Automaton has 1174 states and 1615 transitions. Word has length 186
[2025-02-07 22:56:10,537 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:56:10,537 INFO  L471      AbstractCegarLoop]: Abstraction has 1174 states and 1615 transitions.
[2025-02-07 22:56:10,537 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 21.75) internal successors, (174), 8 states have internal predecessors, (174), 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-02-07 22:56:10,537 INFO  L276                IsEmpty]: Start isEmpty. Operand 1174 states and 1615 transitions.
[2025-02-07 22:56:10,538 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 188
[2025-02-07 22:56:10,538 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:56:10,538 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]
[2025-02-07 22:56:10,538 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40
[2025-02-07 22:56:10,538 INFO  L396      AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:56:10,539 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:56:10,539 INFO  L85        PathProgramCache]: Analyzing trace with hash 388318668, now seen corresponding path program 1 times
[2025-02-07 22:56:10,539 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:56:10,539 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028342384]
[2025-02-07 22:56:10,539 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:56:10,539 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:56:10,568 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes.
[2025-02-07 22:56:10,715 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements.
[2025-02-07 22:56:10,715 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:56:10,715 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:56:11,193 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-02-07 22:56:11,193 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:56:11,193 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028342384]
[2025-02-07 22:56:11,193 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028342384] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:56:11,193 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:56:11,193 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-02-07 22:56:11,193 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597742289]
[2025-02-07 22:56:11,193 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:56:11,194 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-02-07 22:56:11,194 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:56:11,195 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-02-07 22:56:11,195 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2025-02-07 22:56:11,195 INFO  L87              Difference]: Start difference. First operand 1174 states and 1615 transitions. Second operand  has 7 states, 7 states have (on average 25.0) internal successors, (175), 7 states have internal predecessors, (175), 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-02-07 22:56:11,599 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:56:11,600 INFO  L93              Difference]: Finished difference Result 2676 states and 3596 transitions.
[2025-02-07 22:56:11,600 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-02-07 22:56:11,600 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 25.0) internal successors, (175), 7 states have internal predecessors, (175), 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 187
[2025-02-07 22:56:11,600 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:56:11,603 INFO  L225             Difference]: With dead ends: 2676
[2025-02-07 22:56:11,603 INFO  L226             Difference]: Without dead ends: 1603
[2025-02-07 22:56:11,604 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90
[2025-02-07 22:56:11,604 INFO  L435           NwaCegarLoop]: 639 mSDtfsCounter, 1118 mSDsluCounter, 2545 mSDsCounter, 0 mSdLazyCounter, 741 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1121 SdHoareTripleChecker+Valid, 3184 SdHoareTripleChecker+Invalid, 745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-02-07 22:56:11,604 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1121 Valid, 3184 Invalid, 745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 741 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-02-07 22:56:11,605 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1603 states.
[2025-02-07 22:56:11,620 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1603 to 1603.
[2025-02-07 22:56:11,622 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1603 states, 1591 states have (on average 1.3262099308610937) internal successors, (2110), 1591 states have internal predecessors, (2110), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10)
[2025-02-07 22:56:11,623 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1603 states to 1603 states and 2130 transitions.
[2025-02-07 22:56:11,623 INFO  L78                 Accepts]: Start accepts. Automaton has 1603 states and 2130 transitions. Word has length 187
[2025-02-07 22:56:11,623 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:56:11,623 INFO  L471      AbstractCegarLoop]: Abstraction has 1603 states and 2130 transitions.
[2025-02-07 22:56:11,624 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 25.0) internal successors, (175), 7 states have internal predecessors, (175), 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-02-07 22:56:11,624 INFO  L276                IsEmpty]: Start isEmpty. Operand 1603 states and 2130 transitions.
[2025-02-07 22:56:11,626 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 462
[2025-02-07 22:56:11,626 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:56:11,626 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-07 22:56:11,626 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41
[2025-02-07 22:56:11,627 INFO  L396      AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:56:11,627 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:56:11,627 INFO  L85        PathProgramCache]: Analyzing trace with hash -81282242, now seen corresponding path program 1 times
[2025-02-07 22:56:11,627 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:56:11,627 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337265471]
[2025-02-07 22:56:11,627 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:56:11,628 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:56:11,700 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 461 statements into 1 equivalence classes.
[2025-02-07 22:56:11,795 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 461 of 461 statements.
[2025-02-07 22:56:11,795 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:56:11,795 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:56:12,162 INFO  L134       CoverageAnalysis]: Checked inductivity of 181 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked.
[2025-02-07 22:56:12,162 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:56:12,162 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337265471]
[2025-02-07 22:56:12,162 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337265471] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:56:12,162 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:56:12,162 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-07 22:56:12,162 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331683118]
[2025-02-07 22:56:12,162 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:56:12,163 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-07 22:56:12,163 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:56:12,163 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-07 22:56:12,163 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-07 22:56:12,164 INFO  L87              Difference]: Start difference. First operand 1603 states and 2130 transitions. Second operand  has 5 states, 5 states have (on average 86.8) internal successors, (434), 5 states have internal predecessors, (434), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-02-07 22:56:12,406 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:56:12,406 INFO  L93              Difference]: Finished difference Result 2676 states and 3594 transitions.
[2025-02-07 22:56:12,407 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-07 22:56:12,407 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 86.8) internal successors, (434), 5 states have internal predecessors, (434), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 461
[2025-02-07 22:56:12,407 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:56:12,409 INFO  L225             Difference]: With dead ends: 2676
[2025-02-07 22:56:12,409 INFO  L226             Difference]: Without dead ends: 1603
[2025-02-07 22:56:12,410 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-02-07 22:56:12,411 INFO  L435           NwaCegarLoop]: 600 mSDtfsCounter, 720 mSDsluCounter, 607 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 723 SdHoareTripleChecker+Valid, 1207 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-02-07 22:56:12,411 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [723 Valid, 1207 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-02-07 22:56:12,412 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1603 states.
[2025-02-07 22:56:12,424 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1603 to 1603.
[2025-02-07 22:56:12,425 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1603 states, 1591 states have (on average 1.3249528598365807) internal successors, (2108), 1591 states have internal predecessors, (2108), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10)
[2025-02-07 22:56:12,426 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1603 states to 1603 states and 2128 transitions.
[2025-02-07 22:56:12,427 INFO  L78                 Accepts]: Start accepts. Automaton has 1603 states and 2128 transitions. Word has length 461
[2025-02-07 22:56:12,427 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:56:12,427 INFO  L471      AbstractCegarLoop]: Abstraction has 1603 states and 2128 transitions.
[2025-02-07 22:56:12,427 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 86.8) internal successors, (434), 5 states have internal predecessors, (434), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-02-07 22:56:12,427 INFO  L276                IsEmpty]: Start isEmpty. Operand 1603 states and 2128 transitions.
[2025-02-07 22:56:12,429 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 463
[2025-02-07 22:56:12,429 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:56:12,430 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-07 22:56:12,430 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42
[2025-02-07 22:56:12,430 INFO  L396      AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:56:12,430 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:56:12,430 INFO  L85        PathProgramCache]: Analyzing trace with hash -220261208, now seen corresponding path program 1 times
[2025-02-07 22:56:12,430 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:56:12,431 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593262320]
[2025-02-07 22:56:12,431 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:56:12,431 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:56:12,498 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 462 statements into 1 equivalence classes.
[2025-02-07 22:56:12,593 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 462 of 462 statements.
[2025-02-07 22:56:12,593 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:56:12,593 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:56:12,935 INFO  L134       CoverageAnalysis]: Checked inductivity of 181 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked.
[2025-02-07 22:56:12,935 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:56:12,935 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593262320]
[2025-02-07 22:56:12,935 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593262320] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:56:12,935 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:56:12,935 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-07 22:56:12,935 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406330656]
[2025-02-07 22:56:12,935 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:56:12,936 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-07 22:56:12,936 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:56:12,936 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-07 22:56:12,937 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-07 22:56:12,937 INFO  L87              Difference]: Start difference. First operand 1603 states and 2128 transitions. Second operand  has 5 states, 5 states have (on average 87.0) internal successors, (435), 5 states have internal predecessors, (435), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-02-07 22:56:13,179 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:56:13,179 INFO  L93              Difference]: Finished difference Result 2676 states and 3590 transitions.
[2025-02-07 22:56:13,180 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-07 22:56:13,180 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 87.0) internal successors, (435), 5 states have internal predecessors, (435), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 462
[2025-02-07 22:56:13,180 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:56:13,182 INFO  L225             Difference]: With dead ends: 2676
[2025-02-07 22:56:13,182 INFO  L226             Difference]: Without dead ends: 1603
[2025-02-07 22:56:13,183 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-02-07 22:56:13,185 INFO  L435           NwaCegarLoop]: 600 mSDtfsCounter, 712 mSDsluCounter, 607 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 715 SdHoareTripleChecker+Valid, 1207 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-02-07 22:56:13,185 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [715 Valid, 1207 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-02-07 22:56:13,186 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1603 states.
[2025-02-07 22:56:13,238 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1603 to 1603.
[2025-02-07 22:56:13,239 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1603 states, 1591 states have (on average 1.323695788812068) internal successors, (2106), 1591 states have internal predecessors, (2106), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10)
[2025-02-07 22:56:13,240 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1603 states to 1603 states and 2126 transitions.
[2025-02-07 22:56:13,240 INFO  L78                 Accepts]: Start accepts. Automaton has 1603 states and 2126 transitions. Word has length 462
[2025-02-07 22:56:13,240 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:56:13,241 INFO  L471      AbstractCegarLoop]: Abstraction has 1603 states and 2126 transitions.
[2025-02-07 22:56:13,241 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 87.0) internal successors, (435), 5 states have internal predecessors, (435), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-02-07 22:56:13,241 INFO  L276                IsEmpty]: Start isEmpty. Operand 1603 states and 2126 transitions.
[2025-02-07 22:56:13,243 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 464
[2025-02-07 22:56:13,243 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:56:13,243 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-07 22:56:13,243 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43
[2025-02-07 22:56:13,243 INFO  L396      AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:56:13,244 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:56:13,244 INFO  L85        PathProgramCache]: Analyzing trace with hash -296201521, now seen corresponding path program 1 times
[2025-02-07 22:56:13,244 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:56:13,244 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887481413]
[2025-02-07 22:56:13,244 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:56:13,244 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:56:13,315 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 463 statements into 1 equivalence classes.
[2025-02-07 22:56:13,413 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 463 of 463 statements.
[2025-02-07 22:56:13,413 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:56:13,413 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:56:13,741 INFO  L134       CoverageAnalysis]: Checked inductivity of 181 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked.
[2025-02-07 22:56:13,741 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:56:13,741 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887481413]
[2025-02-07 22:56:13,741 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887481413] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:56:13,741 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:56:13,741 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-07 22:56:13,741 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464777035]
[2025-02-07 22:56:13,742 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:56:13,742 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-07 22:56:13,742 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:56:13,743 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-07 22:56:13,743 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-07 22:56:13,743 INFO  L87              Difference]: Start difference. First operand 1603 states and 2126 transitions. Second operand  has 5 states, 5 states have (on average 87.2) internal successors, (436), 5 states have internal predecessors, (436), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-02-07 22:56:13,986 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:56:13,986 INFO  L93              Difference]: Finished difference Result 2676 states and 3586 transitions.
[2025-02-07 22:56:13,986 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-07 22:56:13,986 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 87.2) internal successors, (436), 5 states have internal predecessors, (436), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 463
[2025-02-07 22:56:13,987 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:56:13,989 INFO  L225             Difference]: With dead ends: 2676
[2025-02-07 22:56:13,989 INFO  L226             Difference]: Without dead ends: 1603
[2025-02-07 22:56:13,990 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-02-07 22:56:13,990 INFO  L435           NwaCegarLoop]: 600 mSDtfsCounter, 1279 mSDsluCounter, 601 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1282 SdHoareTripleChecker+Valid, 1201 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-02-07 22:56:13,990 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1282 Valid, 1201 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-02-07 22:56:13,991 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1603 states.
[2025-02-07 22:56:14,003 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1603 to 1603.
[2025-02-07 22:56:14,005 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1603 states, 1591 states have (on average 1.322438717787555) internal successors, (2104), 1591 states have internal predecessors, (2104), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10)
[2025-02-07 22:56:14,006 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1603 states to 1603 states and 2124 transitions.
[2025-02-07 22:56:14,006 INFO  L78                 Accepts]: Start accepts. Automaton has 1603 states and 2124 transitions. Word has length 463
[2025-02-07 22:56:14,006 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:56:14,006 INFO  L471      AbstractCegarLoop]: Abstraction has 1603 states and 2124 transitions.
[2025-02-07 22:56:14,006 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 87.2) internal successors, (436), 5 states have internal predecessors, (436), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-02-07 22:56:14,007 INFO  L276                IsEmpty]: Start isEmpty. Operand 1603 states and 2124 transitions.
[2025-02-07 22:56:14,009 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 465
[2025-02-07 22:56:14,009 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:56:14,009 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-07 22:56:14,009 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44
[2025-02-07 22:56:14,009 INFO  L396      AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:56:14,010 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:56:14,010 INFO  L85        PathProgramCache]: Analyzing trace with hash 804951193, now seen corresponding path program 1 times
[2025-02-07 22:56:14,010 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:56:14,010 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396583581]
[2025-02-07 22:56:14,010 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:56:14,010 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:56:14,087 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 464 statements into 1 equivalence classes.
[2025-02-07 22:56:14,184 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 464 of 464 statements.
[2025-02-07 22:56:14,184 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:56:14,184 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:56:14,598 INFO  L134       CoverageAnalysis]: Checked inductivity of 181 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked.
[2025-02-07 22:56:14,599 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:56:14,599 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396583581]
[2025-02-07 22:56:14,599 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396583581] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:56:14,599 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:56:14,599 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-07 22:56:14,599 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645531724]
[2025-02-07 22:56:14,599 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:56:14,600 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-07 22:56:14,600 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:56:14,600 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-07 22:56:14,600 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-07 22:56:14,600 INFO  L87              Difference]: Start difference. First operand 1603 states and 2124 transitions. Second operand  has 5 states, 5 states have (on average 87.4) internal successors, (437), 5 states have internal predecessors, (437), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-02-07 22:56:14,823 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:56:14,823 INFO  L93              Difference]: Finished difference Result 2676 states and 3582 transitions.
[2025-02-07 22:56:14,823 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-07 22:56:14,824 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 87.4) internal successors, (437), 5 states have internal predecessors, (437), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 464
[2025-02-07 22:56:14,824 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:56:14,826 INFO  L225             Difference]: With dead ends: 2676
[2025-02-07 22:56:14,826 INFO  L226             Difference]: Without dead ends: 1603
[2025-02-07 22:56:14,827 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-02-07 22:56:14,827 INFO  L435           NwaCegarLoop]: 600 mSDtfsCounter, 696 mSDsluCounter, 607 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 699 SdHoareTripleChecker+Valid, 1207 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-02-07 22:56:14,827 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [699 Valid, 1207 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-02-07 22:56:14,828 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1603 states.
[2025-02-07 22:56:14,842 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1603 to 1603.
[2025-02-07 22:56:14,843 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1603 states, 1591 states have (on average 1.3211816467630422) internal successors, (2102), 1591 states have internal predecessors, (2102), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10)
[2025-02-07 22:56:14,844 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1603 states to 1603 states and 2122 transitions.
[2025-02-07 22:56:14,845 INFO  L78                 Accepts]: Start accepts. Automaton has 1603 states and 2122 transitions. Word has length 464
[2025-02-07 22:56:14,845 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:56:14,845 INFO  L471      AbstractCegarLoop]: Abstraction has 1603 states and 2122 transitions.
[2025-02-07 22:56:14,845 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 87.4) internal successors, (437), 5 states have internal predecessors, (437), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-02-07 22:56:14,845 INFO  L276                IsEmpty]: Start isEmpty. Operand 1603 states and 2122 transitions.
[2025-02-07 22:56:14,848 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 466
[2025-02-07 22:56:14,848 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:56:14,848 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-07 22:56:14,848 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45
[2025-02-07 22:56:14,848 INFO  L396      AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:56:14,848 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:56:14,849 INFO  L85        PathProgramCache]: Analyzing trace with hash -193058848, now seen corresponding path program 1 times
[2025-02-07 22:56:14,849 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:56:14,849 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199365606]
[2025-02-07 22:56:14,849 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:56:14,849 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:56:14,918 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 465 statements into 1 equivalence classes.
[2025-02-07 22:56:15,014 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 465 of 465 statements.
[2025-02-07 22:56:15,015 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:56:15,015 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:56:15,498 INFO  L134       CoverageAnalysis]: Checked inductivity of 181 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked.
[2025-02-07 22:56:15,498 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:56:15,498 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199365606]
[2025-02-07 22:56:15,498 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199365606] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:56:15,498 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:56:15,498 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-07 22:56:15,498 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553066660]
[2025-02-07 22:56:15,498 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:56:15,499 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-07 22:56:15,499 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:56:15,499 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-07 22:56:15,499 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-07 22:56:15,500 INFO  L87              Difference]: Start difference. First operand 1603 states and 2122 transitions. Second operand  has 5 states, 5 states have (on average 87.6) internal successors, (438), 5 states have internal predecessors, (438), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-02-07 22:56:15,758 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:56:15,758 INFO  L93              Difference]: Finished difference Result 2676 states and 3578 transitions.
[2025-02-07 22:56:15,759 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-07 22:56:15,759 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 87.6) internal successors, (438), 5 states have internal predecessors, (438), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 465
[2025-02-07 22:56:15,759 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:56:15,762 INFO  L225             Difference]: With dead ends: 2676
[2025-02-07 22:56:15,762 INFO  L226             Difference]: Without dead ends: 1603
[2025-02-07 22:56:15,762 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-02-07 22:56:15,763 INFO  L435           NwaCegarLoop]: 600 mSDtfsCounter, 688 mSDsluCounter, 607 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 691 SdHoareTripleChecker+Valid, 1207 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-02-07 22:56:15,763 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [691 Valid, 1207 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-02-07 22:56:15,764 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1603 states.
[2025-02-07 22:56:15,785 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1603 to 1603.
[2025-02-07 22:56:15,786 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1603 states, 1591 states have (on average 1.3199245757385292) internal successors, (2100), 1591 states have internal predecessors, (2100), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10)
[2025-02-07 22:56:15,788 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1603 states to 1603 states and 2120 transitions.
[2025-02-07 22:56:15,788 INFO  L78                 Accepts]: Start accepts. Automaton has 1603 states and 2120 transitions. Word has length 465
[2025-02-07 22:56:15,788 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:56:15,788 INFO  L471      AbstractCegarLoop]: Abstraction has 1603 states and 2120 transitions.
[2025-02-07 22:56:15,788 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 87.6) internal successors, (438), 5 states have internal predecessors, (438), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-02-07 22:56:15,789 INFO  L276                IsEmpty]: Start isEmpty. Operand 1603 states and 2120 transitions.
[2025-02-07 22:56:15,792 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 467
[2025-02-07 22:56:15,792 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:56:15,792 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-07 22:56:15,793 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46
[2025-02-07 22:56:15,793 INFO  L396      AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:56:15,793 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:56:15,793 INFO  L85        PathProgramCache]: Analyzing trace with hash -1067709942, now seen corresponding path program 1 times
[2025-02-07 22:56:15,793 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:56:15,793 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309112116]
[2025-02-07 22:56:15,794 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:56:15,794 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:56:15,887 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 466 statements into 1 equivalence classes.
[2025-02-07 22:56:16,025 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 466 of 466 statements.
[2025-02-07 22:56:16,025 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:56:16,025 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:56:16,360 INFO  L134       CoverageAnalysis]: Checked inductivity of 181 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked.
[2025-02-07 22:56:16,361 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:56:16,361 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309112116]
[2025-02-07 22:56:16,361 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309112116] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:56:16,361 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:56:16,361 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-07 22:56:16,361 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709785932]
[2025-02-07 22:56:16,361 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:56:16,362 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-07 22:56:16,362 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:56:16,362 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-07 22:56:16,362 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-07 22:56:16,362 INFO  L87              Difference]: Start difference. First operand 1603 states and 2120 transitions. Second operand  has 5 states, 5 states have (on average 87.8) internal successors, (439), 5 states have internal predecessors, (439), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-02-07 22:56:16,590 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:56:16,590 INFO  L93              Difference]: Finished difference Result 2676 states and 3574 transitions.
[2025-02-07 22:56:16,590 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-07 22:56:16,591 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 87.8) internal successors, (439), 5 states have internal predecessors, (439), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 466
[2025-02-07 22:56:16,591 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:56:16,593 INFO  L225             Difference]: With dead ends: 2676
[2025-02-07 22:56:16,593 INFO  L226             Difference]: Without dead ends: 1603
[2025-02-07 22:56:16,594 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-02-07 22:56:16,594 INFO  L435           NwaCegarLoop]: 600 mSDtfsCounter, 1231 mSDsluCounter, 601 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1234 SdHoareTripleChecker+Valid, 1201 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-02-07 22:56:16,594 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1234 Valid, 1201 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-02-07 22:56:16,595 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1603 states.
[2025-02-07 22:56:16,607 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1603 to 1603.
[2025-02-07 22:56:16,608 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1603 states, 1591 states have (on average 1.3186675047140164) internal successors, (2098), 1591 states have internal predecessors, (2098), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10)
[2025-02-07 22:56:16,609 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1603 states to 1603 states and 2118 transitions.
[2025-02-07 22:56:16,610 INFO  L78                 Accepts]: Start accepts. Automaton has 1603 states and 2118 transitions. Word has length 466
[2025-02-07 22:56:16,610 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:56:16,610 INFO  L471      AbstractCegarLoop]: Abstraction has 1603 states and 2118 transitions.
[2025-02-07 22:56:16,610 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 87.8) internal successors, (439), 5 states have internal predecessors, (439), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-02-07 22:56:16,610 INFO  L276                IsEmpty]: Start isEmpty. Operand 1603 states and 2118 transitions.
[2025-02-07 22:56:16,612 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 468
[2025-02-07 22:56:16,612 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:56:16,613 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-07 22:56:16,613 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47
[2025-02-07 22:56:16,613 INFO  L396      AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:56:16,613 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:56:16,613 INFO  L85        PathProgramCache]: Analyzing trace with hash 558791281, now seen corresponding path program 1 times
[2025-02-07 22:56:16,613 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:56:16,613 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601134301]
[2025-02-07 22:56:16,614 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:56:16,614 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:56:16,684 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 467 statements into 1 equivalence classes.
[2025-02-07 22:56:16,839 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 467 of 467 statements.
[2025-02-07 22:56:16,839 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:56:16,839 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:56:17,155 INFO  L134       CoverageAnalysis]: Checked inductivity of 181 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked.
[2025-02-07 22:56:17,156 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:56:17,156 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601134301]
[2025-02-07 22:56:17,156 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601134301] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:56:17,156 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:56:17,156 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-07 22:56:17,156 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911884964]
[2025-02-07 22:56:17,156 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:56:17,157 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-07 22:56:17,157 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:56:17,157 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-07 22:56:17,157 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-07 22:56:17,157 INFO  L87              Difference]: Start difference. First operand 1603 states and 2118 transitions. Second operand  has 5 states, 5 states have (on average 88.0) internal successors, (440), 5 states have internal predecessors, (440), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-02-07 22:56:17,392 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:56:17,392 INFO  L93              Difference]: Finished difference Result 2676 states and 3570 transitions.
[2025-02-07 22:56:17,392 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-07 22:56:17,393 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 88.0) internal successors, (440), 5 states have internal predecessors, (440), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 467
[2025-02-07 22:56:17,393 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:56:17,395 INFO  L225             Difference]: With dead ends: 2676
[2025-02-07 22:56:17,395 INFO  L226             Difference]: Without dead ends: 1603
[2025-02-07 22:56:17,396 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-02-07 22:56:17,396 INFO  L435           NwaCegarLoop]: 600 mSDtfsCounter, 1215 mSDsluCounter, 601 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1218 SdHoareTripleChecker+Valid, 1201 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-02-07 22:56:17,396 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1218 Valid, 1201 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-02-07 22:56:17,397 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1603 states.
[2025-02-07 22:56:17,410 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1603 to 1603.
[2025-02-07 22:56:17,411 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1603 states, 1591 states have (on average 1.3174104336895034) internal successors, (2096), 1591 states have internal predecessors, (2096), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10)
[2025-02-07 22:56:17,412 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1603 states to 1603 states and 2116 transitions.
[2025-02-07 22:56:17,412 INFO  L78                 Accepts]: Start accepts. Automaton has 1603 states and 2116 transitions. Word has length 467
[2025-02-07 22:56:17,413 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:56:17,413 INFO  L471      AbstractCegarLoop]: Abstraction has 1603 states and 2116 transitions.
[2025-02-07 22:56:17,413 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 88.0) internal successors, (440), 5 states have internal predecessors, (440), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-02-07 22:56:17,413 INFO  L276                IsEmpty]: Start isEmpty. Operand 1603 states and 2116 transitions.
[2025-02-07 22:56:17,415 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 469
[2025-02-07 22:56:17,415 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:56:17,416 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-07 22:56:17,416 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48
[2025-02-07 22:56:17,416 INFO  L396      AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:56:17,416 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:56:17,416 INFO  L85        PathProgramCache]: Analyzing trace with hash 1038267643, now seen corresponding path program 1 times
[2025-02-07 22:56:17,416 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:56:17,416 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603909688]
[2025-02-07 22:56:17,416 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:56:17,416 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:56:17,486 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 468 statements into 1 equivalence classes.
[2025-02-07 22:56:17,587 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 468 of 468 statements.
[2025-02-07 22:56:17,588 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:56:17,588 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:56:17,927 INFO  L134       CoverageAnalysis]: Checked inductivity of 181 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked.
[2025-02-07 22:56:17,928 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:56:17,928 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603909688]
[2025-02-07 22:56:17,928 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603909688] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:56:17,928 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:56:17,928 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-07 22:56:17,928 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415114262]
[2025-02-07 22:56:17,928 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:56:17,928 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-07 22:56:17,928 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:56:17,929 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-07 22:56:17,929 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-07 22:56:17,929 INFO  L87              Difference]: Start difference. First operand 1603 states and 2116 transitions. Second operand  has 5 states, 5 states have (on average 88.2) internal successors, (441), 5 states have internal predecessors, (441), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-02-07 22:56:18,210 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:56:18,210 INFO  L93              Difference]: Finished difference Result 2676 states and 3566 transitions.
[2025-02-07 22:56:18,211 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-07 22:56:18,211 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 88.2) internal successors, (441), 5 states have internal predecessors, (441), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 468
[2025-02-07 22:56:18,211 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:56:18,213 INFO  L225             Difference]: With dead ends: 2676
[2025-02-07 22:56:18,213 INFO  L226             Difference]: Without dead ends: 1603
[2025-02-07 22:56:18,214 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-02-07 22:56:18,214 INFO  L435           NwaCegarLoop]: 600 mSDtfsCounter, 664 mSDsluCounter, 607 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 667 SdHoareTripleChecker+Valid, 1207 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-02-07 22:56:18,214 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [667 Valid, 1207 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-02-07 22:56:18,215 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1603 states.
[2025-02-07 22:56:18,227 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1603 to 1603.
[2025-02-07 22:56:18,228 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1603 states, 1591 states have (on average 1.3161533626649906) internal successors, (2094), 1591 states have internal predecessors, (2094), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10)
[2025-02-07 22:56:18,229 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1603 states to 1603 states and 2114 transitions.
[2025-02-07 22:56:18,229 INFO  L78                 Accepts]: Start accepts. Automaton has 1603 states and 2114 transitions. Word has length 468
[2025-02-07 22:56:18,229 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:56:18,230 INFO  L471      AbstractCegarLoop]: Abstraction has 1603 states and 2114 transitions.
[2025-02-07 22:56:18,230 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 88.2) internal successors, (441), 5 states have internal predecessors, (441), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-02-07 22:56:18,230 INFO  L276                IsEmpty]: Start isEmpty. Operand 1603 states and 2114 transitions.
[2025-02-07 22:56:18,232 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 470
[2025-02-07 22:56:18,232 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:56:18,232 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-07 22:56:18,232 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49
[2025-02-07 22:56:18,233 INFO  L396      AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:56:18,233 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:56:18,233 INFO  L85        PathProgramCache]: Analyzing trace with hash 421431938, now seen corresponding path program 1 times
[2025-02-07 22:56:18,233 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:56:18,233 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022518720]
[2025-02-07 22:56:18,233 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:56:18,233 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:56:18,304 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 469 statements into 1 equivalence classes.
[2025-02-07 22:56:18,409 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 469 of 469 statements.
[2025-02-07 22:56:18,409 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:56:18,409 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:56:18,753 INFO  L134       CoverageAnalysis]: Checked inductivity of 181 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked.
[2025-02-07 22:56:18,753 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:56:18,753 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022518720]
[2025-02-07 22:56:18,753 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022518720] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:56:18,753 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:56:18,753 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-07 22:56:18,753 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506587294]
[2025-02-07 22:56:18,753 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:56:18,754 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-07 22:56:18,754 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:56:18,755 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-07 22:56:18,756 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-07 22:56:18,756 INFO  L87              Difference]: Start difference. First operand 1603 states and 2114 transitions. Second operand  has 5 states, 5 states have (on average 88.4) internal successors, (442), 5 states have internal predecessors, (442), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-02-07 22:56:18,969 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:56:18,970 INFO  L93              Difference]: Finished difference Result 2676 states and 3562 transitions.
[2025-02-07 22:56:18,970 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-07 22:56:18,970 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 88.4) internal successors, (442), 5 states have internal predecessors, (442), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 469
[2025-02-07 22:56:18,971 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:56:18,973 INFO  L225             Difference]: With dead ends: 2676
[2025-02-07 22:56:18,974 INFO  L226             Difference]: Without dead ends: 1603
[2025-02-07 22:56:18,975 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-02-07 22:56:18,978 INFO  L435           NwaCegarLoop]: 616 mSDtfsCounter, 641 mSDsluCounter, 623 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 644 SdHoareTripleChecker+Valid, 1239 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-02-07 22:56:18,978 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [644 Valid, 1239 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-02-07 22:56:18,979 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1603 states.
[2025-02-07 22:56:18,993 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1603 to 1603.
[2025-02-07 22:56:18,994 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1603 states, 1591 states have (on average 1.3148962916404776) internal successors, (2092), 1591 states have internal predecessors, (2092), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10)
[2025-02-07 22:56:18,995 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1603 states to 1603 states and 2112 transitions.
[2025-02-07 22:56:18,995 INFO  L78                 Accepts]: Start accepts. Automaton has 1603 states and 2112 transitions. Word has length 469
[2025-02-07 22:56:18,995 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:56:18,996 INFO  L471      AbstractCegarLoop]: Abstraction has 1603 states and 2112 transitions.
[2025-02-07 22:56:18,996 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 88.4) internal successors, (442), 5 states have internal predecessors, (442), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-02-07 22:56:18,996 INFO  L276                IsEmpty]: Start isEmpty. Operand 1603 states and 2112 transitions.
[2025-02-07 22:56:18,999 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 471
[2025-02-07 22:56:18,999 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:56:18,999 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-07 22:56:18,999 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50
[2025-02-07 22:56:18,999 INFO  L396      AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:56:18,999 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:56:19,000 INFO  L85        PathProgramCache]: Analyzing trace with hash 1687016812, now seen corresponding path program 1 times
[2025-02-07 22:56:19,000 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:56:19,000 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043477770]
[2025-02-07 22:56:19,000 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:56:19,000 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:56:19,072 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 470 statements into 1 equivalence classes.
[2025-02-07 22:56:19,177 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 470 of 470 statements.
[2025-02-07 22:56:19,178 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:56:19,178 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:56:19,587 INFO  L134       CoverageAnalysis]: Checked inductivity of 181 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked.
[2025-02-07 22:56:19,587 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:56:19,587 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043477770]
[2025-02-07 22:56:19,587 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043477770] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:56:19,587 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:56:19,587 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-07 22:56:19,587 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091541920]
[2025-02-07 22:56:19,587 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:56:19,588 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-07 22:56:19,588 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:56:19,588 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-07 22:56:19,588 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-07 22:56:19,589 INFO  L87              Difference]: Start difference. First operand 1603 states and 2112 transitions. Second operand  has 5 states, 5 states have (on average 88.6) internal successors, (443), 5 states have internal predecessors, (443), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-02-07 22:56:19,804 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:56:19,804 INFO  L93              Difference]: Finished difference Result 2676 states and 3558 transitions.
[2025-02-07 22:56:19,805 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-07 22:56:19,805 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 88.6) internal successors, (443), 5 states have internal predecessors, (443), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 470
[2025-02-07 22:56:19,805 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:56:19,807 INFO  L225             Difference]: With dead ends: 2676
[2025-02-07 22:56:19,807 INFO  L226             Difference]: Without dead ends: 1603
[2025-02-07 22:56:19,808 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-02-07 22:56:19,809 INFO  L435           NwaCegarLoop]: 616 mSDtfsCounter, 633 mSDsluCounter, 623 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 636 SdHoareTripleChecker+Valid, 1239 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-02-07 22:56:19,809 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [636 Valid, 1239 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-02-07 22:56:19,809 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1603 states.
[2025-02-07 22:56:19,821 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1603 to 1603.
[2025-02-07 22:56:19,822 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1603 states, 1591 states have (on average 1.3136392206159648) internal successors, (2090), 1591 states have internal predecessors, (2090), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10)
[2025-02-07 22:56:19,823 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1603 states to 1603 states and 2110 transitions.
[2025-02-07 22:56:19,824 INFO  L78                 Accepts]: Start accepts. Automaton has 1603 states and 2110 transitions. Word has length 470
[2025-02-07 22:56:19,824 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:56:19,824 INFO  L471      AbstractCegarLoop]: Abstraction has 1603 states and 2110 transitions.
[2025-02-07 22:56:19,824 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 88.6) internal successors, (443), 5 states have internal predecessors, (443), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-02-07 22:56:19,824 INFO  L276                IsEmpty]: Start isEmpty. Operand 1603 states and 2110 transitions.
[2025-02-07 22:56:19,826 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 472
[2025-02-07 22:56:19,826 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:56:19,826 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-07 22:56:19,827 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51
[2025-02-07 22:56:19,827 INFO  L396      AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:56:19,827 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:56:19,827 INFO  L85        PathProgramCache]: Analyzing trace with hash 1357092883, now seen corresponding path program 1 times
[2025-02-07 22:56:19,827 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:56:19,827 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027184821]
[2025-02-07 22:56:19,827 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:56:19,827 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:56:19,898 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 471 statements into 1 equivalence classes.
[2025-02-07 22:56:20,001 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 471 of 471 statements.
[2025-02-07 22:56:20,002 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:56:20,002 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:56:20,349 INFO  L134       CoverageAnalysis]: Checked inductivity of 181 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked.
[2025-02-07 22:56:20,349 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:56:20,349 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027184821]
[2025-02-07 22:56:20,349 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027184821] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:56:20,349 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:56:20,349 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-07 22:56:20,349 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323118183]
[2025-02-07 22:56:20,349 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:56:20,350 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-07 22:56:20,350 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:56:20,350 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-07 22:56:20,350 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-07 22:56:20,351 INFO  L87              Difference]: Start difference. First operand 1603 states and 2110 transitions. Second operand  has 5 states, 5 states have (on average 88.8) internal successors, (444), 5 states have internal predecessors, (444), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-02-07 22:56:20,570 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:56:20,570 INFO  L93              Difference]: Finished difference Result 2676 states and 3554 transitions.
[2025-02-07 22:56:20,571 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-07 22:56:20,571 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 88.8) internal successors, (444), 5 states have internal predecessors, (444), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 471
[2025-02-07 22:56:20,571 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:56:20,574 INFO  L225             Difference]: With dead ends: 2676
[2025-02-07 22:56:20,574 INFO  L226             Difference]: Without dead ends: 1603
[2025-02-07 22:56:20,575 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-02-07 22:56:20,575 INFO  L435           NwaCegarLoop]: 616 mSDtfsCounter, 625 mSDsluCounter, 623 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 628 SdHoareTripleChecker+Valid, 1239 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-02-07 22:56:20,575 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [628 Valid, 1239 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-02-07 22:56:20,576 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1603 states.
[2025-02-07 22:56:20,590 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1603 to 1603.
[2025-02-07 22:56:20,591 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1603 states, 1591 states have (on average 1.3123821495914518) internal successors, (2088), 1591 states have internal predecessors, (2088), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10)
[2025-02-07 22:56:20,592 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1603 states to 1603 states and 2108 transitions.
[2025-02-07 22:56:20,593 INFO  L78                 Accepts]: Start accepts. Automaton has 1603 states and 2108 transitions. Word has length 471
[2025-02-07 22:56:20,593 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:56:20,593 INFO  L471      AbstractCegarLoop]: Abstraction has 1603 states and 2108 transitions.
[2025-02-07 22:56:20,593 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 88.8) internal successors, (444), 5 states have internal predecessors, (444), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-02-07 22:56:20,593 INFO  L276                IsEmpty]: Start isEmpty. Operand 1603 states and 2108 transitions.
[2025-02-07 22:56:20,596 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 473
[2025-02-07 22:56:20,596 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:56:20,596 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-07 22:56:20,596 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52
[2025-02-07 22:56:20,596 INFO  L396      AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:56:20,596 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:56:20,597 INFO  L85        PathProgramCache]: Analyzing trace with hash -226710691, now seen corresponding path program 1 times
[2025-02-07 22:56:20,597 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:56:20,597 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042394240]
[2025-02-07 22:56:20,597 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:56:20,597 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:56:20,673 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 472 statements into 1 equivalence classes.
[2025-02-07 22:56:20,866 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 472 of 472 statements.
[2025-02-07 22:56:20,866 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:56:20,866 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:56:21,381 INFO  L134       CoverageAnalysis]: Checked inductivity of 181 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked.
[2025-02-07 22:56:21,381 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:56:21,381 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042394240]
[2025-02-07 22:56:21,381 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042394240] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:56:21,381 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:56:21,381 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-07 22:56:21,382 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888107766]
[2025-02-07 22:56:21,382 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:56:21,382 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-07 22:56:21,382 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:56:21,383 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-07 22:56:21,383 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-07 22:56:21,383 INFO  L87              Difference]: Start difference. First operand 1603 states and 2108 transitions. Second operand  has 5 states, 5 states have (on average 89.0) internal successors, (445), 5 states have internal predecessors, (445), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-02-07 22:56:21,619 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:56:21,619 INFO  L93              Difference]: Finished difference Result 2676 states and 3550 transitions.
[2025-02-07 22:56:21,620 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-07 22:56:21,620 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 89.0) internal successors, (445), 5 states have internal predecessors, (445), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 472
[2025-02-07 22:56:21,620 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:56:21,622 INFO  L225             Difference]: With dead ends: 2676
[2025-02-07 22:56:21,622 INFO  L226             Difference]: Without dead ends: 1603
[2025-02-07 22:56:21,623 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-02-07 22:56:21,623 INFO  L435           NwaCegarLoop]: 616 mSDtfsCounter, 617 mSDsluCounter, 623 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 620 SdHoareTripleChecker+Valid, 1239 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-02-07 22:56:21,623 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [620 Valid, 1239 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-02-07 22:56:21,624 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1603 states.
[2025-02-07 22:56:21,647 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1603 to 1603.
[2025-02-07 22:56:21,648 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1603 states, 1591 states have (on average 1.311125078566939) internal successors, (2086), 1591 states have internal predecessors, (2086), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10)
[2025-02-07 22:56:21,650 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1603 states to 1603 states and 2106 transitions.
[2025-02-07 22:56:21,650 INFO  L78                 Accepts]: Start accepts. Automaton has 1603 states and 2106 transitions. Word has length 472
[2025-02-07 22:56:21,650 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:56:21,650 INFO  L471      AbstractCegarLoop]: Abstraction has 1603 states and 2106 transitions.
[2025-02-07 22:56:21,651 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 89.0) internal successors, (445), 5 states have internal predecessors, (445), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-02-07 22:56:21,651 INFO  L276                IsEmpty]: Start isEmpty. Operand 1603 states and 2106 transitions.
[2025-02-07 22:56:21,655 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 474
[2025-02-07 22:56:21,655 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:56:21,655 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-07 22:56:21,655 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53
[2025-02-07 22:56:21,655 INFO  L396      AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:56:21,655 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:56:21,656 INFO  L85        PathProgramCache]: Analyzing trace with hash 1311957796, now seen corresponding path program 1 times
[2025-02-07 22:56:21,656 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:56:21,656 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108836466]
[2025-02-07 22:56:21,656 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:56:21,656 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:56:21,784 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 473 statements into 1 equivalence classes.
[2025-02-07 22:56:21,945 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 473 of 473 statements.
[2025-02-07 22:56:21,946 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:56:21,946 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:56:22,358 INFO  L134       CoverageAnalysis]: Checked inductivity of 181 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked.
[2025-02-07 22:56:22,359 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:56:22,359 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108836466]
[2025-02-07 22:56:22,359 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108836466] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:56:22,359 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:56:22,359 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-07 22:56:22,359 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005897828]
[2025-02-07 22:56:22,359 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:56:22,360 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-07 22:56:22,360 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:56:22,360 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-07 22:56:22,360 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-07 22:56:22,360 INFO  L87              Difference]: Start difference. First operand 1603 states and 2106 transitions. Second operand  has 5 states, 5 states have (on average 89.2) internal successors, (446), 5 states have internal predecessors, (446), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-02-07 22:56:22,551 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:56:22,551 INFO  L93              Difference]: Finished difference Result 2676 states and 3546 transitions.
[2025-02-07 22:56:22,552 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-07 22:56:22,552 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 89.2) internal successors, (446), 5 states have internal predecessors, (446), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 473
[2025-02-07 22:56:22,552 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:56:22,558 INFO  L225             Difference]: With dead ends: 2676
[2025-02-07 22:56:22,558 INFO  L226             Difference]: Without dead ends: 1603
[2025-02-07 22:56:22,559 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-02-07 22:56:22,559 INFO  L435           NwaCegarLoop]: 624 mSDtfsCounter, 1097 mSDsluCounter, 625 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1100 SdHoareTripleChecker+Valid, 1249 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-02-07 22:56:22,563 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1100 Valid, 1249 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-02-07 22:56:22,565 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1603 states.
[2025-02-07 22:56:22,591 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1603 to 1603.
[2025-02-07 22:56:22,596 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1603 states, 1591 states have (on average 1.309868007542426) internal successors, (2084), 1591 states have internal predecessors, (2084), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10)
[2025-02-07 22:56:22,598 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1603 states to 1603 states and 2104 transitions.
[2025-02-07 22:56:22,602 INFO  L78                 Accepts]: Start accepts. Automaton has 1603 states and 2104 transitions. Word has length 473
[2025-02-07 22:56:22,602 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:56:22,602 INFO  L471      AbstractCegarLoop]: Abstraction has 1603 states and 2104 transitions.
[2025-02-07 22:56:22,602 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 89.2) internal successors, (446), 5 states have internal predecessors, (446), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-02-07 22:56:22,602 INFO  L276                IsEmpty]: Start isEmpty. Operand 1603 states and 2104 transitions.
[2025-02-07 22:56:22,605 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 475
[2025-02-07 22:56:22,608 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:56:22,609 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-07 22:56:22,609 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54
[2025-02-07 22:56:22,609 INFO  L396      AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:56:22,609 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:56:22,610 INFO  L85        PathProgramCache]: Analyzing trace with hash -2014415154, now seen corresponding path program 1 times
[2025-02-07 22:56:22,610 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:56:22,610 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013397375]
[2025-02-07 22:56:22,610 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:56:22,610 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:56:22,750 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 474 statements into 1 equivalence classes.
[2025-02-07 22:56:22,987 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 474 of 474 statements.
[2025-02-07 22:56:22,990 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:56:22,990 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:56:23,476 INFO  L134       CoverageAnalysis]: Checked inductivity of 181 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked.
[2025-02-07 22:56:23,477 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:56:23,477 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013397375]
[2025-02-07 22:56:23,477 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013397375] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:56:23,477 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:56:23,477 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-07 22:56:23,477 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112851866]
[2025-02-07 22:56:23,477 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:56:23,478 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-07 22:56:23,478 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:56:23,478 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-07 22:56:23,479 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-07 22:56:23,479 INFO  L87              Difference]: Start difference. First operand 1603 states and 2104 transitions. Second operand  has 5 states, 5 states have (on average 89.4) internal successors, (447), 5 states have internal predecessors, (447), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-02-07 22:56:23,651 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:56:23,651 INFO  L93              Difference]: Finished difference Result 2676 states and 3542 transitions.
[2025-02-07 22:56:23,651 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-07 22:56:23,652 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 89.4) internal successors, (447), 5 states have internal predecessors, (447), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 474
[2025-02-07 22:56:23,652 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:56:23,654 INFO  L225             Difference]: With dead ends: 2676
[2025-02-07 22:56:23,654 INFO  L226             Difference]: Without dead ends: 1603
[2025-02-07 22:56:23,655 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-02-07 22:56:23,655 INFO  L435           NwaCegarLoop]: 624 mSDtfsCounter, 1081 mSDsluCounter, 625 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1084 SdHoareTripleChecker+Valid, 1249 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-02-07 22:56:23,655 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1084 Valid, 1249 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-02-07 22:56:23,656 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1603 states.
[2025-02-07 22:56:23,670 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1603 to 1603.
[2025-02-07 22:56:23,671 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1603 states, 1591 states have (on average 1.3086109365179133) internal successors, (2082), 1591 states have internal predecessors, (2082), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10)
[2025-02-07 22:56:23,672 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1603 states to 1603 states and 2102 transitions.
[2025-02-07 22:56:23,672 INFO  L78                 Accepts]: Start accepts. Automaton has 1603 states and 2102 transitions. Word has length 474
[2025-02-07 22:56:23,672 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:56:23,672 INFO  L471      AbstractCegarLoop]: Abstraction has 1603 states and 2102 transitions.
[2025-02-07 22:56:23,673 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 89.4) internal successors, (447), 5 states have internal predecessors, (447), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-02-07 22:56:23,673 INFO  L276                IsEmpty]: Start isEmpty. Operand 1603 states and 2102 transitions.
[2025-02-07 22:56:23,675 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 476
[2025-02-07 22:56:23,675 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:56:23,675 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-07 22:56:23,676 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55
[2025-02-07 22:56:23,676 INFO  L396      AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:56:23,676 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:56:23,676 INFO  L85        PathProgramCache]: Analyzing trace with hash -415126603, now seen corresponding path program 1 times
[2025-02-07 22:56:23,676 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:56:23,676 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623167759]
[2025-02-07 22:56:23,676 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:56:23,676 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:56:23,748 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 475 statements into 1 equivalence classes.
[2025-02-07 22:56:23,863 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 475 of 475 statements.
[2025-02-07 22:56:23,863 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:56:23,863 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:56:24,305 INFO  L134       CoverageAnalysis]: Checked inductivity of 181 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked.
[2025-02-07 22:56:24,305 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:56:24,305 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623167759]
[2025-02-07 22:56:24,305 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623167759] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:56:24,305 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:56:24,305 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-07 22:56:24,305 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067793025]
[2025-02-07 22:56:24,305 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:56:24,306 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-07 22:56:24,306 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:56:24,306 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-07 22:56:24,306 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-07 22:56:24,307 INFO  L87              Difference]: Start difference. First operand 1603 states and 2102 transitions. Second operand  has 5 states, 5 states have (on average 89.6) internal successors, (448), 5 states have internal predecessors, (448), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-02-07 22:56:24,603 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:56:24,603 INFO  L93              Difference]: Finished difference Result 2676 states and 3538 transitions.
[2025-02-07 22:56:24,603 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-07 22:56:24,603 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 89.6) internal successors, (448), 5 states have internal predecessors, (448), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 475
[2025-02-07 22:56:24,603 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:56:24,605 INFO  L225             Difference]: With dead ends: 2676
[2025-02-07 22:56:24,605 INFO  L226             Difference]: Without dead ends: 1603
[2025-02-07 22:56:24,606 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-02-07 22:56:24,606 INFO  L435           NwaCegarLoop]: 479 mSDtfsCounter, 1015 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 582 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1015 SdHoareTripleChecker+Valid, 959 SdHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-02-07 22:56:24,606 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1015 Valid, 959 Invalid, 583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 582 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-02-07 22:56:24,607 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1603 states.
[2025-02-07 22:56:24,619 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1603 to 1603.
[2025-02-07 22:56:24,620 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1603 states, 1591 states have (on average 1.3073538654934003) internal successors, (2080), 1591 states have internal predecessors, (2080), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10)
[2025-02-07 22:56:24,622 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1603 states to 1603 states and 2100 transitions.
[2025-02-07 22:56:24,622 INFO  L78                 Accepts]: Start accepts. Automaton has 1603 states and 2100 transitions. Word has length 475
[2025-02-07 22:56:24,622 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:56:24,622 INFO  L471      AbstractCegarLoop]: Abstraction has 1603 states and 2100 transitions.
[2025-02-07 22:56:24,622 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 89.6) internal successors, (448), 5 states have internal predecessors, (448), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-02-07 22:56:24,622 INFO  L276                IsEmpty]: Start isEmpty. Operand 1603 states and 2100 transitions.
[2025-02-07 22:56:24,625 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 477
[2025-02-07 22:56:24,625 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:56:24,625 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-07 22:56:24,625 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56
[2025-02-07 22:56:24,625 INFO  L396      AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:56:24,625 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:56:24,626 INFO  L85        PathProgramCache]: Analyzing trace with hash -2025687105, now seen corresponding path program 1 times
[2025-02-07 22:56:24,626 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:56:24,626 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864718958]
[2025-02-07 22:56:24,626 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:56:24,626 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:56:24,695 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 476 statements into 1 equivalence classes.
[2025-02-07 22:56:25,153 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 476 of 476 statements.
[2025-02-07 22:56:25,153 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:56:25,153 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:56:25,684 INFO  L134       CoverageAnalysis]: Checked inductivity of 181 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked.
[2025-02-07 22:56:25,684 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:56:25,684 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864718958]
[2025-02-07 22:56:25,684 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864718958] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:56:25,684 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:56:25,684 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-07 22:56:25,684 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046362499]
[2025-02-07 22:56:25,684 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:56:25,685 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-07 22:56:25,685 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:56:25,685 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-07 22:56:25,685 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-07 22:56:25,685 INFO  L87              Difference]: Start difference. First operand 1603 states and 2100 transitions. Second operand  has 5 states, 5 states have (on average 89.8) internal successors, (449), 5 states have internal predecessors, (449), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-02-07 22:56:25,880 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:56:25,880 INFO  L93              Difference]: Finished difference Result 2676 states and 3534 transitions.
[2025-02-07 22:56:25,880 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-07 22:56:25,880 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 89.8) internal successors, (449), 5 states have internal predecessors, (449), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 476
[2025-02-07 22:56:25,881 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:56:25,882 INFO  L225             Difference]: With dead ends: 2676
[2025-02-07 22:56:25,882 INFO  L226             Difference]: Without dead ends: 1603
[2025-02-07 22:56:25,883 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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-02-07 22:56:25,883 INFO  L435           NwaCegarLoop]: 623 mSDtfsCounter, 654 mSDsluCounter, 630 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 654 SdHoareTripleChecker+Valid, 1253 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-02-07 22:56:25,884 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [654 Valid, 1253 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-02-07 22:56:25,885 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1603 states.
[2025-02-07 22:56:25,897 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1603 to 1603.
[2025-02-07 22:56:25,898 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1603 states, 1591 states have (on average 1.3060967944688875) internal successors, (2078), 1591 states have internal predecessors, (2078), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10)
[2025-02-07 22:56:25,900 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1603 states to 1603 states and 2098 transitions.
[2025-02-07 22:56:25,900 INFO  L78                 Accepts]: Start accepts. Automaton has 1603 states and 2098 transitions. Word has length 476
[2025-02-07 22:56:25,900 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:56:25,900 INFO  L471      AbstractCegarLoop]: Abstraction has 1603 states and 2098 transitions.
[2025-02-07 22:56:25,901 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 89.8) internal successors, (449), 5 states have internal predecessors, (449), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-02-07 22:56:25,901 INFO  L276                IsEmpty]: Start isEmpty. Operand 1603 states and 2098 transitions.
[2025-02-07 22:56:25,903 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 478
[2025-02-07 22:56:25,903 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:56:25,903 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-07 22:56:25,903 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57
[2025-02-07 22:56:25,904 INFO  L396      AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:56:25,904 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:56:25,904 INFO  L85        PathProgramCache]: Analyzing trace with hash -1796280268, now seen corresponding path program 1 times
[2025-02-07 22:56:25,904 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:56:25,904 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603472647]
[2025-02-07 22:56:25,904 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:56:25,904 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:56:25,989 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 477 statements into 1 equivalence classes.
[2025-02-07 22:56:26,453 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 477 of 477 statements.
[2025-02-07 22:56:26,454 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:56:26,454 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:56:26,992 INFO  L134       CoverageAnalysis]: Checked inductivity of 181 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked.
[2025-02-07 22:56:26,992 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:56:26,993 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603472647]
[2025-02-07 22:56:26,993 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603472647] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:56:26,993 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:56:26,993 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-07 22:56:26,993 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866497933]
[2025-02-07 22:56:26,993 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:56:26,993 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-07 22:56:26,993 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:56:26,994 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-07 22:56:26,994 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-07 22:56:26,994 INFO  L87              Difference]: Start difference. First operand 1603 states and 2098 transitions. Second operand  has 5 states, 5 states have (on average 90.0) internal successors, (450), 5 states have internal predecessors, (450), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-02-07 22:56:27,234 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:56:27,234 INFO  L93              Difference]: Finished difference Result 2676 states and 3530 transitions.
[2025-02-07 22:56:27,235 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-07 22:56:27,235 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 90.0) internal successors, (450), 5 states have internal predecessors, (450), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 477
[2025-02-07 22:56:27,235 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:56:27,236 INFO  L225             Difference]: With dead ends: 2676
[2025-02-07 22:56:27,236 INFO  L226             Difference]: Without dead ends: 1603
[2025-02-07 22:56:27,237 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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-02-07 22:56:27,238 INFO  L435           NwaCegarLoop]: 612 mSDtfsCounter, 646 mSDsluCounter, 619 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 646 SdHoareTripleChecker+Valid, 1231 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-02-07 22:56:27,238 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [646 Valid, 1231 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-02-07 22:56:27,238 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1603 states.
[2025-02-07 22:56:27,252 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1603 to 1603.
[2025-02-07 22:56:27,253 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1603 states, 1591 states have (on average 1.3048397234443747) internal successors, (2076), 1591 states have internal predecessors, (2076), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10)
[2025-02-07 22:56:27,254 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1603 states to 1603 states and 2096 transitions.
[2025-02-07 22:56:27,254 INFO  L78                 Accepts]: Start accepts. Automaton has 1603 states and 2096 transitions. Word has length 477
[2025-02-07 22:56:27,254 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:56:27,254 INFO  L471      AbstractCegarLoop]: Abstraction has 1603 states and 2096 transitions.
[2025-02-07 22:56:27,255 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 90.0) internal successors, (450), 5 states have internal predecessors, (450), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-02-07 22:56:27,255 INFO  L276                IsEmpty]: Start isEmpty. Operand 1603 states and 2096 transitions.
[2025-02-07 22:56:27,257 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 479
[2025-02-07 22:56:27,257 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:56:27,257 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-07 22:56:27,257 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58
[2025-02-07 22:56:27,257 INFO  L396      AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:56:27,258 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:56:27,258 INFO  L85        PathProgramCache]: Analyzing trace with hash -2114020608, now seen corresponding path program 1 times
[2025-02-07 22:56:27,258 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:56:27,258 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315881971]
[2025-02-07 22:56:27,258 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:56:27,258 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:56:27,334 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 478 statements into 1 equivalence classes.
[2025-02-07 22:56:27,759 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 478 of 478 statements.
[2025-02-07 22:56:27,759 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:56:27,759 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:56:28,258 INFO  L134       CoverageAnalysis]: Checked inductivity of 181 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked.
[2025-02-07 22:56:28,259 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:56:28,259 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315881971]
[2025-02-07 22:56:28,259 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315881971] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:56:28,259 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:56:28,259 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-07 22:56:28,259 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756678859]
[2025-02-07 22:56:28,259 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:56:28,260 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-07 22:56:28,260 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:56:28,260 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-07 22:56:28,260 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-07 22:56:28,260 INFO  L87              Difference]: Start difference. First operand 1603 states and 2096 transitions. Second operand  has 5 states, 5 states have (on average 90.2) internal successors, (451), 5 states have internal predecessors, (451), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-02-07 22:56:28,495 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:56:28,495 INFO  L93              Difference]: Finished difference Result 2676 states and 3526 transitions.
[2025-02-07 22:56:28,496 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-07 22:56:28,496 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 90.2) internal successors, (451), 5 states have internal predecessors, (451), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 478
[2025-02-07 22:56:28,496 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:56:28,497 INFO  L225             Difference]: With dead ends: 2676
[2025-02-07 22:56:28,497 INFO  L226             Difference]: Without dead ends: 1603
[2025-02-07 22:56:28,498 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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-02-07 22:56:28,499 INFO  L435           NwaCegarLoop]: 612 mSDtfsCounter, 1148 mSDsluCounter, 613 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1148 SdHoareTripleChecker+Valid, 1225 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-02-07 22:56:28,499 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1148 Valid, 1225 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-02-07 22:56:28,499 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1603 states.
[2025-02-07 22:56:28,512 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1603 to 1603.
[2025-02-07 22:56:28,513 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1603 states, 1591 states have (on average 1.3035826524198617) internal successors, (2074), 1591 states have internal predecessors, (2074), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10)
[2025-02-07 22:56:28,514 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1603 states to 1603 states and 2094 transitions.
[2025-02-07 22:56:28,514 INFO  L78                 Accepts]: Start accepts. Automaton has 1603 states and 2094 transitions. Word has length 478
[2025-02-07 22:56:28,514 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:56:28,514 INFO  L471      AbstractCegarLoop]: Abstraction has 1603 states and 2094 transitions.
[2025-02-07 22:56:28,514 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 90.2) internal successors, (451), 5 states have internal predecessors, (451), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-02-07 22:56:28,514 INFO  L276                IsEmpty]: Start isEmpty. Operand 1603 states and 2094 transitions.
[2025-02-07 22:56:28,517 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 480
[2025-02-07 22:56:28,517 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:56:28,517 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-07 22:56:28,517 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59
[2025-02-07 22:56:28,517 INFO  L396      AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:56:28,518 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:56:28,518 INFO  L85        PathProgramCache]: Analyzing trace with hash -1554872803, now seen corresponding path program 1 times
[2025-02-07 22:56:28,518 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:56:28,518 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535565240]
[2025-02-07 22:56:28,518 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:56:28,518 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:56:28,645 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 479 statements into 1 equivalence classes.
[2025-02-07 22:56:29,226 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 479 of 479 statements.
[2025-02-07 22:56:29,226 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:56:29,226 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:56:29,832 INFO  L134       CoverageAnalysis]: Checked inductivity of 181 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked.
[2025-02-07 22:56:29,832 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:56:29,832 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535565240]
[2025-02-07 22:56:29,832 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535565240] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:56:29,832 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:56:29,832 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-07 22:56:29,832 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129572438]
[2025-02-07 22:56:29,832 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:56:29,833 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-07 22:56:29,833 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:56:29,833 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-07 22:56:29,833 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-07 22:56:29,834 INFO  L87              Difference]: Start difference. First operand 1603 states and 2094 transitions. Second operand  has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-02-07 22:56:30,057 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:56:30,057 INFO  L93              Difference]: Finished difference Result 2676 states and 3522 transitions.
[2025-02-07 22:56:30,057 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-07 22:56:30,057 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 479
[2025-02-07 22:56:30,058 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:56:30,059 INFO  L225             Difference]: With dead ends: 2676
[2025-02-07 22:56:30,059 INFO  L226             Difference]: Without dead ends: 1603
[2025-02-07 22:56:30,060 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-02-07 22:56:30,060 INFO  L435           NwaCegarLoop]: 612 mSDtfsCounter, 495 mSDsluCounter, 613 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 495 SdHoareTripleChecker+Valid, 1225 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-02-07 22:56:30,060 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [495 Valid, 1225 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-02-07 22:56:30,061 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1603 states.
[2025-02-07 22:56:30,073 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1603 to 1603.
[2025-02-07 22:56:30,074 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1603 states, 1591 states have (on average 1.302325581395349) internal successors, (2072), 1591 states have internal predecessors, (2072), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10)
[2025-02-07 22:56:30,075 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1603 states to 1603 states and 2092 transitions.
[2025-02-07 22:56:30,075 INFO  L78                 Accepts]: Start accepts. Automaton has 1603 states and 2092 transitions. Word has length 479
[2025-02-07 22:56:30,075 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:56:30,075 INFO  L471      AbstractCegarLoop]: Abstraction has 1603 states and 2092 transitions.
[2025-02-07 22:56:30,075 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-02-07 22:56:30,075 INFO  L276                IsEmpty]: Start isEmpty. Operand 1603 states and 2092 transitions.
[2025-02-07 22:56:30,078 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 481
[2025-02-07 22:56:30,078 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:56:30,078 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-07 22:56:30,078 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60
[2025-02-07 22:56:30,078 INFO  L396      AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:56:30,078 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:56:30,079 INFO  L85        PathProgramCache]: Analyzing trace with hash 212816851, now seen corresponding path program 1 times
[2025-02-07 22:56:30,079 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:56:30,079 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419796885]
[2025-02-07 22:56:30,079 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:56:30,079 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:56:30,152 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 480 statements into 1 equivalence classes.
[2025-02-07 22:56:30,634 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 480 of 480 statements.
[2025-02-07 22:56:30,634 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:56:30,634 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:56:31,189 INFO  L134       CoverageAnalysis]: Checked inductivity of 181 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked.
[2025-02-07 22:56:31,189 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:56:31,189 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419796885]
[2025-02-07 22:56:31,189 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419796885] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:56:31,189 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:56:31,189 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-07 22:56:31,189 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968638247]
[2025-02-07 22:56:31,190 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:56:31,190 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-07 22:56:31,190 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:56:31,190 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-07 22:56:31,190 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-07 22:56:31,190 INFO  L87              Difference]: Start difference. First operand 1603 states and 2092 transitions. Second operand  has 5 states, 5 states have (on average 90.6) internal successors, (453), 5 states have internal predecessors, (453), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-02-07 22:56:31,460 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:56:31,460 INFO  L93              Difference]: Finished difference Result 2676 states and 3518 transitions.
[2025-02-07 22:56:31,461 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-07 22:56:31,461 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 90.6) internal successors, (453), 5 states have internal predecessors, (453), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 480
[2025-02-07 22:56:31,461 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:56:31,462 INFO  L225             Difference]: With dead ends: 2676
[2025-02-07 22:56:31,462 INFO  L226             Difference]: Without dead ends: 1603
[2025-02-07 22:56:31,463 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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-02-07 22:56:31,463 INFO  L435           NwaCegarLoop]: 589 mSDtfsCounter, 1193 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1193 SdHoareTripleChecker+Valid, 1179 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-02-07 22:56:31,463 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1193 Valid, 1179 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-02-07 22:56:31,464 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1603 states.
[2025-02-07 22:56:31,476 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1603 to 1603.
[2025-02-07 22:56:31,477 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1603 states, 1591 states have (on average 1.301068510370836) internal successors, (2070), 1591 states have internal predecessors, (2070), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10)
[2025-02-07 22:56:31,478 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1603 states to 1603 states and 2090 transitions.
[2025-02-07 22:56:31,478 INFO  L78                 Accepts]: Start accepts. Automaton has 1603 states and 2090 transitions. Word has length 480
[2025-02-07 22:56:31,479 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:56:31,479 INFO  L471      AbstractCegarLoop]: Abstraction has 1603 states and 2090 transitions.
[2025-02-07 22:56:31,479 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 90.6) internal successors, (453), 5 states have internal predecessors, (453), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-02-07 22:56:31,479 INFO  L276                IsEmpty]: Start isEmpty. Operand 1603 states and 2090 transitions.
[2025-02-07 22:56:31,481 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 482
[2025-02-07 22:56:31,481 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:56:31,481 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-07 22:56:31,482 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61
[2025-02-07 22:56:31,482 INFO  L396      AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:56:31,482 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:56:31,482 INFO  L85        PathProgramCache]: Analyzing trace with hash 1793931418, now seen corresponding path program 1 times
[2025-02-07 22:56:31,482 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:56:31,482 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174499412]
[2025-02-07 22:56:31,482 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:56:31,482 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:56:31,557 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 481 statements into 1 equivalence classes.
[2025-02-07 22:56:31,974 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 481 of 481 statements.
[2025-02-07 22:56:31,975 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:56:31,975 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:56:32,463 INFO  L134       CoverageAnalysis]: Checked inductivity of 181 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked.
[2025-02-07 22:56:32,463 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:56:32,463 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174499412]
[2025-02-07 22:56:32,463 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174499412] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:56:32,463 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:56:32,463 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-07 22:56:32,463 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944943865]
[2025-02-07 22:56:32,463 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:56:32,464 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-07 22:56:32,464 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:56:32,464 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-07 22:56:32,464 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-07 22:56:32,465 INFO  L87              Difference]: Start difference. First operand 1603 states and 2090 transitions. Second operand  has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-02-07 22:56:32,729 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:56:32,729 INFO  L93              Difference]: Finished difference Result 2676 states and 3514 transitions.
[2025-02-07 22:56:32,729 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-07 22:56:32,729 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 481
[2025-02-07 22:56:32,730 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:56:32,731 INFO  L225             Difference]: With dead ends: 2676
[2025-02-07 22:56:32,731 INFO  L226             Difference]: Without dead ends: 1603
[2025-02-07 22:56:32,732 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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-02-07 22:56:32,732 INFO  L435           NwaCegarLoop]: 589 mSDtfsCounter, 627 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 627 SdHoareTripleChecker+Valid, 1185 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-02-07 22:56:32,732 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [627 Valid, 1185 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-02-07 22:56:32,733 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1603 states.
[2025-02-07 22:56:32,745 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1603 to 1603.
[2025-02-07 22:56:32,746 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1603 states, 1591 states have (on average 1.2998114393463231) internal successors, (2068), 1591 states have internal predecessors, (2068), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10)
[2025-02-07 22:56:32,747 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1603 states to 1603 states and 2088 transitions.
[2025-02-07 22:56:32,747 INFO  L78                 Accepts]: Start accepts. Automaton has 1603 states and 2088 transitions. Word has length 481
[2025-02-07 22:56:32,748 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:56:32,748 INFO  L471      AbstractCegarLoop]: Abstraction has 1603 states and 2088 transitions.
[2025-02-07 22:56:32,748 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-02-07 22:56:32,748 INFO  L276                IsEmpty]: Start isEmpty. Operand 1603 states and 2088 transitions.
[2025-02-07 22:56:32,750 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 483
[2025-02-07 22:56:32,750 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:56:32,751 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-07 22:56:32,751 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62
[2025-02-07 22:56:32,751 INFO  L396      AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:56:32,751 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:56:32,751 INFO  L85        PathProgramCache]: Analyzing trace with hash -535015382, now seen corresponding path program 1 times
[2025-02-07 22:56:32,751 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:56:32,751 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269390558]
[2025-02-07 22:56:32,751 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:56:32,752 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:56:32,826 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 482 statements into 1 equivalence classes.
[2025-02-07 22:56:33,286 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 482 of 482 statements.
[2025-02-07 22:56:33,287 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:56:33,287 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:56:33,850 INFO  L134       CoverageAnalysis]: Checked inductivity of 181 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked.
[2025-02-07 22:56:33,850 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:56:33,850 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269390558]
[2025-02-07 22:56:33,851 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269390558] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:56:33,851 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:56:33,851 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-07 22:56:33,851 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675825310]
[2025-02-07 22:56:33,851 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:56:33,851 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-07 22:56:33,851 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:56:33,852 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-07 22:56:33,852 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-07 22:56:33,852 INFO  L87              Difference]: Start difference. First operand 1603 states and 2088 transitions. Second operand  has 4 states, 4 states have (on average 113.75) internal successors, (455), 4 states have internal predecessors, (455), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-02-07 22:56:34,070 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:56:34,070 INFO  L93              Difference]: Finished difference Result 2676 states and 3510 transitions.
[2025-02-07 22:56:34,070 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-07 22:56:34,070 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 113.75) internal successors, (455), 4 states have internal predecessors, (455), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 482
[2025-02-07 22:56:34,071 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:56:34,072 INFO  L225             Difference]: With dead ends: 2676
[2025-02-07 22:56:34,072 INFO  L226             Difference]: Without dead ends: 1603
[2025-02-07 22:56:34,073 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-02-07 22:56:34,073 INFO  L435           NwaCegarLoop]: 589 mSDtfsCounter, 548 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 548 SdHoareTripleChecker+Valid, 1179 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-02-07 22:56:34,073 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [548 Valid, 1179 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-02-07 22:56:34,074 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1603 states.
[2025-02-07 22:56:34,085 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1603 to 1603.
[2025-02-07 22:56:34,086 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1603 states, 1591 states have (on average 1.2985543683218101) internal successors, (2066), 1591 states have internal predecessors, (2066), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10)
[2025-02-07 22:56:34,087 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1603 states to 1603 states and 2086 transitions.
[2025-02-07 22:56:34,087 INFO  L78                 Accepts]: Start accepts. Automaton has 1603 states and 2086 transitions. Word has length 482
[2025-02-07 22:56:34,088 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:56:34,088 INFO  L471      AbstractCegarLoop]: Abstraction has 1603 states and 2086 transitions.
[2025-02-07 22:56:34,088 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 113.75) internal successors, (455), 4 states have internal predecessors, (455), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-02-07 22:56:34,088 INFO  L276                IsEmpty]: Start isEmpty. Operand 1603 states and 2086 transitions.
[2025-02-07 22:56:34,090 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 484
[2025-02-07 22:56:34,090 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:56:34,091 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-07 22:56:34,091 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63
[2025-02-07 22:56:34,091 INFO  L396      AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:56:34,091 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:56:34,091 INFO  L85        PathProgramCache]: Analyzing trace with hash -2042291143, now seen corresponding path program 1 times
[2025-02-07 22:56:34,091 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:56:34,091 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916956068]
[2025-02-07 22:56:34,091 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:56:34,092 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:56:34,163 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 483 statements into 1 equivalence classes.
[2025-02-07 22:56:34,617 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 483 of 483 statements.
[2025-02-07 22:56:34,617 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:56:34,618 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:56:35,102 INFO  L134       CoverageAnalysis]: Checked inductivity of 181 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked.
[2025-02-07 22:56:35,103 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:56:35,103 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916956068]
[2025-02-07 22:56:35,103 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916956068] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:56:35,103 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:56:35,103 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-07 22:56:35,103 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305922041]
[2025-02-07 22:56:35,103 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:56:35,104 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-07 22:56:35,104 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:56:35,104 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-07 22:56:35,104 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-07 22:56:35,104 INFO  L87              Difference]: Start difference. First operand 1603 states and 2086 transitions. Second operand  has 5 states, 5 states have (on average 91.2) internal successors, (456), 5 states have internal predecessors, (456), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-02-07 22:56:35,363 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:56:35,363 INFO  L93              Difference]: Finished difference Result 2676 states and 3506 transitions.
[2025-02-07 22:56:35,364 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-07 22:56:35,364 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 91.2) internal successors, (456), 5 states have internal predecessors, (456), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 483
[2025-02-07 22:56:35,364 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:56:35,365 INFO  L225             Difference]: With dead ends: 2676
[2025-02-07 22:56:35,365 INFO  L226             Difference]: Without dead ends: 1603
[2025-02-07 22:56:35,366 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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-02-07 22:56:35,366 INFO  L435           NwaCegarLoop]: 589 mSDtfsCounter, 1163 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1163 SdHoareTripleChecker+Valid, 1179 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-02-07 22:56:35,366 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1163 Valid, 1179 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-02-07 22:56:35,367 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1603 states.
[2025-02-07 22:56:35,379 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1603 to 1603.
[2025-02-07 22:56:35,380 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1603 states, 1591 states have (on average 1.2972972972972974) internal successors, (2064), 1591 states have internal predecessors, (2064), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10)
[2025-02-07 22:56:35,381 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1603 states to 1603 states and 2084 transitions.
[2025-02-07 22:56:35,381 INFO  L78                 Accepts]: Start accepts. Automaton has 1603 states and 2084 transitions. Word has length 483
[2025-02-07 22:56:35,381 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:56:35,381 INFO  L471      AbstractCegarLoop]: Abstraction has 1603 states and 2084 transitions.
[2025-02-07 22:56:35,381 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 91.2) internal successors, (456), 5 states have internal predecessors, (456), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-02-07 22:56:35,382 INFO  L276                IsEmpty]: Start isEmpty. Operand 1603 states and 2084 transitions.
[2025-02-07 22:56:35,384 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 485
[2025-02-07 22:56:35,384 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:56:35,384 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-07 22:56:35,384 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64
[2025-02-07 22:56:35,384 INFO  L396      AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:56:35,385 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:56:35,385 INFO  L85        PathProgramCache]: Analyzing trace with hash -539192662, now seen corresponding path program 1 times
[2025-02-07 22:56:35,385 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:56:35,385 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472227508]
[2025-02-07 22:56:35,385 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:56:35,385 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:56:35,457 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 484 statements into 1 equivalence classes.
[2025-02-07 22:56:35,913 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 484 of 484 statements.
[2025-02-07 22:56:35,913 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:56:35,913 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:56:36,374 INFO  L134       CoverageAnalysis]: Checked inductivity of 181 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked.
[2025-02-07 22:56:36,375 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:56:36,375 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472227508]
[2025-02-07 22:56:36,375 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472227508] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:56:36,375 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:56:36,375 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-07 22:56:36,375 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120716591]
[2025-02-07 22:56:36,375 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:56:36,375 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-07 22:56:36,376 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:56:36,376 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-07 22:56:36,376 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-07 22:56:36,376 INFO  L87              Difference]: Start difference. First operand 1603 states and 2084 transitions. Second operand  has 5 states, 5 states have (on average 91.4) internal successors, (457), 5 states have internal predecessors, (457), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-02-07 22:56:36,635 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:56:36,635 INFO  L93              Difference]: Finished difference Result 2676 states and 3502 transitions.
[2025-02-07 22:56:36,635 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-07 22:56:36,635 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 91.4) internal successors, (457), 5 states have internal predecessors, (457), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 484
[2025-02-07 22:56:36,635 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:56:36,637 INFO  L225             Difference]: With dead ends: 2676
[2025-02-07 22:56:36,637 INFO  L226             Difference]: Without dead ends: 1603
[2025-02-07 22:56:36,638 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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-02-07 22:56:36,638 INFO  L435           NwaCegarLoop]: 589 mSDtfsCounter, 1153 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1153 SdHoareTripleChecker+Valid, 1179 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-02-07 22:56:36,638 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1153 Valid, 1179 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-02-07 22:56:36,639 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1603 states.
[2025-02-07 22:56:36,652 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1603 to 1603.
[2025-02-07 22:56:36,653 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1603 states, 1591 states have (on average 1.2960402262727844) internal successors, (2062), 1591 states have internal predecessors, (2062), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10)
[2025-02-07 22:56:36,654 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1603 states to 1603 states and 2082 transitions.
[2025-02-07 22:56:36,654 INFO  L78                 Accepts]: Start accepts. Automaton has 1603 states and 2082 transitions. Word has length 484
[2025-02-07 22:56:36,655 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:56:36,655 INFO  L471      AbstractCegarLoop]: Abstraction has 1603 states and 2082 transitions.
[2025-02-07 22:56:36,655 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 91.4) internal successors, (457), 5 states have internal predecessors, (457), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-02-07 22:56:36,655 INFO  L276                IsEmpty]: Start isEmpty. Operand 1603 states and 2082 transitions.
[2025-02-07 22:56:36,657 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 486
[2025-02-07 22:56:36,657 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:56:36,657 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-07 22:56:36,658 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65
[2025-02-07 22:56:36,658 INFO  L396      AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:56:36,658 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:56:36,658 INFO  L85        PathProgramCache]: Analyzing trace with hash 1602237396, now seen corresponding path program 1 times
[2025-02-07 22:56:36,658 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:56:36,658 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504636622]
[2025-02-07 22:56:36,658 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:56:36,658 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:56:36,733 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 485 statements into 1 equivalence classes.
[2025-02-07 22:56:37,159 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 485 of 485 statements.
[2025-02-07 22:56:37,159 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:56:37,159 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:56:37,670 INFO  L134       CoverageAnalysis]: Checked inductivity of 181 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked.
[2025-02-07 22:56:37,671 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:56:37,671 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504636622]
[2025-02-07 22:56:37,671 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504636622] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:56:37,671 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:56:37,671 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-07 22:56:37,671 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055665487]
[2025-02-07 22:56:37,671 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:56:37,672 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-07 22:56:37,672 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:56:37,672 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-07 22:56:37,672 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-07 22:56:37,672 INFO  L87              Difference]: Start difference. First operand 1603 states and 2082 transitions. Second operand  has 5 states, 5 states have (on average 91.6) internal successors, (458), 5 states have internal predecessors, (458), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-02-07 22:56:37,926 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:56:37,927 INFO  L93              Difference]: Finished difference Result 2676 states and 3498 transitions.
[2025-02-07 22:56:37,927 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-07 22:56:37,927 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 91.6) internal successors, (458), 5 states have internal predecessors, (458), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 485
[2025-02-07 22:56:37,927 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:56:37,928 INFO  L225             Difference]: With dead ends: 2676
[2025-02-07 22:56:37,928 INFO  L226             Difference]: Without dead ends: 1603
[2025-02-07 22:56:37,929 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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-02-07 22:56:37,930 INFO  L435           NwaCegarLoop]: 589 mSDtfsCounter, 623 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 623 SdHoareTripleChecker+Valid, 1185 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-02-07 22:56:37,930 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [623 Valid, 1185 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-02-07 22:56:37,930 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1603 states.
[2025-02-07 22:56:37,941 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1603 to 1603.
[2025-02-07 22:56:37,942 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1603 states, 1591 states have (on average 1.2947831552482716) internal successors, (2060), 1591 states have internal predecessors, (2060), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10)
[2025-02-07 22:56:37,943 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1603 states to 1603 states and 2080 transitions.
[2025-02-07 22:56:37,943 INFO  L78                 Accepts]: Start accepts. Automaton has 1603 states and 2080 transitions. Word has length 485
[2025-02-07 22:56:37,943 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:56:37,943 INFO  L471      AbstractCegarLoop]: Abstraction has 1603 states and 2080 transitions.
[2025-02-07 22:56:37,944 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 91.6) internal successors, (458), 5 states have internal predecessors, (458), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-02-07 22:56:37,944 INFO  L276                IsEmpty]: Start isEmpty. Operand 1603 states and 2080 transitions.
[2025-02-07 22:56:37,946 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 487
[2025-02-07 22:56:37,946 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:56:37,946 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-07 22:56:37,946 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66
[2025-02-07 22:56:37,946 INFO  L396      AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:56:37,947 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:56:37,947 INFO  L85        PathProgramCache]: Analyzing trace with hash 359999154, now seen corresponding path program 1 times
[2025-02-07 22:56:37,947 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:56:37,947 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7570495]
[2025-02-07 22:56:37,947 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:56:37,947 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:56:38,021 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 486 statements into 1 equivalence classes.
[2025-02-07 22:56:38,474 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 486 of 486 statements.
[2025-02-07 22:56:38,474 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:56:38,475 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:56:38,935 INFO  L134       CoverageAnalysis]: Checked inductivity of 181 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked.
[2025-02-07 22:56:38,935 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:56:38,935 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7570495]
[2025-02-07 22:56:38,936 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7570495] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:56:38,936 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:56:38,936 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-07 22:56:38,936 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093613164]
[2025-02-07 22:56:38,936 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:56:38,936 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-07 22:56:38,936 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:56:38,937 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-07 22:56:38,937 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-07 22:56:38,937 INFO  L87              Difference]: Start difference. First operand 1603 states and 2080 transitions. Second operand  has 4 states, 4 states have (on average 114.75) internal successors, (459), 4 states have internal predecessors, (459), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-02-07 22:56:39,170 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:56:39,171 INFO  L93              Difference]: Finished difference Result 2676 states and 3494 transitions.
[2025-02-07 22:56:39,171 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-07 22:56:39,171 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 114.75) internal successors, (459), 4 states have internal predecessors, (459), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 486
[2025-02-07 22:56:39,171 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:56:39,173 INFO  L225             Difference]: With dead ends: 2676
[2025-02-07 22:56:39,173 INFO  L226             Difference]: Without dead ends: 1603
[2025-02-07 22:56:39,173 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-02-07 22:56:39,174 INFO  L435           NwaCegarLoop]: 589 mSDtfsCounter, 512 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 512 SdHoareTripleChecker+Valid, 1179 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-02-07 22:56:39,174 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [512 Valid, 1179 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-02-07 22:56:39,174 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1603 states.
[2025-02-07 22:56:39,185 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1603 to 1603.
[2025-02-07 22:56:39,186 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1603 states, 1591 states have (on average 1.2935260842237586) internal successors, (2058), 1591 states have internal predecessors, (2058), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10)
[2025-02-07 22:56:39,187 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1603 states to 1603 states and 2078 transitions.
[2025-02-07 22:56:39,187 INFO  L78                 Accepts]: Start accepts. Automaton has 1603 states and 2078 transitions. Word has length 486
[2025-02-07 22:56:39,188 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:56:39,188 INFO  L471      AbstractCegarLoop]: Abstraction has 1603 states and 2078 transitions.
[2025-02-07 22:56:39,188 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 114.75) internal successors, (459), 4 states have internal predecessors, (459), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-02-07 22:56:39,188 INFO  L276                IsEmpty]: Start isEmpty. Operand 1603 states and 2078 transitions.
[2025-02-07 22:56:39,190 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 488
[2025-02-07 22:56:39,190 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:56:39,190 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-07 22:56:39,191 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67
[2025-02-07 22:56:39,191 INFO  L396      AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:56:39,191 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:56:39,191 INFO  L85        PathProgramCache]: Analyzing trace with hash -1370090068, now seen corresponding path program 1 times
[2025-02-07 22:56:39,191 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:56:39,191 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030235883]
[2025-02-07 22:56:39,191 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:56:39,191 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:56:39,266 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 487 statements into 1 equivalence classes.
[2025-02-07 22:56:40,072 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 487 of 487 statements.
[2025-02-07 22:56:40,072 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:56:40,072 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:56:40,593 INFO  L134       CoverageAnalysis]: Checked inductivity of 181 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked.
[2025-02-07 22:56:40,593 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:56:40,593 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030235883]
[2025-02-07 22:56:40,593 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030235883] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:56:40,593 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:56:40,594 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-02-07 22:56:40,594 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811215554]
[2025-02-07 22:56:40,594 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:56:40,594 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-02-07 22:56:40,594 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:56:40,594 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-02-07 22:56:40,595 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2025-02-07 22:56:40,595 INFO  L87              Difference]: Start difference. First operand 1603 states and 2078 transitions. Second operand  has 6 states, 6 states have (on average 76.66666666666667) internal successors, (460), 6 states have internal predecessors, (460), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-02-07 22:56:41,263 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:56:41,263 INFO  L93              Difference]: Finished difference Result 3739 states and 4886 transitions.
[2025-02-07 22:56:41,264 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-02-07 22:56:41,264 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 76.66666666666667) internal successors, (460), 6 states have internal predecessors, (460), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 487
[2025-02-07 22:56:41,264 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:56:41,266 INFO  L225             Difference]: With dead ends: 3739
[2025-02-07 22:56:41,266 INFO  L226             Difference]: Without dead ends: 2666
[2025-02-07 22:56:41,267 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-02-07 22:56:41,267 INFO  L435           NwaCegarLoop]: 520 mSDtfsCounter, 409 mSDsluCounter, 2082 mSDsCounter, 0 mSdLazyCounter, 1286 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 2602 SdHoareTripleChecker+Invalid, 1294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-02-07 22:56:41,267 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [412 Valid, 2602 Invalid, 1294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1286 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-02-07 22:56:41,268 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2666 states.
[2025-02-07 22:56:41,284 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2666 to 2521.
[2025-02-07 22:56:41,285 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2521 states, 2505 states have (on average 1.2934131736526946) internal successors, (3240), 2505 states have internal predecessors, (3240), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14)
[2025-02-07 22:56:41,287 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2521 states to 2521 states and 3268 transitions.
[2025-02-07 22:56:41,287 INFO  L78                 Accepts]: Start accepts. Automaton has 2521 states and 3268 transitions. Word has length 487
[2025-02-07 22:56:41,287 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:56:41,287 INFO  L471      AbstractCegarLoop]: Abstraction has 2521 states and 3268 transitions.
[2025-02-07 22:56:41,287 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 76.66666666666667) internal successors, (460), 6 states have internal predecessors, (460), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-02-07 22:56:41,287 INFO  L276                IsEmpty]: Start isEmpty. Operand 2521 states and 3268 transitions.
[2025-02-07 22:56:41,290 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 489
[2025-02-07 22:56:41,290 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:56:41,291 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-07 22:56:41,291 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68
[2025-02-07 22:56:41,291 INFO  L396      AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:56:41,291 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:56:41,291 INFO  L85        PathProgramCache]: Analyzing trace with hash 2021978240, now seen corresponding path program 1 times
[2025-02-07 22:56:41,291 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:56:41,291 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631037434]
[2025-02-07 22:56:41,291 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:56:41,291 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:56:41,363 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 488 statements into 1 equivalence classes.
[2025-02-07 22:56:42,299 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 488 of 488 statements.
[2025-02-07 22:56:42,300 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:56:42,300 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:56:42,962 INFO  L134       CoverageAnalysis]: Checked inductivity of 181 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked.
[2025-02-07 22:56:42,962 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:56:42,962 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631037434]
[2025-02-07 22:56:42,962 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631037434] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:56:42,963 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:56:42,963 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-02-07 22:56:42,963 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655194995]
[2025-02-07 22:56:42,963 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:56:42,963 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-02-07 22:56:42,963 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:56:42,964 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-02-07 22:56:42,964 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2025-02-07 22:56:42,964 INFO  L87              Difference]: Start difference. First operand 2521 states and 3268 transitions. Second operand  has 6 states, 6 states have (on average 76.83333333333333) internal successors, (461), 6 states have internal predecessors, (461), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-02-07 22:56:43,582 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:56:43,582 INFO  L93              Difference]: Finished difference Result 3640 states and 4748 transitions.
[2025-02-07 22:56:43,582 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-02-07 22:56:43,583 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 76.83333333333333) internal successors, (461), 6 states have internal predecessors, (461), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 488
[2025-02-07 22:56:43,583 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:56:43,585 INFO  L225             Difference]: With dead ends: 3640
[2025-02-07 22:56:43,585 INFO  L226             Difference]: Without dead ends: 2567
[2025-02-07 22:56:43,586 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2025-02-07 22:56:43,587 INFO  L435           NwaCegarLoop]: 469 mSDtfsCounter, 1016 mSDsluCounter, 1397 mSDsCounter, 0 mSdLazyCounter, 1171 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1019 SdHoareTripleChecker+Valid, 1866 SdHoareTripleChecker+Invalid, 1171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-02-07 22:56:43,591 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1019 Valid, 1866 Invalid, 1171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1171 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-02-07 22:56:43,592 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2567 states.
[2025-02-07 22:56:43,618 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2567 to 2523.
[2025-02-07 22:56:43,619 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2523 states, 2507 states have (on average 1.2931790985241325) internal successors, (3242), 2507 states have internal predecessors, (3242), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14)
[2025-02-07 22:56:43,621 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2523 states to 2523 states and 3270 transitions.
[2025-02-07 22:56:43,621 INFO  L78                 Accepts]: Start accepts. Automaton has 2523 states and 3270 transitions. Word has length 488
[2025-02-07 22:56:43,622 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:56:43,622 INFO  L471      AbstractCegarLoop]: Abstraction has 2523 states and 3270 transitions.
[2025-02-07 22:56:43,622 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 76.83333333333333) internal successors, (461), 6 states have internal predecessors, (461), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-02-07 22:56:43,622 INFO  L276                IsEmpty]: Start isEmpty. Operand 2523 states and 3270 transitions.
[2025-02-07 22:56:43,625 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 489
[2025-02-07 22:56:43,625 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:56:43,626 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-07 22:56:43,626 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69
[2025-02-07 22:56:43,626 INFO  L396      AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:56:43,626 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:56:43,626 INFO  L85        PathProgramCache]: Analyzing trace with hash -1722450563, now seen corresponding path program 1 times
[2025-02-07 22:56:43,626 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:56:43,626 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55003328]
[2025-02-07 22:56:43,627 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:56:43,627 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:56:43,703 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 488 statements into 1 equivalence classes.
[2025-02-07 22:56:44,348 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 488 of 488 statements.
[2025-02-07 22:56:44,349 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:56:44,349 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:56:45,114 INFO  L134       CoverageAnalysis]: Checked inductivity of 181 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked.
[2025-02-07 22:56:45,114 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:56:45,114 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55003328]
[2025-02-07 22:56:45,114 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55003328] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:56:45,114 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:56:45,114 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-02-07 22:56:45,115 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025700550]
[2025-02-07 22:56:45,115 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:56:45,115 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-02-07 22:56:45,115 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:56:45,115 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-02-07 22:56:45,115 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2025-02-07 22:56:45,116 INFO  L87              Difference]: Start difference. First operand 2523 states and 3270 transitions. Second operand  has 8 states, 8 states have (on average 47.375) internal successors, (379), 8 states have internal predecessors, (379), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-02-07 22:56:45,888 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:56:45,888 INFO  L93              Difference]: Finished difference Result 5868 states and 7598 transitions.
[2025-02-07 22:56:45,888 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-02-07 22:56:45,889 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 47.375) internal successors, (379), 8 states have internal predecessors, (379), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 488
[2025-02-07 22:56:45,889 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:56:45,892 INFO  L225             Difference]: With dead ends: 5868
[2025-02-07 22:56:45,892 INFO  L226             Difference]: Without dead ends: 4431
[2025-02-07 22:56:45,894 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2025-02-07 22:56:45,894 INFO  L435           NwaCegarLoop]: 1492 mSDtfsCounter, 1128 mSDsluCounter, 6399 mSDsCounter, 0 mSdLazyCounter, 1879 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1131 SdHoareTripleChecker+Valid, 7891 SdHoareTripleChecker+Invalid, 1879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1879 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-02-07 22:56:45,894 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1131 Valid, 7891 Invalid, 1879 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1879 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-02-07 22:56:45,895 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 4431 states.
[2025-02-07 22:56:45,916 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 4431 to 2603.
[2025-02-07 22:56:45,918 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2603 states, 2583 states have (on average 1.2942315137437088) internal successors, (3343), 2583 states have internal predecessors, (3343), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18)
[2025-02-07 22:56:45,919 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2603 states to 2603 states and 3379 transitions.
[2025-02-07 22:56:45,920 INFO  L78                 Accepts]: Start accepts. Automaton has 2603 states and 3379 transitions. Word has length 488
[2025-02-07 22:56:45,920 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:56:45,920 INFO  L471      AbstractCegarLoop]: Abstraction has 2603 states and 3379 transitions.
[2025-02-07 22:56:45,920 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 47.375) internal successors, (379), 8 states have internal predecessors, (379), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-02-07 22:56:45,920 INFO  L276                IsEmpty]: Start isEmpty. Operand 2603 states and 3379 transitions.
[2025-02-07 22:56:45,923 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 490
[2025-02-07 22:56:45,923 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:56:45,923 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-07 22:56:45,923 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70
[2025-02-07 22:56:45,923 INFO  L396      AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:56:45,924 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:56:45,924 INFO  L85        PathProgramCache]: Analyzing trace with hash 1399983961, now seen corresponding path program 1 times
[2025-02-07 22:56:45,924 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:56:45,924 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198791073]
[2025-02-07 22:56:45,924 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:56:45,924 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:56:46,000 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 489 statements into 1 equivalence classes.
[2025-02-07 22:56:47,898 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 489 of 489 statements.
[2025-02-07 22:56:47,898 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:56:47,898 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:56:49,079 INFO  L134       CoverageAnalysis]: Checked inductivity of 181 backedges. 4 proven. 117 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked.
[2025-02-07 22:56:49,079 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:56:49,079 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198791073]
[2025-02-07 22:56:49,079 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198791073] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-07 22:56:49,079 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [58381890]
[2025-02-07 22:56:49,079 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:56:49,079 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-07 22:56:49,080 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-07 22:56:49,083 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-02-07 22:56:49,083 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2025-02-07 22:56:50,302 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 489 statements into 1 equivalence classes.
[2025-02-07 22:56:50,832 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 489 of 489 statements.
[2025-02-07 22:56:50,832 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:56:50,832 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:56:50,845 INFO  L256         TraceCheckSpWp]: Trace formula consists of 2976 conjuncts, 24 conjuncts are in the unsatisfiable core
[2025-02-07 22:56:50,855 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-07 22:56:51,057 INFO  L134       CoverageAnalysis]: Checked inductivity of 181 backedges. 115 proven. 6 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked.
[2025-02-07 22:56:51,058 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-02-07 22:56:51,333 INFO  L134       CoverageAnalysis]: Checked inductivity of 181 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked.
[2025-02-07 22:56:51,333 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [58381890] provided 1 perfect and 1 imperfect interpolant sequences
[2025-02-07 22:56:51,333 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences.
[2025-02-07 22:56:51,334 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10, 8] total 21
[2025-02-07 22:56:51,334 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580239199]
[2025-02-07 22:56:51,334 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:56:51,334 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-02-07 22:56:51,334 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:56:51,335 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-02-07 22:56:51,335 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=370, Unknown=0, NotChecked=0, Total=420
[2025-02-07 22:56:51,335 INFO  L87              Difference]: Start difference. First operand 2603 states and 3379 transitions. Second operand  has 7 states, 7 states have (on average 66.0) internal successors, (462), 7 states have internal predecessors, (462), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-02-07 22:56:51,996 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:56:51,997 INFO  L93              Difference]: Finished difference Result 4749 states and 6204 transitions.
[2025-02-07 22:56:51,997 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-02-07 22:56:51,997 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 66.0) internal successors, (462), 7 states have internal predecessors, (462), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 489
[2025-02-07 22:56:51,998 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:56:52,001 INFO  L225             Difference]: With dead ends: 4749
[2025-02-07 22:56:52,001 INFO  L226             Difference]: Without dead ends: 3676
[2025-02-07 22:56:52,002 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 990 GetRequests, 969 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=447, Unknown=0, NotChecked=0, Total=506
[2025-02-07 22:56:52,003 INFO  L435           NwaCegarLoop]: 1104 mSDtfsCounter, 485 mSDsluCounter, 5016 mSDsCounter, 0 mSdLazyCounter, 1388 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 485 SdHoareTripleChecker+Valid, 6120 SdHoareTripleChecker+Invalid, 1389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-02-07 22:56:52,003 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [485 Valid, 6120 Invalid, 1389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1388 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-02-07 22:56:52,004 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3676 states.
[2025-02-07 22:56:52,030 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3676 to 3080.
[2025-02-07 22:56:52,032 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3080 states, 3054 states have (on average 1.2799607072691552) internal successors, (3909), 3054 states have internal predecessors, (3909), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24)
[2025-02-07 22:56:52,034 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3080 states to 3080 states and 3957 transitions.
[2025-02-07 22:56:52,034 INFO  L78                 Accepts]: Start accepts. Automaton has 3080 states and 3957 transitions. Word has length 489
[2025-02-07 22:56:52,034 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:56:52,035 INFO  L471      AbstractCegarLoop]: Abstraction has 3080 states and 3957 transitions.
[2025-02-07 22:56:52,035 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 66.0) internal successors, (462), 7 states have internal predecessors, (462), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-02-07 22:56:52,035 INFO  L276                IsEmpty]: Start isEmpty. Operand 3080 states and 3957 transitions.
[2025-02-07 22:56:52,038 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 490
[2025-02-07 22:56:52,038 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:56:52,038 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-07 22:56:52,056 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2025-02-07 22:56:52,242 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-07 22:56:52,242 INFO  L396      AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:56:52,242 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:56:52,243 INFO  L85        PathProgramCache]: Analyzing trace with hash -863152320, now seen corresponding path program 1 times
[2025-02-07 22:56:52,243 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:56:52,243 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861819305]
[2025-02-07 22:56:52,243 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:56:52,243 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:56:52,329 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 489 statements into 1 equivalence classes.
[2025-02-07 22:56:52,431 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 489 of 489 statements.
[2025-02-07 22:56:52,432 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:56:52,432 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:56:52,906 INFO  L134       CoverageAnalysis]: Checked inductivity of 180 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked.
[2025-02-07 22:56:52,906 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:56:52,906 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861819305]
[2025-02-07 22:56:52,906 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861819305] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:56:52,907 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:56:52,907 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-07 22:56:52,907 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698346354]
[2025-02-07 22:56:52,907 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:56:52,907 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-07 22:56:52,907 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:56:52,908 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-07 22:56:52,908 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-02-07 22:56:52,908 INFO  L87              Difference]: Start difference. First operand 3080 states and 3957 transitions. Second operand  has 5 states, 5 states have (on average 85.6) internal successors, (428), 5 states have internal predecessors, (428), 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-02-07 22:56:53,151 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:56:53,151 INFO  L93              Difference]: Finished difference Result 5576 states and 7187 transitions.
[2025-02-07 22:56:53,152 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-07 22:56:53,152 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 85.6) internal successors, (428), 5 states have internal predecessors, (428), 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 489
[2025-02-07 22:56:53,152 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:56:53,155 INFO  L225             Difference]: With dead ends: 5576
[2025-02-07 22:56:53,155 INFO  L226             Difference]: Without dead ends: 3224
[2025-02-07 22:56:53,157 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-02-07 22:56:53,157 INFO  L435           NwaCegarLoop]: 622 mSDtfsCounter, 16 mSDsluCounter, 1856 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 2478 SdHoareTripleChecker+Invalid, 553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-02-07 22:56:53,157 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 2478 Invalid, 553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 553 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-02-07 22:56:53,158 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3224 states.
[2025-02-07 22:56:53,188 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3224 to 3224.
[2025-02-07 22:56:53,190 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3224 states, 3198 states have (on average 1.2873671044402752) internal successors, (4117), 3198 states have internal predecessors, (4117), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24)
[2025-02-07 22:56:53,192 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3224 states to 3224 states and 4165 transitions.
[2025-02-07 22:56:53,193 INFO  L78                 Accepts]: Start accepts. Automaton has 3224 states and 4165 transitions. Word has length 489
[2025-02-07 22:56:53,193 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:56:53,193 INFO  L471      AbstractCegarLoop]: Abstraction has 3224 states and 4165 transitions.
[2025-02-07 22:56:53,193 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 85.6) internal successors, (428), 5 states have internal predecessors, (428), 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-02-07 22:56:53,193 INFO  L276                IsEmpty]: Start isEmpty. Operand 3224 states and 4165 transitions.
[2025-02-07 22:56:53,196 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 491
[2025-02-07 22:56:53,197 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:56:53,197 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-07 22:56:53,197 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72
[2025-02-07 22:56:53,197 INFO  L396      AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:56:53,197 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:56:53,197 INFO  L85        PathProgramCache]: Analyzing trace with hash -811408835, now seen corresponding path program 1 times
[2025-02-07 22:56:53,198 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:56:53,198 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797416604]
[2025-02-07 22:56:53,198 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:56:53,198 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:56:53,289 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 490 statements into 1 equivalence classes.
[2025-02-07 22:56:54,529 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 490 of 490 statements.
[2025-02-07 22:56:54,529 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:56:54,529 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:56:56,524 INFO  L134       CoverageAnalysis]: Checked inductivity of 181 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked.
[2025-02-07 22:56:56,525 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:56:56,525 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797416604]
[2025-02-07 22:56:56,525 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797416604] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:56:56,525 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:56:56,525 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2025-02-07 22:56:56,525 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499436151]
[2025-02-07 22:56:56,525 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:56:56,525 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2025-02-07 22:56:56,526 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:56:56,526 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2025-02-07 22:56:56,526 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90
[2025-02-07 22:56:56,526 INFO  L87              Difference]: Start difference. First operand 3224 states and 4165 transitions. Second operand  has 10 states, 10 states have (on average 38.6) internal successors, (386), 10 states have internal predecessors, (386), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6)
[2025-02-07 22:56:57,588 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:56:57,589 INFO  L93              Difference]: Finished difference Result 6687 states and 8650 transitions.
[2025-02-07 22:56:57,589 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2025-02-07 22:56:57,589 INFO  L78                 Accepts]: Start accepts. Automaton has  has 10 states, 10 states have (on average 38.6) internal successors, (386), 10 states have internal predecessors, (386), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 490
[2025-02-07 22:56:57,589 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:56:57,592 INFO  L225             Difference]: With dead ends: 6687
[2025-02-07 22:56:57,592 INFO  L226             Difference]: Without dead ends: 4219
[2025-02-07 22:56:57,594 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210
[2025-02-07 22:56:57,594 INFO  L435           NwaCegarLoop]: 972 mSDtfsCounter, 1782 mSDsluCounter, 5948 mSDsCounter, 0 mSdLazyCounter, 2075 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1787 SdHoareTripleChecker+Valid, 6920 SdHoareTripleChecker+Invalid, 2076 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2075 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time
[2025-02-07 22:56:57,595 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1787 Valid, 6920 Invalid, 2076 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2075 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2025-02-07 22:56:57,596 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 4219 states.
[2025-02-07 22:56:57,624 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 4219 to 3275.
[2025-02-07 22:56:57,625 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3275 states, 3246 states have (on average 1.2877387553912507) internal successors, (4180), 3246 states have internal predecessors, (4180), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27)
[2025-02-07 22:56:57,627 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3275 states to 3275 states and 4234 transitions.
[2025-02-07 22:56:57,627 INFO  L78                 Accepts]: Start accepts. Automaton has 3275 states and 4234 transitions. Word has length 490
[2025-02-07 22:56:57,628 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:56:57,628 INFO  L471      AbstractCegarLoop]: Abstraction has 3275 states and 4234 transitions.
[2025-02-07 22:56:57,628 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 38.6) internal successors, (386), 10 states have internal predecessors, (386), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6)
[2025-02-07 22:56:57,628 INFO  L276                IsEmpty]: Start isEmpty. Operand 3275 states and 4234 transitions.
[2025-02-07 22:56:57,631 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 491
[2025-02-07 22:56:57,631 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:56:57,631 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-07 22:56:57,632 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73
[2025-02-07 22:56:57,632 INFO  L396      AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:56:57,632 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:56:57,632 INFO  L85        PathProgramCache]: Analyzing trace with hash -2083337592, now seen corresponding path program 1 times
[2025-02-07 22:56:57,632 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:56:57,632 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068474818]
[2025-02-07 22:56:57,632 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:56:57,632 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:56:57,710 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 490 statements into 1 equivalence classes.