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


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


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

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


Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e22f4e480e00059ce3613278d58ea2e0a6d73a8e3bda2e3d0eda9cb576504b9d
[2025-02-05 12:04:48,530 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-02-05 12:04:48,537 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-02-05 12:04:48,539 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-02-05 12:04:48,540 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-02-05 12:04:48,540 INFO  L274        PluginConnector]: CDTParser initialized
[2025-02-05 12:04:48,541 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem17_label38.c
[2025-02-05 12:04:49,762 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/89dc99f9a/e133e6b1801a41f3880bc1bba9c58e78/FLAGce912ae80
[2025-02-05 12:04:50,241 INFO  L384              CDTParser]: Found 1 translation units.
[2025-02-05 12:04:50,242 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label38.c
[2025-02-05 12:04:50,266 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/89dc99f9a/e133e6b1801a41f3880bc1bba9c58e78/FLAGce912ae80
[2025-02-05 12:04:50,342 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/89dc99f9a/e133e6b1801a41f3880bc1bba9c58e78
[2025-02-05 12:04:50,344 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-02-05 12:04:50,346 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-02-05 12:04:50,347 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-02-05 12:04:50,348 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-02-05 12:04:50,351 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-02-05 12:04:50,351 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 12:04:50" (1/1) ...
[2025-02-05 12:04:50,353 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c0ae1b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:04:50, skipping insertion in model container
[2025-02-05 12:04:50,353 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 12:04:50" (1/1) ...
[2025-02-05 12:04:50,413 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-02-05 12:04:50,581 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label38.c[7744,7757]
[2025-02-05 12:04:50,909 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-05 12:04:50,920 INFO  L200         MainTranslator]: Completed pre-run
[2025-02-05 12:04:50,937 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label38.c[7744,7757]
[2025-02-05 12:04:51,131 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-05 12:04:51,145 INFO  L204         MainTranslator]: Completed translation
[2025-02-05 12:04:51,146 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:04:51 WrapperNode
[2025-02-05 12:04:51,146 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-02-05 12:04:51,147 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-02-05 12:04:51,148 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-02-05 12:04:51,148 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-02-05 12:04:51,153 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:04:51" (1/1) ...
[2025-02-05 12:04:51,195 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:04:51" (1/1) ...
[2025-02-05 12:04:51,425 INFO  L138                Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 2610
[2025-02-05 12:04:51,426 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-02-05 12:04:51,426 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-02-05 12:04:51,426 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-02-05 12:04:51,426 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-02-05 12:04:51,433 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:04:51" (1/1) ...
[2025-02-05 12:04:51,433 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:04:51" (1/1) ...
[2025-02-05 12:04:51,543 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:04:51" (1/1) ...
[2025-02-05 12:04:51,658 INFO  L175           MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2025-02-05 12:04:51,658 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:04:51" (1/1) ...
[2025-02-05 12:04:51,659 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:04:51" (1/1) ...
[2025-02-05 12:04:51,742 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:04:51" (1/1) ...
[2025-02-05 12:04:51,760 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:04:51" (1/1) ...
[2025-02-05 12:04:51,781 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:04:51" (1/1) ...
[2025-02-05 12:04:51,808 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:04:51" (1/1) ...
[2025-02-05 12:04:51,847 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-02-05 12:04:51,850 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-02-05 12:04:51,850 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-02-05 12:04:51,850 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-02-05 12:04:51,851 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:04:51" (1/1) ...
[2025-02-05 12:04:51,855 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-02-05 12:04:51,865 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 12:04:51,879 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2025-02-05 12:04:51,884 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2025-02-05 12:04:51,901 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-02-05 12:04:51,901 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-02-05 12:04:51,901 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-02-05 12:04:51,901 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-02-05 12:04:51,966 INFO  L257             CfgBuilder]: Building ICFG
[2025-02-05 12:04:51,967 INFO  L287             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-02-05 12:04:54,480 INFO  L1309  $ProcedureCfgBuilder]: dead code at ProgramPoint L1653: havoc calculate_output_#t~ret7#1;
[2025-02-05 12:04:54,616 INFO  L?                        ?]: Removed 372 outVars from TransFormulas that were not future-live.
[2025-02-05 12:04:54,616 INFO  L308             CfgBuilder]: Performing block encoding
[2025-02-05 12:04:54,641 INFO  L332             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-02-05 12:04:54,642 INFO  L337             CfgBuilder]: Removed 0 assume(true) statements.
[2025-02-05 12:04:54,645 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 12:04:54 BoogieIcfgContainer
[2025-02-05 12:04:54,645 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-02-05 12:04:54,647 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-02-05 12:04:54,647 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-02-05 12:04:54,651 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-02-05 12:04:54,651 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 12:04:50" (1/3) ...
[2025-02-05 12:04:54,651 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48fa89ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 12:04:54, skipping insertion in model container
[2025-02-05 12:04:54,652 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:04:51" (2/3) ...
[2025-02-05 12:04:54,652 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48fa89ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 12:04:54, skipping insertion in model container
[2025-02-05 12:04:54,652 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 12:04:54" (3/3) ...
[2025-02-05 12:04:54,653 INFO  L128   eAbstractionObserver]: Analyzing ICFG Problem17_label38.c
[2025-02-05 12:04:54,664 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-02-05 12:04:54,666 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG Problem17_label38.c that has 1 procedures, 590 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-02-05 12:04:54,726 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-02-05 12:04:54,736 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;@6a017e0d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-02-05 12:04:54,736 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-02-05 12:04:54,741 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 590 states, 588 states have (on average 1.804421768707483) internal successors, (1061), 589 states have internal predecessors, (1061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:04:54,745 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 53
[2025-02-05 12:04:54,747 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:04:54,747 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 12:04:54,748 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:04:54,752 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:04:54,753 INFO  L85        PathProgramCache]: Analyzing trace with hash -1251988935, now seen corresponding path program 1 times
[2025-02-05 12:04:54,758 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:04:54,759 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300897441]
[2025-02-05 12:04:54,760 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:04:54,760 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:04:54,815 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes.
[2025-02-05 12:04:54,855 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements.
[2025-02-05 12:04:54,859 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:04:54,859 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:04:55,157 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 12:04:55,157 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:04:55,157 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300897441]
[2025-02-05 12:04:55,158 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300897441] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 12:04:55,158 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 12:04:55,158 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-02-05 12:04:55,159 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347786135]
[2025-02-05 12:04:55,159 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:04:55,167 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 12:04:55,167 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:04:55,194 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 12:04:55,199 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 12:04:55,202 INFO  L87              Difference]: Start difference. First operand  has 590 states, 588 states have (on average 1.804421768707483) internal successors, (1061), 589 states have internal predecessors, (1061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand  has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 2 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:04:57,555 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:04:57,556 INFO  L93              Difference]: Finished difference Result 1642 states and 3021 transitions.
[2025-02-05 12:04:57,558 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 12:04:57,559 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 2 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52
[2025-02-05 12:04:57,559 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:04:57,573 INFO  L225             Difference]: With dead ends: 1642
[2025-02-05 12:04:57,573 INFO  L226             Difference]: Without dead ends: 975
[2025-02-05 12:04:57,577 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 12:04:57,580 INFO  L435           NwaCegarLoop]: 475 mSDtfsCounter, 438 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 1413 mSolverCounterSat, 372 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 1785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 372 IncrementalHoareTripleChecker+Valid, 1413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time
[2025-02-05 12:04:57,580 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 551 Invalid, 1785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [372 Valid, 1413 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time]
[2025-02-05 12:04:57,598 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 975 states.
[2025-02-05 12:04:57,649 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 972.
[2025-02-05 12:04:57,656 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 972 states, 971 states have (on average 1.5077239958805355) internal successors, (1464), 971 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:04:57,669 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 972 states and 1464 transitions.
[2025-02-05 12:04:57,674 INFO  L78                 Accepts]: Start accepts. Automaton has 972 states and 1464 transitions. Word has length 52
[2025-02-05 12:04:57,674 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:04:57,674 INFO  L471      AbstractCegarLoop]: Abstraction has 972 states and 1464 transitions.
[2025-02-05 12:04:57,674 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 2 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:04:57,674 INFO  L276                IsEmpty]: Start isEmpty. Operand 972 states and 1464 transitions.
[2025-02-05 12:04:57,677 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 123
[2025-02-05 12:04:57,680 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:04:57,681 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 12:04:57,681 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2025-02-05 12:04:57,681 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:04:57,682 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:04:57,682 INFO  L85        PathProgramCache]: Analyzing trace with hash -487646431, now seen corresponding path program 1 times
[2025-02-05 12:04:57,682 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:04:57,682 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868035877]
[2025-02-05 12:04:57,682 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:04:57,682 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:04:57,725 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes.
[2025-02-05 12:04:57,793 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements.
[2025-02-05 12:04:57,795 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:04:57,796 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:04:58,060 INFO  L134       CoverageAnalysis]: Checked inductivity of 49 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 12:04:58,060 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:04:58,060 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868035877]
[2025-02-05 12:04:58,060 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868035877] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 12:04:58,060 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 12:04:58,060 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 12:04:58,061 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406940357]
[2025-02-05 12:04:58,061 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:04:58,061 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 12:04:58,062 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:04:58,062 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 12:04:58,062 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 12:04:58,062 INFO  L87              Difference]: Start difference. First operand 972 states and 1464 transitions. Second operand  has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:05:00,105 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:05:00,110 INFO  L93              Difference]: Finished difference Result 2814 states and 4242 transitions.
[2025-02-05 12:05:00,110 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 12:05:00,111 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 122
[2025-02-05 12:05:00,111 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:05:00,124 INFO  L225             Difference]: With dead ends: 2814
[2025-02-05 12:05:00,124 INFO  L226             Difference]: Without dead ends: 1844
[2025-02-05 12:05:00,126 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 12:05:00,127 INFO  L435           NwaCegarLoop]: 853 mSDtfsCounter, 439 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 1283 mSolverCounterSat, 414 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 439 SdHoareTripleChecker+Valid, 921 SdHoareTripleChecker+Invalid, 1697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 414 IncrementalHoareTripleChecker+Valid, 1283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time
[2025-02-05 12:05:00,127 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [439 Valid, 921 Invalid, 1697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [414 Valid, 1283 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time]
[2025-02-05 12:05:00,134 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1844 states.
[2025-02-05 12:05:00,191 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1844 to 1842.
[2025-02-05 12:05:00,198 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1842 states, 1841 states have (on average 1.3601303639326452) internal successors, (2504), 1841 states have internal predecessors, (2504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:05:00,208 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1842 states to 1842 states and 2504 transitions.
[2025-02-05 12:05:00,212 INFO  L78                 Accepts]: Start accepts. Automaton has 1842 states and 2504 transitions. Word has length 122
[2025-02-05 12:05:00,213 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:05:00,213 INFO  L471      AbstractCegarLoop]: Abstraction has 1842 states and 2504 transitions.
[2025-02-05 12:05:00,214 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:05:00,214 INFO  L276                IsEmpty]: Start isEmpty. Operand 1842 states and 2504 transitions.
[2025-02-05 12:05:00,220 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 145
[2025-02-05 12:05:00,220 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:05:00,220 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 12:05:00,220 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-02-05 12:05:00,221 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:05:00,221 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:05:00,221 INFO  L85        PathProgramCache]: Analyzing trace with hash 1300438038, now seen corresponding path program 1 times
[2025-02-05 12:05:00,221 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:05:00,221 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756806338]
[2025-02-05 12:05:00,221 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:05:00,221 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:05:00,264 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes.
[2025-02-05 12:05:00,287 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements.
[2025-02-05 12:05:00,292 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:05:00,293 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:05:00,553 INFO  L134       CoverageAnalysis]: Checked inductivity of 49 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 12:05:00,553 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:05:00,554 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756806338]
[2025-02-05 12:05:00,554 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756806338] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 12:05:00,554 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 12:05:00,554 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-02-05 12:05:00,554 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001979038]
[2025-02-05 12:05:00,554 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:05:00,554 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 12:05:00,555 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:05:00,559 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 12:05:00,559 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 12:05:00,559 INFO  L87              Difference]: Start difference. First operand 1842 states and 2504 transitions. Second operand  has 3 states, 3 states have (on average 48.0) internal successors, (144), 2 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:05:02,662 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:05:02,662 INFO  L93              Difference]: Finished difference Result 5395 states and 7326 transitions.
[2025-02-05 12:05:02,663 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 12:05:02,664 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 48.0) internal successors, (144), 2 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 144
[2025-02-05 12:05:02,664 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:05:02,673 INFO  L225             Difference]: With dead ends: 5395
[2025-02-05 12:05:02,673 INFO  L226             Difference]: Without dead ends: 2701
[2025-02-05 12:05:02,679 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 12:05:02,681 INFO  L435           NwaCegarLoop]: 515 mSDtfsCounter, 368 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 1629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 548 IncrementalHoareTripleChecker+Valid, 1081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time
[2025-02-05 12:05:02,682 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 590 Invalid, 1629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 1081 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time]
[2025-02-05 12:05:02,687 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2701 states.
[2025-02-05 12:05:02,720 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2701 to 2701.
[2025-02-05 12:05:02,724 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2701 states, 2700 states have (on average 1.191851851851852) internal successors, (3218), 2700 states have internal predecessors, (3218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:05:02,728 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2701 states to 2701 states and 3218 transitions.
[2025-02-05 12:05:02,728 INFO  L78                 Accepts]: Start accepts. Automaton has 2701 states and 3218 transitions. Word has length 144
[2025-02-05 12:05:02,729 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:05:02,729 INFO  L471      AbstractCegarLoop]: Abstraction has 2701 states and 3218 transitions.
[2025-02-05 12:05:02,729 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 48.0) internal successors, (144), 2 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:05:02,730 INFO  L276                IsEmpty]: Start isEmpty. Operand 2701 states and 3218 transitions.
[2025-02-05 12:05:02,731 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 205
[2025-02-05 12:05:02,731 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:05:02,731 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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]
[2025-02-05 12:05:02,732 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-02-05 12:05:02,732 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:05:02,732 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:05:02,732 INFO  L85        PathProgramCache]: Analyzing trace with hash 903457182, now seen corresponding path program 1 times
[2025-02-05 12:05:02,732 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:05:02,732 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379556370]
[2025-02-05 12:05:02,732 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:05:02,734 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:05:02,760 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes.
[2025-02-05 12:05:02,781 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements.
[2025-02-05 12:05:02,781 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:05:02,781 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:05:03,020 INFO  L134       CoverageAnalysis]: Checked inductivity of 167 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 12:05:03,021 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:05:03,021 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379556370]
[2025-02-05 12:05:03,022 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379556370] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 12:05:03,022 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 12:05:03,022 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 12:05:03,022 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836430352]
[2025-02-05 12:05:03,022 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:05:03,022 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 12:05:03,022 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:05:03,023 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 12:05:03,023 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 12:05:03,023 INFO  L87              Difference]: Start difference. First operand 2701 states and 3218 transitions. Second operand  has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:05:04,478 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:05:04,478 INFO  L93              Difference]: Finished difference Result 7108 states and 8598 transitions.
[2025-02-05 12:05:04,478 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 12:05:04,479 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 204
[2025-02-05 12:05:04,479 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:05:04,503 INFO  L225             Difference]: With dead ends: 7108
[2025-02-05 12:05:04,504 INFO  L226             Difference]: Without dead ends: 4409
[2025-02-05 12:05:04,511 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 12:05:04,515 INFO  L435           NwaCegarLoop]: 726 mSDtfsCounter, 496 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 1136 mSolverCounterSat, 306 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 784 SdHoareTripleChecker+Invalid, 1442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 306 IncrementalHoareTripleChecker+Valid, 1136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time
[2025-02-05 12:05:04,515 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 784 Invalid, 1442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [306 Valid, 1136 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time]
[2025-02-05 12:05:04,519 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 4409 states.
[2025-02-05 12:05:04,651 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 4409 to 4409.
[2025-02-05 12:05:04,659 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 4409 states, 4408 states have (on average 1.1705989110707804) internal successors, (5160), 4408 states have internal predecessors, (5160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:05:04,667 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4409 states to 4409 states and 5160 transitions.
[2025-02-05 12:05:04,667 INFO  L78                 Accepts]: Start accepts. Automaton has 4409 states and 5160 transitions. Word has length 204
[2025-02-05 12:05:04,667 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:05:04,667 INFO  L471      AbstractCegarLoop]: Abstraction has 4409 states and 5160 transitions.
[2025-02-05 12:05:04,668 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:05:04,668 INFO  L276                IsEmpty]: Start isEmpty. Operand 4409 states and 5160 transitions.
[2025-02-05 12:05:04,669 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 207
[2025-02-05 12:05:04,669 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:05:04,669 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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]
[2025-02-05 12:05:04,670 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-02-05 12:05:04,670 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:05:04,670 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:05:04,670 INFO  L85        PathProgramCache]: Analyzing trace with hash -1688590023, now seen corresponding path program 1 times
[2025-02-05 12:05:04,670 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:05:04,671 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280648017]
[2025-02-05 12:05:04,671 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:05:04,671 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:05:04,687 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes.
[2025-02-05 12:05:04,701 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements.
[2025-02-05 12:05:04,701 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:05:04,701 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:05:04,781 INFO  L134       CoverageAnalysis]: Checked inductivity of 169 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked.
[2025-02-05 12:05:04,782 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:05:04,782 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280648017]
[2025-02-05 12:05:04,782 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280648017] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 12:05:04,782 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 12:05:04,782 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 12:05:04,782 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089556400]
[2025-02-05 12:05:04,782 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:05:04,783 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 12:05:04,783 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:05:04,783 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 12:05:04,783 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 12:05:04,783 INFO  L87              Difference]: Start difference. First operand 4409 states and 5160 transitions. Second operand  has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:05:06,303 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:05:06,303 INFO  L93              Difference]: Finished difference Result 10936 states and 12970 transitions.
[2025-02-05 12:05:06,304 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 12:05:06,304 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 206
[2025-02-05 12:05:06,304 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:05:06,320 INFO  L225             Difference]: With dead ends: 10936
[2025-02-05 12:05:06,320 INFO  L226             Difference]: Without dead ends: 6528
[2025-02-05 12:05:06,325 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 12:05:06,326 INFO  L435           NwaCegarLoop]: 383 mSDtfsCounter, 399 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1215 mSolverCounterSat, 274 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 1489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 274 IncrementalHoareTripleChecker+Valid, 1215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time
[2025-02-05 12:05:06,326 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 445 Invalid, 1489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [274 Valid, 1215 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time]
[2025-02-05 12:05:06,331 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 6528 states.
[2025-02-05 12:05:06,377 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 6528 to 4382.
[2025-02-05 12:05:06,382 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 4382 states, 4381 states have (on average 1.1684546907098836) internal successors, (5119), 4381 states have internal predecessors, (5119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:05:06,388 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4382 states to 4382 states and 5119 transitions.
[2025-02-05 12:05:06,388 INFO  L78                 Accepts]: Start accepts. Automaton has 4382 states and 5119 transitions. Word has length 206
[2025-02-05 12:05:06,388 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:05:06,388 INFO  L471      AbstractCegarLoop]: Abstraction has 4382 states and 5119 transitions.
[2025-02-05 12:05:06,389 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:05:06,389 INFO  L276                IsEmpty]: Start isEmpty. Operand 4382 states and 5119 transitions.
[2025-02-05 12:05:06,391 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 273
[2025-02-05 12:05:06,391 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:05:06,391 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-02-05 12:05:06,391 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-02-05 12:05:06,392 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:05:06,392 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:05:06,392 INFO  L85        PathProgramCache]: Analyzing trace with hash -752292031, now seen corresponding path program 1 times
[2025-02-05 12:05:06,392 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:05:06,392 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881870075]
[2025-02-05 12:05:06,393 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:05:06,393 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:05:06,413 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes.
[2025-02-05 12:05:06,434 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements.
[2025-02-05 12:05:06,434 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:05:06,434 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:05:06,837 INFO  L134       CoverageAnalysis]: Checked inductivity of 181 backedges. 99 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 12:05:06,838 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:05:06,838 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881870075]
[2025-02-05 12:05:06,838 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881870075] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-05 12:05:06,838 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [358033493]
[2025-02-05 12:05:06,839 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:05:06,839 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 12:05:06,839 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 12:05:06,843 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-02-05 12:05:06,845 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2025-02-05 12:05:06,895 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes.
[2025-02-05 12:05:06,947 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements.
[2025-02-05 12:05:06,948 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:05:06,948 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:05:06,950 INFO  L256         TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 4 conjuncts are in the unsatisfiable core
[2025-02-05 12:05:06,959 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-05 12:05:07,236 INFO  L134       CoverageAnalysis]: Checked inductivity of 181 backedges. 99 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 12:05:07,236 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-02-05 12:05:07,591 INFO  L134       CoverageAnalysis]: Checked inductivity of 181 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 12:05:07,596 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [358033493] provided 1 perfect and 1 imperfect interpolant sequences
[2025-02-05 12:05:07,596 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences.
[2025-02-05 12:05:07,596 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 7
[2025-02-05 12:05:07,596 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039092192]
[2025-02-05 12:05:07,596 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:05:07,596 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 12:05:07,596 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:05:07,597 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 12:05:07,597 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2025-02-05 12:05:07,597 INFO  L87              Difference]: Start difference. First operand 4382 states and 5119 transitions. Second operand  has 4 states, 4 states have (on average 68.0) internal successors, (272), 3 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:05:10,598 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:05:10,598 INFO  L93              Difference]: Finished difference Result 16039 states and 18798 transitions.
[2025-02-05 12:05:10,598 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 12:05:10,599 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 68.0) internal successors, (272), 3 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 272
[2025-02-05 12:05:10,602 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:05:10,632 INFO  L225             Difference]: With dead ends: 16039
[2025-02-05 12:05:10,633 INFO  L226             Difference]: Without dead ends: 10804
[2025-02-05 12:05:10,645 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 545 GetRequests, 539 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2025-02-05 12:05:10,646 INFO  L435           NwaCegarLoop]: 72 mSDtfsCounter, 767 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 2597 mSolverCounterSat, 688 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 767 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 3285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 688 IncrementalHoareTripleChecker+Valid, 2597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time
[2025-02-05 12:05:10,646 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [767 Valid, 154 Invalid, 3285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [688 Valid, 2597 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time]
[2025-02-05 12:05:10,663 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 10804 states.
[2025-02-05 12:05:10,897 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 10804 to 9924.
[2025-02-05 12:05:10,927 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 9924 states, 9923 states have (on average 1.1542880177365715) internal successors, (11454), 9923 states have internal predecessors, (11454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:05:10,960 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9924 states to 9924 states and 11454 transitions.
[2025-02-05 12:05:10,961 INFO  L78                 Accepts]: Start accepts. Automaton has 9924 states and 11454 transitions. Word has length 272
[2025-02-05 12:05:10,961 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:05:10,961 INFO  L471      AbstractCegarLoop]: Abstraction has 9924 states and 11454 transitions.
[2025-02-05 12:05:10,961 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 68.0) internal successors, (272), 3 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:05:10,961 INFO  L276                IsEmpty]: Start isEmpty. Operand 9924 states and 11454 transitions.
[2025-02-05 12:05:10,968 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 302
[2025-02-05 12:05:10,969 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:05:10,969 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 12:05:10,989 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-05 12:05:11,172 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 12:05:11,172 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:05:11,173 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:05:11,173 INFO  L85        PathProgramCache]: Analyzing trace with hash 1969624090, now seen corresponding path program 1 times
[2025-02-05 12:05:11,173 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:05:11,173 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831954365]
[2025-02-05 12:05:11,173 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:05:11,173 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:05:11,224 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 301 statements into 1 equivalence classes.
[2025-02-05 12:05:11,255 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 301 of 301 statements.
[2025-02-05 12:05:11,258 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:05:11,258 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:05:11,562 INFO  L134       CoverageAnalysis]: Checked inductivity of 394 backedges. 313 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked.
[2025-02-05 12:05:11,567 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:05:11,567 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831954365]
[2025-02-05 12:05:11,567 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831954365] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 12:05:11,567 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 12:05:11,567 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 12:05:11,567 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862042645]
[2025-02-05 12:05:11,567 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:05:11,567 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 12:05:11,567 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:05:11,568 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 12:05:11,568 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 12:05:11,568 INFO  L87              Difference]: Start difference. First operand 9924 states and 11454 transitions. Second operand  has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 3 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:05:13,663 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:05:13,664 INFO  L93              Difference]: Finished difference Result 24946 states and 29142 transitions.
[2025-02-05 12:05:13,664 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 12:05:13,665 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 3 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 301
[2025-02-05 12:05:13,665 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:05:13,696 INFO  L225             Difference]: With dead ends: 24946
[2025-02-05 12:05:13,696 INFO  L226             Difference]: Without dead ends: 14174
[2025-02-05 12:05:13,704 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 12:05:13,705 INFO  L435           NwaCegarLoop]: 763 mSDtfsCounter, 367 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 1184 mSolverCounterSat, 245 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 830 SdHoareTripleChecker+Invalid, 1429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 245 IncrementalHoareTripleChecker+Valid, 1184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time
[2025-02-05 12:05:13,706 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [367 Valid, 830 Invalid, 1429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [245 Valid, 1184 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time]
[2025-02-05 12:05:13,714 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 14174 states.
[2025-02-05 12:05:13,829 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 14174 to 14174.
[2025-02-05 12:05:13,855 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 14174 states, 14173 states have (on average 1.1241797784519862) internal successors, (15933), 14173 states have internal predecessors, (15933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:05:13,877 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 14174 states to 14174 states and 15933 transitions.
[2025-02-05 12:05:13,878 INFO  L78                 Accepts]: Start accepts. Automaton has 14174 states and 15933 transitions. Word has length 301
[2025-02-05 12:05:13,878 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:05:13,878 INFO  L471      AbstractCegarLoop]: Abstraction has 14174 states and 15933 transitions.
[2025-02-05 12:05:13,883 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 3 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:05:13,883 INFO  L276                IsEmpty]: Start isEmpty. Operand 14174 states and 15933 transitions.
[2025-02-05 12:05:13,888 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 325
[2025-02-05 12:05:13,888 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:05:13,889 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 12:05:13,889 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-02-05 12:05:13,889 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:05:13,890 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:05:13,890 INFO  L85        PathProgramCache]: Analyzing trace with hash 890843967, now seen corresponding path program 1 times
[2025-02-05 12:05:13,890 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:05:13,890 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579879164]
[2025-02-05 12:05:13,890 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:05:13,890 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:05:13,913 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 324 statements into 1 equivalence classes.
[2025-02-05 12:05:13,933 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 324 of 324 statements.
[2025-02-05 12:05:13,933 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:05:13,933 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:05:14,098 INFO  L134       CoverageAnalysis]: Checked inductivity of 397 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked.
[2025-02-05 12:05:14,099 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:05:14,099 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579879164]
[2025-02-05 12:05:14,099 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579879164] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 12:05:14,099 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 12:05:14,099 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 12:05:14,100 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223413711]
[2025-02-05 12:05:14,100 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:05:14,100 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 12:05:14,100 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:05:14,100 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 12:05:14,101 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 12:05:14,101 INFO  L87              Difference]: Start difference. First operand 14174 states and 15933 transitions. Second operand  has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:05:15,770 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:05:15,771 INFO  L93              Difference]: Finished difference Result 34303 states and 38905 transitions.
[2025-02-05 12:05:15,773 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 12:05:15,773 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 324
[2025-02-05 12:05:15,773 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:05:15,843 INFO  L225             Difference]: With dead ends: 34303
[2025-02-05 12:05:15,844 INFO  L226             Difference]: Without dead ends: 20131
[2025-02-05 12:05:15,855 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 12:05:15,855 INFO  L435           NwaCegarLoop]: 295 mSDtfsCounter, 444 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 1203 mSolverCounterSat, 259 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 444 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 1462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 259 IncrementalHoareTripleChecker+Valid, 1203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time
[2025-02-05 12:05:15,856 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [444 Valid, 349 Invalid, 1462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [259 Valid, 1203 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time]
[2025-02-05 12:05:15,866 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 20131 states.
[2025-02-05 12:05:16,052 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 20131 to 18000.
[2025-02-05 12:05:16,075 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 18000 states, 17999 states have (on average 1.1273404078004334) internal successors, (20291), 17999 states have internal predecessors, (20291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:05:16,100 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 18000 states to 18000 states and 20291 transitions.
[2025-02-05 12:05:16,102 INFO  L78                 Accepts]: Start accepts. Automaton has 18000 states and 20291 transitions. Word has length 324
[2025-02-05 12:05:16,102 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:05:16,102 INFO  L471      AbstractCegarLoop]: Abstraction has 18000 states and 20291 transitions.
[2025-02-05 12:05:16,103 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:05:16,103 INFO  L276                IsEmpty]: Start isEmpty. Operand 18000 states and 20291 transitions.
[2025-02-05 12:05:16,110 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 392
[2025-02-05 12:05:16,110 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:05:16,110 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 12:05:16,110 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-02-05 12:05:16,111 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:05:16,111 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:05:16,111 INFO  L85        PathProgramCache]: Analyzing trace with hash 1549102526, now seen corresponding path program 1 times
[2025-02-05 12:05:16,111 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:05:16,111 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318777840]
[2025-02-05 12:05:16,111 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:05:16,112 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:05:16,164 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 391 statements into 1 equivalence classes.
[2025-02-05 12:05:16,192 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 391 of 391 statements.
[2025-02-05 12:05:16,192 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:05:16,192 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:05:16,466 INFO  L134       CoverageAnalysis]: Checked inductivity of 49 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 12:05:16,467 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:05:16,467 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318777840]
[2025-02-05 12:05:16,467 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318777840] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 12:05:16,467 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 12:05:16,467 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 12:05:16,467 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448951761]
[2025-02-05 12:05:16,467 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:05:16,467 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 12:05:16,467 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:05:16,468 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 12:05:16,468 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-02-05 12:05:16,469 INFO  L87              Difference]: Start difference. First operand 18000 states and 20291 transitions. Second operand  has 4 states, 4 states have (on average 97.75) internal successors, (391), 3 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:05:18,698 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:05:18,698 INFO  L93              Difference]: Finished difference Result 45822 states and 51419 transitions.
[2025-02-05 12:05:18,698 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 12:05:18,699 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 97.75) internal successors, (391), 3 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 391
[2025-02-05 12:05:18,699 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:05:18,735 INFO  L225             Difference]: With dead ends: 45822
[2025-02-05 12:05:18,736 INFO  L226             Difference]: Without dead ends: 26973
[2025-02-05 12:05:18,825 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-02-05 12:05:18,828 INFO  L435           NwaCegarLoop]: 347 mSDtfsCounter, 523 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 2556 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 523 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 2720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 2556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time
[2025-02-05 12:05:18,828 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [523 Valid, 426 Invalid, 2720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 2556 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time]
[2025-02-05 12:05:18,836 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 26973 states.
[2025-02-05 12:05:18,966 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 26973 to 24819.
[2025-02-05 12:05:18,984 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 24819 states, 24818 states have (on average 1.120557659763075) internal successors, (27810), 24818 states have internal predecessors, (27810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:05:19,006 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 24819 states to 24819 states and 27810 transitions.
[2025-02-05 12:05:19,006 INFO  L78                 Accepts]: Start accepts. Automaton has 24819 states and 27810 transitions. Word has length 391
[2025-02-05 12:05:19,006 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:05:19,007 INFO  L471      AbstractCegarLoop]: Abstraction has 24819 states and 27810 transitions.
[2025-02-05 12:05:19,007 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 97.75) internal successors, (391), 3 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:05:19,007 INFO  L276                IsEmpty]: Start isEmpty. Operand 24819 states and 27810 transitions.
[2025-02-05 12:05:19,018 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 488
[2025-02-05 12:05:19,018 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:05:19,018 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 12:05:19,018 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-02-05 12:05:19,018 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:05:19,019 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:05:19,020 INFO  L85        PathProgramCache]: Analyzing trace with hash 1860346684, now seen corresponding path program 1 times
[2025-02-05 12:05:19,020 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:05:19,020 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495167237]
[2025-02-05 12:05:19,020 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:05:19,020 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:05:19,050 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 487 statements into 1 equivalence classes.
[2025-02-05 12:05:19,080 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 487 of 487 statements.
[2025-02-05 12:05:19,080 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:05:19,080 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:05:19,474 INFO  L134       CoverageAnalysis]: Checked inductivity of 418 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked.
[2025-02-05 12:05:19,474 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:05:19,475 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495167237]
[2025-02-05 12:05:19,475 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495167237] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 12:05:19,475 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 12:05:19,475 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 12:05:19,475 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152449262]
[2025-02-05 12:05:19,475 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:05:19,475 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 12:05:19,475 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:05:19,476 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 12:05:19,476 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 12:05:19,476 INFO  L87              Difference]: Start difference. First operand 24819 states and 27810 transitions. Second operand  has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:05:21,047 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:05:21,048 INFO  L93              Difference]: Finished difference Result 56883 states and 63708 transitions.
[2025-02-05 12:05:21,048 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 12:05:21,049 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 487
[2025-02-05 12:05:21,050 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:05:21,089 INFO  L225             Difference]: With dead ends: 56883
[2025-02-05 12:05:21,089 INFO  L226             Difference]: Without dead ends: 32066
[2025-02-05 12:05:21,104 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 12:05:21,105 INFO  L435           NwaCegarLoop]: 140 mSDtfsCounter, 466 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 1239 mSolverCounterSat, 348 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 1587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 348 IncrementalHoareTripleChecker+Valid, 1239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time
[2025-02-05 12:05:21,105 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [466 Valid, 169 Invalid, 1587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [348 Valid, 1239 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time]
[2025-02-05 12:05:21,123 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 32066 states.
[2025-02-05 12:05:21,312 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 32066 to 28646.
[2025-02-05 12:05:21,335 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 28646 states, 28645 states have (on average 1.1261302146971548) internal successors, (32258), 28645 states have internal predecessors, (32258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:05:21,360 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 28646 states to 28646 states and 32258 transitions.
[2025-02-05 12:05:21,361 INFO  L78                 Accepts]: Start accepts. Automaton has 28646 states and 32258 transitions. Word has length 487
[2025-02-05 12:05:21,362 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:05:21,363 INFO  L471      AbstractCegarLoop]: Abstraction has 28646 states and 32258 transitions.
[2025-02-05 12:05:21,363 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:05:21,363 INFO  L276                IsEmpty]: Start isEmpty. Operand 28646 states and 32258 transitions.
[2025-02-05 12:05:21,376 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 577
[2025-02-05 12:05:21,376 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:05:21,376 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-02-05 12:05:21,376 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-02-05 12:05:21,377 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:05:21,377 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:05:21,377 INFO  L85        PathProgramCache]: Analyzing trace with hash -1477553483, now seen corresponding path program 1 times
[2025-02-05 12:05:21,378 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:05:21,378 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682003937]
[2025-02-05 12:05:21,378 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:05:21,378 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:05:21,501 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 576 statements into 1 equivalence classes.
[2025-02-05 12:05:21,547 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 576 of 576 statements.
[2025-02-05 12:05:21,547 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:05:21,547 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:05:22,033 INFO  L134       CoverageAnalysis]: Checked inductivity of 499 backedges. 367 proven. 82 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked.
[2025-02-05 12:05:22,034 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:05:22,034 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682003937]
[2025-02-05 12:05:22,034 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682003937] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-05 12:05:22,034 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [926315431]
[2025-02-05 12:05:22,034 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:05:22,034 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 12:05:22,034 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 12:05:22,036 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-02-05 12:05:22,039 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2025-02-05 12:05:22,144 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 576 statements into 1 equivalence classes.
[2025-02-05 12:05:22,221 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 576 of 576 statements.
[2025-02-05 12:05:22,221 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:05:22,222 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:05:22,224 INFO  L256         TraceCheckSpWp]: Trace formula consists of 701 conjuncts, 5 conjuncts are in the unsatisfiable core
[2025-02-05 12:05:22,234 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-05 12:05:22,700 INFO  L134       CoverageAnalysis]: Checked inductivity of 499 backedges. 335 proven. 164 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 12:05:22,700 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-02-05 12:05:23,186 INFO  L134       CoverageAnalysis]: Checked inductivity of 499 backedges. 499 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 12:05:23,186 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [926315431] provided 1 perfect and 1 imperfect interpolant sequences
[2025-02-05 12:05:23,186 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences.
[2025-02-05 12:05:23,187 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [3, 4] total 7
[2025-02-05 12:05:23,187 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847052246]
[2025-02-05 12:05:23,187 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:05:23,187 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-05 12:05:23,187 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:05:23,188 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-05 12:05:23,188 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56
[2025-02-05 12:05:23,189 INFO  L87              Difference]: Start difference. First operand 28646 states and 32258 transitions. Second operand  has 5 states, 5 states have (on average 115.2) internal successors, (576), 4 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:05:25,977 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:05:25,978 INFO  L93              Difference]: Finished difference Result 89664 states and 101556 transitions.
[2025-02-05 12:05:25,978 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-05 12:05:25,978 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 115.2) internal successors, (576), 4 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 576
[2025-02-05 12:05:25,979 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:05:26,039 INFO  L225             Difference]: With dead ends: 89664
[2025-02-05 12:05:26,040 INFO  L226             Difference]: Without dead ends: 58461
[2025-02-05 12:05:26,069 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 1153 GetRequests, 1147 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56
[2025-02-05 12:05:26,073 INFO  L435           NwaCegarLoop]: 86 mSDtfsCounter, 1032 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 3234 mSolverCounterSat, 795 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1032 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 4029 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 795 IncrementalHoareTripleChecker+Valid, 3234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time
[2025-02-05 12:05:26,073 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1032 Valid, 221 Invalid, 4029 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [795 Valid, 3234 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time]
[2025-02-05 12:05:26,149 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 58461 states.
[2025-02-05 12:05:26,952 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 58461 to 57601.
[2025-02-05 12:05:27,056 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 57601 states, 57600 states have (on average 1.1174305555555555) internal successors, (64364), 57600 states have internal predecessors, (64364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:05:27,206 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 57601 states to 57601 states and 64364 transitions.
[2025-02-05 12:05:27,207 INFO  L78                 Accepts]: Start accepts. Automaton has 57601 states and 64364 transitions. Word has length 576
[2025-02-05 12:05:27,208 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:05:27,208 INFO  L471      AbstractCegarLoop]: Abstraction has 57601 states and 64364 transitions.
[2025-02-05 12:05:27,208 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 115.2) internal successors, (576), 4 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:05:27,208 INFO  L276                IsEmpty]: Start isEmpty. Operand 57601 states and 64364 transitions.
[2025-02-05 12:05:27,225 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 596
[2025-02-05 12:05:27,225 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:05:27,226 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 12:05:27,235 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2025-02-05 12:05:27,426 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 12:05:27,427 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:05:27,427 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:05:27,428 INFO  L85        PathProgramCache]: Analyzing trace with hash -1246355261, now seen corresponding path program 1 times
[2025-02-05 12:05:27,428 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:05:27,428 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49168013]
[2025-02-05 12:05:27,428 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:05:27,428 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:05:27,487 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 595 statements into 1 equivalence classes.
[2025-02-05 12:05:27,507 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 595 of 595 statements.
[2025-02-05 12:05:27,507 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:05:27,507 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:05:27,628 INFO  L134       CoverageAnalysis]: Checked inductivity of 769 backedges. 450 proven. 0 refuted. 0 times theorem prover too weak. 319 trivial. 0 not checked.
[2025-02-05 12:05:27,628 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:05:27,629 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49168013]
[2025-02-05 12:05:27,629 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49168013] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 12:05:27,629 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 12:05:27,629 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 12:05:27,629 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803544736]
[2025-02-05 12:05:27,629 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:05:27,630 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 12:05:27,630 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:05:27,630 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 12:05:27,631 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 12:05:27,631 INFO  L87              Difference]: Start difference. First operand 57601 states and 64364 transitions. Second operand  has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:05:29,139 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:05:29,140 INFO  L93              Difference]: Finished difference Result 122858 states and 137083 transitions.
[2025-02-05 12:05:29,140 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 12:05:29,140 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 595
[2025-02-05 12:05:29,140 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:05:29,221 INFO  L225             Difference]: With dead ends: 122858
[2025-02-05 12:05:29,221 INFO  L226             Difference]: Without dead ends: 62269
[2025-02-05 12:05:29,249 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 12:05:29,251 INFO  L435           NwaCegarLoop]: 669 mSDtfsCounter, 495 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 1170 mSolverCounterSat, 245 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 495 SdHoareTripleChecker+Valid, 716 SdHoareTripleChecker+Invalid, 1415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 245 IncrementalHoareTripleChecker+Valid, 1170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time
[2025-02-05 12:05:29,251 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [495 Valid, 716 Invalid, 1415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [245 Valid, 1170 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time]
[2025-02-05 12:05:29,297 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 62269 states.
[2025-02-05 12:05:29,970 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 62269 to 60558.
[2025-02-05 12:05:30,025 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 60558 states, 60557 states have (on average 1.096537146820351) internal successors, (66403), 60557 states have internal predecessors, (66403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:05:30,112 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 60558 states to 60558 states and 66403 transitions.
[2025-02-05 12:05:30,113 INFO  L78                 Accepts]: Start accepts. Automaton has 60558 states and 66403 transitions. Word has length 595
[2025-02-05 12:05:30,113 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:05:30,113 INFO  L471      AbstractCegarLoop]: Abstraction has 60558 states and 66403 transitions.
[2025-02-05 12:05:30,114 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:05:30,114 INFO  L276                IsEmpty]: Start isEmpty. Operand 60558 states and 66403 transitions.
[2025-02-05 12:05:30,140 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 620
[2025-02-05 12:05:30,140 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:05:30,141 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 12:05:30,141 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2025-02-05 12:05:30,141 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:05:30,142 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:05:30,142 INFO  L85        PathProgramCache]: Analyzing trace with hash 1447317063, now seen corresponding path program 1 times
[2025-02-05 12:05:30,142 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:05:30,142 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506083703]
[2025-02-05 12:05:30,142 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:05:30,142 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:05:30,359 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 619 statements into 1 equivalence classes.
[2025-02-05 12:05:30,386 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 619 of 619 statements.
[2025-02-05 12:05:30,386 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:05:30,386 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:05:30,603 INFO  L134       CoverageAnalysis]: Checked inductivity of 394 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked.
[2025-02-05 12:05:30,603 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:05:30,603 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506083703]
[2025-02-05 12:05:30,603 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506083703] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 12:05:30,603 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 12:05:30,603 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 12:05:30,603 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485046370]
[2025-02-05 12:05:30,604 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:05:30,604 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 12:05:30,604 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:05:30,604 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 12:05:30,604 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 12:05:30,605 INFO  L87              Difference]: Start difference. First operand 60558 states and 66403 transitions. Second operand  has 3 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:05:32,196 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:05:32,196 INFO  L93              Difference]: Finished difference Result 118982 states and 130446 transitions.
[2025-02-05 12:05:32,196 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 12:05:32,197 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 619
[2025-02-05 12:05:32,197 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:05:32,291 INFO  L225             Difference]: With dead ends: 118982
[2025-02-05 12:05:32,291 INFO  L226             Difference]: Without dead ends: 58426
[2025-02-05 12:05:32,332 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 12:05:32,332 INFO  L435           NwaCegarLoop]: 645 mSDtfsCounter, 443 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 1157 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 705 SdHoareTripleChecker+Invalid, 1282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 1157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time
[2025-02-05 12:05:32,332 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [443 Valid, 705 Invalid, 1282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 1157 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time]
[2025-02-05 12:05:32,389 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 58426 states.
[2025-02-05 12:05:32,962 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 58426 to 56297.
[2025-02-05 12:05:33,002 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 56297 states, 56296 states have (on average 1.0736464402444224) internal successors, (60442), 56296 states have internal predecessors, (60442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:05:33,057 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 56297 states to 56297 states and 60442 transitions.
[2025-02-05 12:05:33,058 INFO  L78                 Accepts]: Start accepts. Automaton has 56297 states and 60442 transitions. Word has length 619
[2025-02-05 12:05:33,059 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:05:33,059 INFO  L471      AbstractCegarLoop]: Abstraction has 56297 states and 60442 transitions.
[2025-02-05 12:05:33,059 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:05:33,059 INFO  L276                IsEmpty]: Start isEmpty. Operand 56297 states and 60442 transitions.
[2025-02-05 12:05:33,081 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 710
[2025-02-05 12:05:33,081 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:05:33,081 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 12:05:33,082 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2025-02-05 12:05:33,082 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:05:33,083 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:05:33,083 INFO  L85        PathProgramCache]: Analyzing trace with hash 2130845383, now seen corresponding path program 1 times
[2025-02-05 12:05:33,083 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:05:33,083 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054063155]
[2025-02-05 12:05:33,083 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:05:33,083 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:05:33,158 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 709 statements into 1 equivalence classes.
[2025-02-05 12:05:33,212 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 709 of 709 statements.
[2025-02-05 12:05:33,213 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:05:33,213 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:05:33,482 INFO  L134       CoverageAnalysis]: Checked inductivity of 769 backedges. 450 proven. 0 refuted. 0 times theorem prover too weak. 319 trivial. 0 not checked.
[2025-02-05 12:05:33,485 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:05:33,485 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054063155]
[2025-02-05 12:05:33,485 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054063155] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 12:05:33,485 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 12:05:33,485 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 12:05:33,737 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900199404]
[2025-02-05 12:05:33,741 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:05:33,742 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 12:05:33,744 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:05:33,745 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 12:05:33,745 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 12:05:33,745 INFO  L87              Difference]: Start difference. First operand 56297 states and 60442 transitions. Second operand  has 3 states, 3 states have (on average 158.33333333333334) internal successors, (475), 3 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:05:35,392 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:05:35,392 INFO  L93              Difference]: Finished difference Result 121099 states and 129917 transitions.
[2025-02-05 12:05:35,393 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 12:05:35,393 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 158.33333333333334) internal successors, (475), 3 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 709
[2025-02-05 12:05:35,394 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:05:35,480 INFO  L225             Difference]: With dead ends: 121099
[2025-02-05 12:05:35,481 INFO  L226             Difference]: Without dead ends: 64804
[2025-02-05 12:05:35,525 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 12:05:35,526 INFO  L435           NwaCegarLoop]: 321 mSDtfsCounter, 442 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 1186 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 442 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 1281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 1186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time
[2025-02-05 12:05:35,526 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [442 Valid, 377 Invalid, 1281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 1186 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time]
[2025-02-05 12:05:35,577 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 64804 states.
[2025-02-05 12:05:36,442 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 64804 to 62672.
[2025-02-05 12:05:36,493 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 62672 states, 62671 states have (on average 1.0706866014584098) internal successors, (67101), 62671 states have internal predecessors, (67101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:05:36,556 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 62672 states to 62672 states and 67101 transitions.
[2025-02-05 12:05:36,557 INFO  L78                 Accepts]: Start accepts. Automaton has 62672 states and 67101 transitions. Word has length 709
[2025-02-05 12:05:36,558 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:05:36,558 INFO  L471      AbstractCegarLoop]: Abstraction has 62672 states and 67101 transitions.
[2025-02-05 12:05:36,558 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 158.33333333333334) internal successors, (475), 3 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:05:36,558 INFO  L276                IsEmpty]: Start isEmpty. Operand 62672 states and 67101 transitions.
[2025-02-05 12:05:36,579 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 736
[2025-02-05 12:05:36,580 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:05:36,580 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-02-05 12:05:36,580 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2025-02-05 12:05:36,580 INFO  L396      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:05:36,581 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:05:36,581 INFO  L85        PathProgramCache]: Analyzing trace with hash 1618959852, now seen corresponding path program 1 times
[2025-02-05 12:05:36,581 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:05:36,581 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690447902]
[2025-02-05 12:05:36,581 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:05:36,581 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:05:36,646 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 735 statements into 1 equivalence classes.
[2025-02-05 12:05:36,993 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 735 of 735 statements.
[2025-02-05 12:05:36,996 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:05:36,996 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:05:37,669 INFO  L134       CoverageAnalysis]: Checked inductivity of 863 backedges. 618 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked.
[2025-02-05 12:05:37,670 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:05:37,670 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690447902]
[2025-02-05 12:05:37,670 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690447902] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 12:05:37,670 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 12:05:37,670 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-05 12:05:37,671 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874026122]
[2025-02-05 12:05:37,671 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:05:37,671 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 12:05:37,672 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:05:37,672 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 12:05:37,673 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-02-05 12:05:37,673 INFO  L87              Difference]: Start difference. First operand 62672 states and 67101 transitions. Second operand  has 4 states, 4 states have (on average 143.25) internal successors, (573), 4 states have internal predecessors, (573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:05:40,242 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:05:40,242 INFO  L93              Difference]: Finished difference Result 145788 states and 155878 transitions.
[2025-02-05 12:05:40,243 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 12:05:40,243 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 143.25) internal successors, (573), 4 states have internal predecessors, (573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 735
[2025-02-05 12:05:40,243 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:05:40,344 INFO  L225             Difference]: With dead ends: 145788
[2025-02-05 12:05:40,344 INFO  L226             Difference]: Without dead ends: 81418
[2025-02-05 12:05:40,387 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-02-05 12:05:40,388 INFO  L435           NwaCegarLoop]: 131 mSDtfsCounter, 642 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 2392 mSolverCounterSat, 426 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 642 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 2818 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 426 IncrementalHoareTripleChecker+Valid, 2392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time
[2025-02-05 12:05:40,388 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [642 Valid, 196 Invalid, 2818 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [426 Valid, 2392 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time]
[2025-02-05 12:05:40,442 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 81418 states.
[2025-02-05 12:05:41,232 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 81418 to 73305.
[2025-02-05 12:05:41,289 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 73305 states, 73304 states have (on average 1.0696551347811851) internal successors, (78410), 73304 states have internal predecessors, (78410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:05:41,358 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 73305 states to 73305 states and 78410 transitions.
[2025-02-05 12:05:41,360 INFO  L78                 Accepts]: Start accepts. Automaton has 73305 states and 78410 transitions. Word has length 735
[2025-02-05 12:05:41,360 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:05:41,360 INFO  L471      AbstractCegarLoop]: Abstraction has 73305 states and 78410 transitions.
[2025-02-05 12:05:41,360 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 143.25) internal successors, (573), 4 states have internal predecessors, (573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:05:41,360 INFO  L276                IsEmpty]: Start isEmpty. Operand 73305 states and 78410 transitions.
[2025-02-05 12:05:41,387 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 787
[2025-02-05 12:05:41,387 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:05:41,387 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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]
[2025-02-05 12:05:41,387 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2025-02-05 12:05:41,387 INFO  L396      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:05:41,388 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:05:41,614 INFO  L85        PathProgramCache]: Analyzing trace with hash 1078302388, now seen corresponding path program 1 times
[2025-02-05 12:05:41,615 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:05:41,615 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646004509]
[2025-02-05 12:05:41,615 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:05:41,615 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:05:41,660 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 786 statements into 1 equivalence classes.
[2025-02-05 12:05:41,689 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 786 of 786 statements.
[2025-02-05 12:05:41,690 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:05:41,690 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:05:41,898 INFO  L134       CoverageAnalysis]: Checked inductivity of 1161 backedges. 249 proven. 0 refuted. 0 times theorem prover too weak. 912 trivial. 0 not checked.
[2025-02-05 12:05:41,898 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:05:41,898 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646004509]
[2025-02-05 12:05:41,898 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646004509] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 12:05:41,898 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 12:05:41,899 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 12:05:41,899 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080675337]
[2025-02-05 12:05:41,899 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:05:41,899 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 12:05:41,899 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:05:41,900 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 12:05:41,900 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 12:05:41,900 INFO  L87              Difference]: Start difference. First operand 73305 states and 78410 transitions. Second operand  has 3 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:05:43,441 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:05:43,442 INFO  L93              Difference]: Finished difference Result 145310 states and 155203 transitions.
[2025-02-05 12:05:43,442 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 12:05:43,442 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 786
[2025-02-05 12:05:43,443 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:05:43,531 INFO  L225             Difference]: With dead ends: 145310
[2025-02-05 12:05:43,532 INFO  L226             Difference]: Without dead ends: 69877
[2025-02-05 12:05:43,582 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 12:05:43,582 INFO  L435           NwaCegarLoop]: 683 mSDtfsCounter, 455 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 1101 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 455 SdHoareTripleChecker+Valid, 728 SdHoareTripleChecker+Invalid, 1216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 1101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time
[2025-02-05 12:05:43,583 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [455 Valid, 728 Invalid, 1216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 1101 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time]
[2025-02-05 12:05:43,637 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 69877 states.
[2025-02-05 12:05:44,455 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 69877 to 67748.
[2025-02-05 12:05:44,512 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 67748 states, 67747 states have (on average 1.0606816538001682) internal successors, (71858), 67747 states have internal predecessors, (71858), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:05:44,607 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 67748 states to 67748 states and 71858 transitions.
[2025-02-05 12:05:44,609 INFO  L78                 Accepts]: Start accepts. Automaton has 67748 states and 71858 transitions. Word has length 786
[2025-02-05 12:05:44,610 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:05:44,610 INFO  L471      AbstractCegarLoop]: Abstraction has 67748 states and 71858 transitions.
[2025-02-05 12:05:44,610 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:05:44,610 INFO  L276                IsEmpty]: Start isEmpty. Operand 67748 states and 71858 transitions.
[2025-02-05 12:05:44,657 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 866
[2025-02-05 12:05:44,657 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:05:44,658 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-02-05 12:05:44,658 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2025-02-05 12:05:44,658 INFO  L396      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:05:44,659 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:05:44,659 INFO  L85        PathProgramCache]: Analyzing trace with hash -1439925697, now seen corresponding path program 1 times
[2025-02-05 12:05:44,659 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:05:44,659 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584891325]
[2025-02-05 12:05:44,659 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:05:44,659 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:05:44,739 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 865 statements into 1 equivalence classes.
[2025-02-05 12:05:44,792 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 865 of 865 statements.
[2025-02-05 12:05:44,793 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:05:44,793 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:05:45,707 INFO  L134       CoverageAnalysis]: Checked inductivity of 1328 backedges. 1028 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked.
[2025-02-05 12:05:45,707 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:05:45,707 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584891325]
[2025-02-05 12:05:45,707 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584891325] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 12:05:45,707 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 12:05:45,708 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-05 12:05:45,708 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649643002]
[2025-02-05 12:05:45,708 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:05:45,709 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 12:05:45,709 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:05:45,710 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 12:05:45,710 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-02-05 12:05:45,710 INFO  L87              Difference]: Start difference. First operand 67748 states and 71858 transitions. Second operand  has 4 states, 4 states have (on average 154.25) internal successors, (617), 4 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:05:48,044 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:05:48,045 INFO  L93              Difference]: Finished difference Result 157247 states and 167405 transitions.
[2025-02-05 12:05:48,045 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 12:05:48,045 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 154.25) internal successors, (617), 4 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 865
[2025-02-05 12:05:48,046 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:05:48,154 INFO  L225             Difference]: With dead ends: 157247
[2025-02-05 12:05:48,154 INFO  L226             Difference]: Without dead ends: 89926
[2025-02-05 12:05:48,202 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-02-05 12:05:48,203 INFO  L435           NwaCegarLoop]: 76 mSDtfsCounter, 753 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 2229 mSolverCounterSat, 369 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 753 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 2598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 369 IncrementalHoareTripleChecker+Valid, 2229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time
[2025-02-05 12:05:48,203 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [753 Valid, 158 Invalid, 2598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [369 Valid, 2229 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time]
[2025-02-05 12:05:48,274 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 89926 states.
[2025-02-05 12:05:49,481 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 89926 to 84811.
[2025-02-05 12:05:49,548 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 84811 states, 84810 states have (on average 1.0675863695318948) internal successors, (90542), 84810 states have internal predecessors, (90542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:05:49,664 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 84811 states to 84811 states and 90542 transitions.
[2025-02-05 12:05:49,666 INFO  L78                 Accepts]: Start accepts. Automaton has 84811 states and 90542 transitions. Word has length 865
[2025-02-05 12:05:49,666 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:05:49,667 INFO  L471      AbstractCegarLoop]: Abstraction has 84811 states and 90542 transitions.
[2025-02-05 12:05:49,667 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 154.25) internal successors, (617), 4 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:05:49,667 INFO  L276                IsEmpty]: Start isEmpty. Operand 84811 states and 90542 transitions.
[2025-02-05 12:05:49,729 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 971
[2025-02-05 12:05:49,729 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:05:49,729 INFO  L218           NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-02-05 12:05:49,729 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2025-02-05 12:05:49,730 INFO  L396      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:05:49,730 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:05:49,730 INFO  L85        PathProgramCache]: Analyzing trace with hash -2023912935, now seen corresponding path program 1 times
[2025-02-05 12:05:49,730 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:05:49,730 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438741720]
[2025-02-05 12:05:49,730 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:05:49,730 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:05:49,817 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 970 statements into 1 equivalence classes.
[2025-02-05 12:05:49,847 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 970 of 970 statements.
[2025-02-05 12:05:49,847 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:05:49,847 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:05:50,513 INFO  L134       CoverageAnalysis]: Checked inductivity of 1828 backedges. 996 proven. 0 refuted. 0 times theorem prover too weak. 832 trivial. 0 not checked.
[2025-02-05 12:05:50,513 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:05:50,513 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438741720]
[2025-02-05 12:05:50,513 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438741720] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 12:05:50,513 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 12:05:50,513 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-02-05 12:05:50,514 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767149204]
[2025-02-05 12:05:50,514 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:05:50,514 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 12:05:50,517 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:05:50,518 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 12:05:50,518 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 12:05:50,518 INFO  L87              Difference]: Start difference. First operand 84811 states and 90542 transitions. Second operand  has 3 states, 3 states have (on average 147.33333333333334) internal successors, (442), 2 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:05:51,408 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:05:51,409 INFO  L93              Difference]: Finished difference Result 150428 states and 160504 transitions.
[2025-02-05 12:05:51,409 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 12:05:51,409 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 147.33333333333334) internal successors, (442), 2 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 970
[2025-02-05 12:05:51,410 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:05:51,477 INFO  L225             Difference]: With dead ends: 150428
[2025-02-05 12:05:51,477 INFO  L226             Difference]: Without dead ends: 66043
[2025-02-05 12:05:51,524 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 12:05:51,525 INFO  L435           NwaCegarLoop]: 69 mSDtfsCounter, 554 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 615 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 554 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-02-05 12:05:51,527 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [554 Valid, 69 Invalid, 621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 615 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-02-05 12:05:51,566 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 66043 states.
[2025-02-05 12:05:52,346 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 66043 to 65615.
[2025-02-05 12:05:52,394 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 65615 states, 65614 states have (on average 1.0654433505044656) internal successors, (69908), 65614 states have internal predecessors, (69908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:05:52,452 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 65615 states to 65615 states and 69908 transitions.
[2025-02-05 12:05:52,454 INFO  L78                 Accepts]: Start accepts. Automaton has 65615 states and 69908 transitions. Word has length 970
[2025-02-05 12:05:52,454 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:05:52,454 INFO  L471      AbstractCegarLoop]: Abstraction has 65615 states and 69908 transitions.
[2025-02-05 12:05:52,454 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 147.33333333333334) internal successors, (442), 2 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:05:52,454 INFO  L276                IsEmpty]: Start isEmpty. Operand 65615 states and 69908 transitions.
[2025-02-05 12:05:52,486 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1000
[2025-02-05 12:05:52,486 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:05:52,486 INFO  L218           NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 12:05:52,486 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2025-02-05 12:05:52,486 INFO  L396      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:05:52,487 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:05:52,487 INFO  L85        PathProgramCache]: Analyzing trace with hash -157874911, now seen corresponding path program 1 times
[2025-02-05 12:05:52,487 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:05:52,487 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818021087]
[2025-02-05 12:05:52,487 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:05:52,487 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:05:52,558 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 999 statements into 1 equivalence classes.
[2025-02-05 12:05:52,618 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 999 of 999 statements.
[2025-02-05 12:05:52,618 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:05:52,618 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:05:53,836 INFO  L134       CoverageAnalysis]: Checked inductivity of 1904 backedges. 1327 proven. 0 refuted. 0 times theorem prover too weak. 577 trivial. 0 not checked.
[2025-02-05 12:05:53,841 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:05:53,841 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818021087]
[2025-02-05 12:05:53,841 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818021087] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 12:05:53,841 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 12:05:53,841 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-05 12:05:53,841 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875773807]
[2025-02-05 12:05:53,841 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:05:53,842 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 12:05:53,842 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:05:53,843 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 12:05:53,843 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-05 12:05:53,843 INFO  L87              Difference]: Start difference. First operand 65615 states and 69908 transitions. Second operand  has 4 states, 4 states have (on average 167.75) internal successors, (671), 4 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:05:56,391 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:05:56,391 INFO  L93              Difference]: Finished difference Result 141441 states and 150713 transitions.
[2025-02-05 12:05:56,391 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 12:05:56,392 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 167.75) internal successors, (671), 4 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 999
[2025-02-05 12:05:56,392 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:05:56,496 INFO  L225             Difference]: With dead ends: 141441
[2025-02-05 12:05:56,496 INFO  L226             Difference]: Without dead ends: 76253
[2025-02-05 12:05:56,543 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-05 12:05:56,544 INFO  L435           NwaCegarLoop]: 201 mSDtfsCounter, 605 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 2687 mSolverCounterSat, 282 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 605 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 2969 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 282 IncrementalHoareTripleChecker+Valid, 2687 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time
[2025-02-05 12:05:56,544 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [605 Valid, 282 Invalid, 2969 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [282 Valid, 2687 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time]
[2025-02-05 12:05:56,598 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 76253 states.
[2025-02-05 12:05:57,382 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 76253 to 69444.
[2025-02-05 12:05:57,432 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 69444 states, 69443 states have (on average 1.0593292340480682) internal successors, (73563), 69443 states have internal predecessors, (73563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:05:57,498 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 69444 states to 69444 states and 73563 transitions.
[2025-02-05 12:05:57,502 INFO  L78                 Accepts]: Start accepts. Automaton has 69444 states and 73563 transitions. Word has length 999
[2025-02-05 12:05:57,502 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:05:57,502 INFO  L471      AbstractCegarLoop]: Abstraction has 69444 states and 73563 transitions.
[2025-02-05 12:05:57,503 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 167.75) internal successors, (671), 4 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:05:57,503 INFO  L276                IsEmpty]: Start isEmpty. Operand 69444 states and 73563 transitions.
[2025-02-05 12:05:57,536 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1073
[2025-02-05 12:05:57,536 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:05:57,537 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-02-05 12:05:57,537 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2025-02-05 12:05:57,537 INFO  L396      AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:05:57,538 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:05:57,538 INFO  L85        PathProgramCache]: Analyzing trace with hash 779462945, now seen corresponding path program 1 times
[2025-02-05 12:05:57,538 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:05:57,538 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72528376]
[2025-02-05 12:05:57,538 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:05:57,539 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:05:57,627 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1072 statements into 1 equivalence classes.
[2025-02-05 12:05:57,682 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1072 of 1072 statements.
[2025-02-05 12:05:57,682 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:05:57,682 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:05:58,323 INFO  L134       CoverageAnalysis]: Checked inductivity of 1597 backedges. 1278 proven. 0 refuted. 0 times theorem prover too weak. 319 trivial. 0 not checked.
[2025-02-05 12:05:58,323 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:05:58,323 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72528376]
[2025-02-05 12:05:58,323 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72528376] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 12:05:58,323 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 12:05:58,323 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-05 12:05:58,323 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672127630]
[2025-02-05 12:05:58,323 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:05:58,324 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 12:05:58,324 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:05:58,324 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 12:05:58,325 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-02-05 12:05:58,326 INFO  L87              Difference]: Start difference. First operand 69444 states and 73563 transitions. Second operand  has 4 states, 4 states have (on average 209.5) internal successors, (838), 4 states have internal predecessors, (838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:06:00,663 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:06:00,663 INFO  L93              Difference]: Finished difference Result 157596 states and 166617 transitions.
[2025-02-05 12:06:00,663 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 12:06:00,664 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 209.5) internal successors, (838), 4 states have internal predecessors, (838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1072
[2025-02-05 12:06:00,664 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:06:00,758 INFO  L225             Difference]: With dead ends: 157596
[2025-02-05 12:06:00,758 INFO  L226             Difference]: Without dead ends: 87302
[2025-02-05 12:06:00,801 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-02-05 12:06:00,804 INFO  L435           NwaCegarLoop]: 588 mSDtfsCounter, 617 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 2196 mSolverCounterSat, 282 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 617 SdHoareTripleChecker+Valid, 634 SdHoareTripleChecker+Invalid, 2478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 282 IncrementalHoareTripleChecker+Valid, 2196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time
[2025-02-05 12:06:00,804 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [617 Valid, 634 Invalid, 2478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [282 Valid, 2196 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time]
[2025-02-05 12:06:00,871 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 87302 states.
[2025-02-05 12:06:01,850 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 87302 to 68589.
[2025-02-05 12:06:01,898 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 68589 states, 68588 states have (on average 1.0567883594797924) internal successors, (72483), 68588 states have internal predecessors, (72483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:06:01,964 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 68589 states to 68589 states and 72483 transitions.
[2025-02-05 12:06:01,966 INFO  L78                 Accepts]: Start accepts. Automaton has 68589 states and 72483 transitions. Word has length 1072
[2025-02-05 12:06:01,968 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:06:01,968 INFO  L471      AbstractCegarLoop]: Abstraction has 68589 states and 72483 transitions.
[2025-02-05 12:06:01,968 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 209.5) internal successors, (838), 4 states have internal predecessors, (838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:06:01,968 INFO  L276                IsEmpty]: Start isEmpty. Operand 68589 states and 72483 transitions.
[2025-02-05 12:06:02,004 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1080
[2025-02-05 12:06:02,004 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:06:02,005 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 12:06:02,005 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2025-02-05 12:06:02,005 INFO  L396      AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:06:02,008 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:06:02,008 INFO  L85        PathProgramCache]: Analyzing trace with hash 746124374, now seen corresponding path program 1 times
[2025-02-05 12:06:02,008 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:06:02,008 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535922136]
[2025-02-05 12:06:02,008 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:06:02,008 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:06:02,134 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1079 statements into 1 equivalence classes.
[2025-02-05 12:06:02,218 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1079 of 1079 statements.
[2025-02-05 12:06:02,218 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:06:02,218 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:06:03,901 INFO  L134       CoverageAnalysis]: Checked inductivity of 1599 backedges. 1170 proven. 0 refuted. 0 times theorem prover too weak. 429 trivial. 0 not checked.
[2025-02-05 12:06:03,901 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:06:03,901 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535922136]
[2025-02-05 12:06:03,901 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535922136] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 12:06:03,901 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 12:06:03,901 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 12:06:03,902 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884279163]
[2025-02-05 12:06:03,902 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:06:03,902 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 12:06:03,903 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:06:03,903 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 12:06:03,903 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 12:06:03,903 INFO  L87              Difference]: Start difference. First operand 68589 states and 72483 transitions. Second operand  has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:06:05,486 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:06:05,486 INFO  L93              Difference]: Finished difference Result 138880 states and 146736 transitions.
[2025-02-05 12:06:05,487 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 12:06:05,487 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1079
[2025-02-05 12:06:05,487 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:06:05,573 INFO  L225             Difference]: With dead ends: 138880
[2025-02-05 12:06:05,573 INFO  L226             Difference]: Without dead ends: 70718
[2025-02-05 12:06:05,609 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 12:06:05,609 INFO  L435           NwaCegarLoop]: 677 mSDtfsCounter, 113 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 1078 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 1110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1078 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time
[2025-02-05 12:06:05,609 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 714 Invalid, 1110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1078 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time]
[2025-02-05 12:06:05,661 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 70718 states.
[2025-02-05 12:06:06,193 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 70718 to 68590.
[2025-02-05 12:06:06,247 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 68590 states, 68589 states have (on average 1.0558835964950648) internal successors, (72422), 68589 states have internal predecessors, (72422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:06:06,316 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 68590 states to 68590 states and 72422 transitions.
[2025-02-05 12:06:06,318 INFO  L78                 Accepts]: Start accepts. Automaton has 68590 states and 72422 transitions. Word has length 1079
[2025-02-05 12:06:06,318 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:06:06,318 INFO  L471      AbstractCegarLoop]: Abstraction has 68590 states and 72422 transitions.
[2025-02-05 12:06:06,318 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:06:06,318 INFO  L276                IsEmpty]: Start isEmpty. Operand 68590 states and 72422 transitions.
[2025-02-05 12:06:06,376 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1233
[2025-02-05 12:06:06,377 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:06:06,377 INFO  L218           NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-02-05 12:06:06,377 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2025-02-05 12:06:06,377 INFO  L396      AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:06:06,378 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:06:06,378 INFO  L85        PathProgramCache]: Analyzing trace with hash -1927399194, now seen corresponding path program 1 times
[2025-02-05 12:06:06,378 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:06:06,378 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877837894]
[2025-02-05 12:06:06,378 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:06:06,379 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:06:06,592 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1232 statements into 1 equivalence classes.
[2025-02-05 12:06:06,646 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1232 of 1232 statements.
[2025-02-05 12:06:06,649 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:06:06,650 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:06:07,346 INFO  L134       CoverageAnalysis]: Checked inductivity of 2274 backedges. 1233 proven. 0 refuted. 0 times theorem prover too weak. 1041 trivial. 0 not checked.
[2025-02-05 12:06:07,347 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:06:07,347 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877837894]
[2025-02-05 12:06:07,347 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877837894] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 12:06:07,347 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 12:06:07,347 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 12:06:07,347 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126762762]
[2025-02-05 12:06:07,347 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:06:07,348 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 12:06:07,348 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:06:07,349 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 12:06:07,349 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 12:06:07,349 INFO  L87              Difference]: Start difference. First operand 68590 states and 72422 transitions. Second operand  has 3 states, 3 states have (on average 183.33333333333334) internal successors, (550), 3 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:06:08,843 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:06:08,845 INFO  L93              Difference]: Finished difference Result 142300 states and 150225 transitions.
[2025-02-05 12:06:08,846 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 12:06:08,846 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 183.33333333333334) internal successors, (550), 3 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1232
[2025-02-05 12:06:08,846 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:06:09,022 INFO  L225             Difference]: With dead ends: 142300
[2025-02-05 12:06:09,025 INFO  L226             Difference]: Without dead ends: 74137
[2025-02-05 12:06:09,111 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 12:06:09,117 INFO  L435           NwaCegarLoop]: 187 mSDtfsCounter, 402 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 1138 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 1302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 1138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time
[2025-02-05 12:06:09,119 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [402 Valid, 218 Invalid, 1302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 1138 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time]
[2025-02-05 12:06:09,234 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 74137 states.
[2025-02-05 12:06:10,097 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 74137 to 70719.
[2025-02-05 12:06:10,152 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 70719 states, 70718 states have (on average 1.054512288243446) internal successors, (74573), 70718 states have internal predecessors, (74573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:06:10,244 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 70719 states to 70719 states and 74573 transitions.
[2025-02-05 12:06:10,246 INFO  L78                 Accepts]: Start accepts. Automaton has 70719 states and 74573 transitions. Word has length 1232
[2025-02-05 12:06:10,246 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:06:10,246 INFO  L471      AbstractCegarLoop]: Abstraction has 70719 states and 74573 transitions.
[2025-02-05 12:06:10,246 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 183.33333333333334) internal successors, (550), 3 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:06:10,246 INFO  L276                IsEmpty]: Start isEmpty. Operand 70719 states and 74573 transitions.
[2025-02-05 12:06:10,314 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1297
[2025-02-05 12:06:10,314 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:06:10,315 INFO  L218           NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-02-05 12:06:10,315 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2025-02-05 12:06:10,315 INFO  L396      AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:06:10,316 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:06:10,316 INFO  L85        PathProgramCache]: Analyzing trace with hash -1751823372, now seen corresponding path program 1 times
[2025-02-05 12:06:10,316 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:06:10,316 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38686966]
[2025-02-05 12:06:10,316 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:06:10,317 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:06:10,437 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1296 statements into 1 equivalence classes.
[2025-02-05 12:06:10,514 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1296 of 1296 statements.
[2025-02-05 12:06:10,514 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:06:10,515 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:06:11,363 INFO  L134       CoverageAnalysis]: Checked inductivity of 2526 backedges. 2171 proven. 0 refuted. 0 times theorem prover too weak. 355 trivial. 0 not checked.
[2025-02-05 12:06:11,364 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:06:11,364 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38686966]
[2025-02-05 12:06:11,364 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38686966] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 12:06:11,364 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 12:06:11,364 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-05 12:06:11,364 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681419332]
[2025-02-05 12:06:11,364 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:06:11,365 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-05 12:06:11,365 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:06:11,366 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-05 12:06:11,366 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20
[2025-02-05 12:06:11,366 INFO  L87              Difference]: Start difference. First operand 70719 states and 74573 transitions. Second operand  has 5 states, 5 states have (on average 205.2) internal successors, (1026), 5 states have internal predecessors, (1026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:06:14,299 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:06:14,299 INFO  L93              Difference]: Finished difference Result 169548 states and 178566 transitions.
[2025-02-05 12:06:14,299 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-05 12:06:14,300 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 205.2) internal successors, (1026), 5 states have internal predecessors, (1026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1296
[2025-02-05 12:06:14,300 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:06:14,414 INFO  L225             Difference]: With dead ends: 169548
[2025-02-05 12:06:14,414 INFO  L226             Difference]: Without dead ends: 99256
[2025-02-05 12:06:14,458 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20
[2025-02-05 12:06:14,458 INFO  L435           NwaCegarLoop]: 67 mSDtfsCounter, 915 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 2577 mSolverCounterSat, 480 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 915 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 3057 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 480 IncrementalHoareTripleChecker+Valid, 2577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time
[2025-02-05 12:06:14,459 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [915 Valid, 137 Invalid, 3057 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [480 Valid, 2577 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time]
[2025-02-05 12:06:14,528 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 99256 states.
[2025-02-05 12:06:15,581 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 99256 to 91594.
[2025-02-05 12:06:15,654 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 91594 states, 91593 states have (on average 1.050167589226251) internal successors, (96188), 91593 states have internal predecessors, (96188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:06:15,754 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 91594 states to 91594 states and 96188 transitions.
[2025-02-05 12:06:15,756 INFO  L78                 Accepts]: Start accepts. Automaton has 91594 states and 96188 transitions. Word has length 1296
[2025-02-05 12:06:15,757 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:06:15,757 INFO  L471      AbstractCegarLoop]: Abstraction has 91594 states and 96188 transitions.
[2025-02-05 12:06:15,757 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 205.2) internal successors, (1026), 5 states have internal predecessors, (1026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:06:15,758 INFO  L276                IsEmpty]: Start isEmpty. Operand 91594 states and 96188 transitions.
[2025-02-05 12:06:15,821 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1484
[2025-02-05 12:06:15,821 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:06:15,822 INFO  L218           NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-02-05 12:06:15,822 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2025-02-05 12:06:15,822 INFO  L396      AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:06:15,822 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:06:15,823 INFO  L85        PathProgramCache]: Analyzing trace with hash -1694804240, now seen corresponding path program 1 times
[2025-02-05 12:06:15,823 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:06:15,823 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908602565]
[2025-02-05 12:06:15,823 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:06:15,823 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:06:15,915 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1483 statements into 1 equivalence classes.
[2025-02-05 12:06:15,958 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1483 of 1483 statements.
[2025-02-05 12:06:15,959 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:06:15,959 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:06:17,178 INFO  L134       CoverageAnalysis]: Checked inductivity of 3379 backedges. 2115 proven. 0 refuted. 0 times theorem prover too weak. 1264 trivial. 0 not checked.
[2025-02-05 12:06:17,179 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:06:17,179 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908602565]
[2025-02-05 12:06:17,179 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908602565] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 12:06:17,179 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 12:06:17,179 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-05 12:06:17,179 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734751165]
[2025-02-05 12:06:17,179 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:06:17,180 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 12:06:17,180 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:06:17,181 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 12:06:17,181 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-02-05 12:06:17,181 INFO  L87              Difference]: Start difference. First operand 91594 states and 96188 transitions. Second operand  has 4 states, 4 states have (on average 165.25) internal successors, (661), 4 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:06:19,471 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:06:19,471 INFO  L93              Difference]: Finished difference Result 190878 states and 200413 transitions.
[2025-02-05 12:06:19,472 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 12:06:19,472 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 165.25) internal successors, (661), 4 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1483
[2025-02-05 12:06:19,472 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:06:19,599 INFO  L225             Difference]: With dead ends: 190878
[2025-02-05 12:06:19,599 INFO  L226             Difference]: Without dead ends: 99711
[2025-02-05 12:06:19,635 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-02-05 12:06:19,635 INFO  L435           NwaCegarLoop]: 125 mSDtfsCounter, 794 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 2161 mSolverCounterSat, 274 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 794 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 2435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 274 IncrementalHoareTripleChecker+Valid, 2161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time
[2025-02-05 12:06:19,636 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [794 Valid, 189 Invalid, 2435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [274 Valid, 2161 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time]
[2025-02-05 12:06:19,707 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 99711 states.
[2025-02-05 12:06:20,804 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 99711 to 85642.
[2025-02-05 12:06:20,853 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 85642 states, 85641 states have (on average 1.0488784577480412) internal successors, (89827), 85641 states have internal predecessors, (89827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:06:20,933 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 85642 states to 85642 states and 89827 transitions.
[2025-02-05 12:06:20,935 INFO  L78                 Accepts]: Start accepts. Automaton has 85642 states and 89827 transitions. Word has length 1483
[2025-02-05 12:06:20,935 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:06:20,935 INFO  L471      AbstractCegarLoop]: Abstraction has 85642 states and 89827 transitions.
[2025-02-05 12:06:20,935 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 165.25) internal successors, (661), 4 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:06:20,936 INFO  L276                IsEmpty]: Start isEmpty. Operand 85642 states and 89827 transitions.
[2025-02-05 12:06:20,987 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1490
[2025-02-05 12:06:20,988 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:06:20,988 INFO  L218           NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-02-05 12:06:20,988 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2025-02-05 12:06:20,989 INFO  L396      AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:06:20,989 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:06:20,989 INFO  L85        PathProgramCache]: Analyzing trace with hash -263349652, now seen corresponding path program 1 times
[2025-02-05 12:06:20,989 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:06:20,989 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524120757]
[2025-02-05 12:06:20,990 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:06:20,990 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:06:21,070 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1489 statements into 1 equivalence classes.
[2025-02-05 12:06:21,106 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1489 of 1489 statements.
[2025-02-05 12:06:21,106 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:06:21,106 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:06:21,921 INFO  L134       CoverageAnalysis]: Checked inductivity of 3407 backedges. 2137 proven. 0 refuted. 0 times theorem prover too weak. 1270 trivial. 0 not checked.
[2025-02-05 12:06:21,921 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:06:21,921 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524120757]
[2025-02-05 12:06:21,921 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524120757] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 12:06:21,922 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 12:06:21,922 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-05 12:06:21,922 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214930709]
[2025-02-05 12:06:21,922 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:06:21,922 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 12:06:21,922 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:06:21,923 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 12:06:21,923 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-02-05 12:06:21,923 INFO  L87              Difference]: Start difference. First operand 85642 states and 89827 transitions. Second operand  has 4 states, 4 states have (on average 165.25) internal successors, (661), 4 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)