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


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


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

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


Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 839a6dcefe0eda0c15199e733b50fa28a6af9f9aed319dba01e519ca448457f3
[2025-03-03 11:04:53,517 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-03-03 11:04:53,522 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-03-03 11:04:53,524 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-03-03 11:04:53,525 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-03-03 11:04:53,525 INFO  L274        PluginConnector]: CDTParser initialized
[2025-03-03 11:04:53,526 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem18_label20.c
[2025-03-03 11:04:54,625 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/056b8cfb2/02946842970b44d3819b062c3323e4a1/FLAGbf0017bdd
[2025-03-03 11:04:55,057 INFO  L384              CDTParser]: Found 1 translation units.
[2025-03-03 11:04:55,058 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem18_label20.c
[2025-03-03 11:04:55,079 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/056b8cfb2/02946842970b44d3819b062c3323e4a1/FLAGbf0017bdd
[2025-03-03 11:04:55,184 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/056b8cfb2/02946842970b44d3819b062c3323e4a1
[2025-03-03 11:04:55,185 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-03-03 11:04:55,186 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-03-03 11:04:55,187 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-03-03 11:04:55,187 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-03-03 11:04:55,190 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-03-03 11:04:55,190 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:04:55" (1/1) ...
[2025-03-03 11:04:55,191 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b5066bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:04:55, skipping insertion in model container
[2025-03-03 11:04:55,191 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:04:55" (1/1) ...
[2025-03-03 11:04:55,261 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-03-03 11:04:55,413 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem18_label20.c[1084,1097]
[2025-03-03 11:04:55,854 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-03 11:04:55,862 INFO  L200         MainTranslator]: Completed pre-run
[2025-03-03 11:04:55,871 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem18_label20.c[1084,1097]
[2025-03-03 11:04:56,029 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-03 11:04:56,043 INFO  L204         MainTranslator]: Completed translation
[2025-03-03 11:04:56,044 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:04:56 WrapperNode
[2025-03-03 11:04:56,045 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-03-03 11:04:56,046 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-03-03 11:04:56,046 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-03-03 11:04:56,046 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-03-03 11:04:56,051 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:04:56" (1/1) ...
[2025-03-03 11:04:56,081 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:04:56" (1/1) ...
[2025-03-03 11:04:56,215 INFO  L138                Inliner]: procedures = 16, calls = 10, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 4132
[2025-03-03 11:04:56,216 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-03-03 11:04:56,216 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-03-03 11:04:56,217 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-03-03 11:04:56,217 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-03-03 11:04:56,224 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:04:56" (1/1) ...
[2025-03-03 11:04:56,224 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:04:56" (1/1) ...
[2025-03-03 11:04:56,253 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:04:56" (1/1) ...
[2025-03-03 11:04:56,333 INFO  L175           MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2025-03-03 11:04:56,334 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:04:56" (1/1) ...
[2025-03-03 11:04:56,334 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:04:56" (1/1) ...
[2025-03-03 11:04:56,389 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:04:56" (1/1) ...
[2025-03-03 11:04:56,399 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:04:56" (1/1) ...
[2025-03-03 11:04:56,412 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:04:56" (1/1) ...
[2025-03-03 11:04:56,422 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:04:56" (1/1) ...
[2025-03-03 11:04:56,441 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-03-03 11:04:56,443 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-03-03 11:04:56,443 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-03-03 11:04:56,443 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-03-03 11:04:56,443 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:04:56" (1/1) ...
[2025-03-03 11:04:56,447 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-03 11:04:56,480 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 11:04:56,490 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2025-03-03 11:04:56,495 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2025-03-03 11:04:56,509 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-03-03 11:04:56,509 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-03-03 11:04:56,509 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-03-03 11:04:56,510 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-03-03 11:04:56,557 INFO  L256             CfgBuilder]: Building ICFG
[2025-03-03 11:04:56,558 INFO  L286             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-03-03 11:04:59,122 INFO  L1325  $ProcedureCfgBuilder]: dead code at ProgramPoint L1647: havoc calculate_output_#t~ret8#1;
[2025-03-03 11:04:59,122 INFO  L1325  $ProcedureCfgBuilder]: dead code at ProgramPoint L3060: havoc calculate_output2_#t~ret9#1;
[2025-03-03 11:04:59,215 INFO  L?                        ?]: Removed 639 outVars from TransFormulas that were not future-live.
[2025-03-03 11:04:59,215 INFO  L307             CfgBuilder]: Performing block encoding
[2025-03-03 11:04:59,241 INFO  L331             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-03-03 11:04:59,242 INFO  L336             CfgBuilder]: Removed 0 assume(true) statements.
[2025-03-03 11:04:59,242 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:04:59 BoogieIcfgContainer
[2025-03-03 11:04:59,242 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-03-03 11:04:59,243 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-03-03 11:04:59,247 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-03-03 11:04:59,250 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-03-03 11:04:59,250 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 11:04:55" (1/3) ...
[2025-03-03 11:04:59,250 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ad84454 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:04:59, skipping insertion in model container
[2025-03-03 11:04:59,250 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:04:56" (2/3) ...
[2025-03-03 11:04:59,251 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ad84454 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:04:59, skipping insertion in model container
[2025-03-03 11:04:59,251 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:04:59" (3/3) ...
[2025-03-03 11:04:59,251 INFO  L128   eAbstractionObserver]: Analyzing ICFG Problem18_label20.c
[2025-03-03 11:04:59,262 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-03-03 11:04:59,263 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG Problem18_label20.c that has 1 procedures, 757 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-03-03 11:04:59,322 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-03-03 11:04:59,329 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;@451d3c3d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-03-03 11:04:59,329 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-03-03 11:04:59,336 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 757 states, 755 states have (on average 1.9112582781456953) internal successors, (1443), 756 states have internal predecessors, (1443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 11:04:59,339 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 7
[2025-03-03 11:04:59,339 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 11:04:59,340 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1]
[2025-03-03 11:04:59,340 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 11:04:59,344 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 11:04:59,345 INFO  L85        PathProgramCache]: Analyzing trace with hash -2034017794, now seen corresponding path program 1 times
[2025-03-03 11:04:59,349 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 11:04:59,351 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047158492]
[2025-03-03 11:04:59,351 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 11:04:59,352 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 11:04:59,397 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes.
[2025-03-03 11:04:59,412 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements.
[2025-03-03 11:04:59,412 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 11:04:59,412 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 11:04:59,490 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 11:04:59,490 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 11:04:59,491 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047158492]
[2025-03-03 11:04:59,491 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047158492] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 11:04:59,491 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 11:04:59,491 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-03 11:04:59,492 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302836457]
[2025-03-03 11:04:59,493 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 11:04:59,495 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 11:04:59,496 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 11:04:59,508 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 11:04:59,508 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 11:04:59,511 INFO  L87              Difference]: Start difference. First operand  has 757 states, 755 states have (on average 1.9112582781456953) internal successors, (1443), 756 states have internal predecessors, (1443), 0 states have call successors, (0), 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 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 11:05:01,787 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 11:05:01,788 INFO  L93              Difference]: Finished difference Result 2205 states and 4263 transitions.
[2025-03-03 11:05:01,789 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 11:05:01,790 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 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 6
[2025-03-03 11:05:01,790 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 11:05:01,802 INFO  L225             Difference]: With dead ends: 2205
[2025-03-03 11:05:01,802 INFO  L226             Difference]: Without dead ends: 1384
[2025-03-03 11:05:01,805 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 11:05:01,807 INFO  L435           NwaCegarLoop]: 421 mSDtfsCounter, 713 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 2232 mSolverCounterSat, 530 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 713 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 2762 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 530 IncrementalHoareTripleChecker+Valid, 2232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time
[2025-03-03 11:05:01,807 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [713 Valid, 430 Invalid, 2762 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [530 Valid, 2232 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time]
[2025-03-03 11:05:01,822 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1384 states.
[2025-03-03 11:05:01,876 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1384 to 1384.
[2025-03-03 11:05:01,878 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1384 states, 1383 states have (on average 1.6514822848879247) internal successors, (2284), 1383 states have internal predecessors, (2284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 11:05:01,884 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1384 states to 1384 states and 2284 transitions.
[2025-03-03 11:05:01,886 INFO  L78                 Accepts]: Start accepts. Automaton has 1384 states and 2284 transitions. Word has length 6
[2025-03-03 11:05:01,886 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 11:05:01,886 INFO  L471      AbstractCegarLoop]: Abstraction has 1384 states and 2284 transitions.
[2025-03-03 11:05:01,886 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 11:05:01,887 INFO  L276                IsEmpty]: Start isEmpty. Operand 1384 states and 2284 transitions.
[2025-03-03 11:05:01,888 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 73
[2025-03-03 11:05:01,888 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 11:05:01,888 INFO  L218           NwaCegarLoop]: trace histogram [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]
[2025-03-03 11:05:01,888 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2025-03-03 11:05:01,888 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 11:05:01,889 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 11:05:01,889 INFO  L85        PathProgramCache]: Analyzing trace with hash 1305297074, now seen corresponding path program 1 times
[2025-03-03 11:05:01,889 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 11:05:01,889 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24787916]
[2025-03-03 11:05:01,889 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 11:05:01,889 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 11:05:01,903 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes.
[2025-03-03 11:05:01,937 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements.
[2025-03-03 11:05:01,937 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 11:05:01,937 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 11:05:02,109 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 11:05:02,109 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 11:05:02,109 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24787916]
[2025-03-03 11:05:02,110 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24787916] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 11:05:02,110 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 11:05:02,110 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-03 11:05:02,110 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922651885]
[2025-03-03 11:05:02,110 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 11:05:02,111 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 11:05:02,111 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 11:05:02,112 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 11:05:02,112 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 11:05:02,112 INFO  L87              Difference]: Start difference. First operand 1384 states and 2284 transitions. Second operand  has 3 states, 3 states have (on average 24.0) internal successors, (72), 2 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 11:05:04,207 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 11:05:04,208 INFO  L93              Difference]: Finished difference Result 4146 states and 6847 transitions.
[2025-03-03 11:05:04,208 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 11:05:04,208 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 24.0) internal successors, (72), 2 states have internal predecessors, (72), 0 states have call successors, (0), 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 72
[2025-03-03 11:05:04,209 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 11:05:04,218 INFO  L225             Difference]: With dead ends: 4146
[2025-03-03 11:05:04,218 INFO  L226             Difference]: Without dead ends: 2764
[2025-03-03 11:05:04,221 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 11:05:04,222 INFO  L435           NwaCegarLoop]: 526 mSDtfsCounter, 712 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1701 mSolverCounterSat, 918 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 712 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 2619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 918 IncrementalHoareTripleChecker+Valid, 1701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time
[2025-03-03 11:05:04,222 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [712 Valid, 531 Invalid, 2619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [918 Valid, 1701 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time]
[2025-03-03 11:05:04,225 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2764 states.
[2025-03-03 11:05:04,265 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2764 to 2764.
[2025-03-03 11:05:04,269 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2764 states, 2763 states have (on average 1.404632645674991) internal successors, (3881), 2763 states have internal predecessors, (3881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 11:05:04,274 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2764 states to 2764 states and 3881 transitions.
[2025-03-03 11:05:04,275 INFO  L78                 Accepts]: Start accepts. Automaton has 2764 states and 3881 transitions. Word has length 72
[2025-03-03 11:05:04,275 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 11:05:04,275 INFO  L471      AbstractCegarLoop]: Abstraction has 2764 states and 3881 transitions.
[2025-03-03 11:05:04,275 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 24.0) internal successors, (72), 2 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 11:05:04,276 INFO  L276                IsEmpty]: Start isEmpty. Operand 2764 states and 3881 transitions.
[2025-03-03 11:05:04,277 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 74
[2025-03-03 11:05:04,278 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 11:05:04,278 INFO  L218           NwaCegarLoop]: trace histogram [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]
[2025-03-03 11:05:04,278 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-03-03 11:05:04,278 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 11:05:04,279 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 11:05:04,279 INFO  L85        PathProgramCache]: Analyzing trace with hash -2053288628, now seen corresponding path program 1 times
[2025-03-03 11:05:04,279 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 11:05:04,279 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027362517]
[2025-03-03 11:05:04,279 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 11:05:04,279 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 11:05:04,286 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes.
[2025-03-03 11:05:04,293 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements.
[2025-03-03 11:05:04,293 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 11:05:04,293 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 11:05:04,377 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 11:05:04,377 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 11:05:04,377 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027362517]
[2025-03-03 11:05:04,377 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027362517] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 11:05:04,377 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 11:05:04,377 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-03 11:05:04,377 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844623120]
[2025-03-03 11:05:04,377 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 11:05:04,377 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 11:05:04,377 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 11:05:04,378 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 11:05:04,378 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 11:05:04,378 INFO  L87              Difference]: Start difference. First operand 2764 states and 3881 transitions. Second operand  has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 2 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 11:05:06,250 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 11:05:06,250 INFO  L93              Difference]: Finished difference Result 8288 states and 11639 transitions.
[2025-03-03 11:05:06,251 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 11:05:06,251 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 2 states have internal predecessors, (73), 0 states have call successors, (0), 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 73
[2025-03-03 11:05:06,251 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 11:05:06,266 INFO  L225             Difference]: With dead ends: 8288
[2025-03-03 11:05:06,267 INFO  L226             Difference]: Without dead ends: 5526
[2025-03-03 11:05:06,270 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 11:05:06,270 INFO  L435           NwaCegarLoop]: 428 mSDtfsCounter, 709 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1994 mSolverCounterSat, 672 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 709 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 2666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 672 IncrementalHoareTripleChecker+Valid, 1994 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time
[2025-03-03 11:05:06,271 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [709 Valid, 434 Invalid, 2666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [672 Valid, 1994 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time]
[2025-03-03 11:05:06,274 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 5526 states.
[2025-03-03 11:05:06,334 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 5526 to 5524.
[2025-03-03 11:05:06,340 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 5524 states, 5523 states have (on average 1.2657975737823646) internal successors, (6991), 5523 states have internal predecessors, (6991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 11:05:06,348 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5524 states to 5524 states and 6991 transitions.
[2025-03-03 11:05:06,348 INFO  L78                 Accepts]: Start accepts. Automaton has 5524 states and 6991 transitions. Word has length 73
[2025-03-03 11:05:06,348 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 11:05:06,348 INFO  L471      AbstractCegarLoop]: Abstraction has 5524 states and 6991 transitions.
[2025-03-03 11:05:06,348 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 2 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 11:05:06,349 INFO  L276                IsEmpty]: Start isEmpty. Operand 5524 states and 6991 transitions.
[2025-03-03 11:05:06,349 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2025-03-03 11:05:06,349 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 11:05:06,350 INFO  L218           NwaCegarLoop]: trace histogram [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]
[2025-03-03 11:05:06,351 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-03-03 11:05:06,351 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 11:05:06,351 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 11:05:06,354 INFO  L85        PathProgramCache]: Analyzing trace with hash -1435978709, now seen corresponding path program 1 times
[2025-03-03 11:05:06,354 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 11:05:06,354 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090514885]
[2025-03-03 11:05:06,354 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 11:05:06,354 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 11:05:06,365 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes.
[2025-03-03 11:05:06,381 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements.
[2025-03-03 11:05:06,381 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 11:05:06,381 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 11:05:06,478 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 11:05:06,478 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 11:05:06,478 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090514885]
[2025-03-03 11:05:06,479 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090514885] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 11:05:06,480 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 11:05:06,480 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 11:05:06,480 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813300146]
[2025-03-03 11:05:06,480 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 11:05:06,480 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 11:05:06,480 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 11:05:06,481 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 11:05:06,481 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 11:05:06,481 INFO  L87              Difference]: Start difference. First operand 5524 states and 6991 transitions. Second operand  has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 11:05:08,471 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 11:05:08,472 INFO  L93              Difference]: Finished difference Result 16566 states and 20968 transitions.
[2025-03-03 11:05:08,472 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 11:05:08,472 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 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 99
[2025-03-03 11:05:08,472 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 11:05:08,496 INFO  L225             Difference]: With dead ends: 16566
[2025-03-03 11:05:08,496 INFO  L226             Difference]: Without dead ends: 11044
[2025-03-03 11:05:08,502 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 11:05:08,504 INFO  L435           NwaCegarLoop]: 1285 mSDtfsCounter, 691 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1955 mSolverCounterSat, 766 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 691 SdHoareTripleChecker+Valid, 1292 SdHoareTripleChecker+Invalid, 2721 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 766 IncrementalHoareTripleChecker+Valid, 1955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time
[2025-03-03 11:05:08,505 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [691 Valid, 1292 Invalid, 2721 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [766 Valid, 1955 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time]
[2025-03-03 11:05:08,514 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 11044 states.
[2025-03-03 11:05:08,604 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 11044 to 9664.
[2025-03-03 11:05:08,614 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 9664 states, 9663 states have (on average 1.208423884921867) internal successors, (11677), 9663 states have internal predecessors, (11677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 11:05:08,627 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9664 states to 9664 states and 11677 transitions.
[2025-03-03 11:05:08,627 INFO  L78                 Accepts]: Start accepts. Automaton has 9664 states and 11677 transitions. Word has length 99
[2025-03-03 11:05:08,627 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 11:05:08,628 INFO  L471      AbstractCegarLoop]: Abstraction has 9664 states and 11677 transitions.
[2025-03-03 11:05:08,628 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 11:05:08,628 INFO  L276                IsEmpty]: Start isEmpty. Operand 9664 states and 11677 transitions.
[2025-03-03 11:05:08,629 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 125
[2025-03-03 11:05:08,631 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 11:05:08,631 INFO  L218           NwaCegarLoop]: trace histogram [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]
[2025-03-03 11:05:08,631 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-03-03 11:05:08,632 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 11:05:08,632 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 11:05:08,632 INFO  L85        PathProgramCache]: Analyzing trace with hash 110474160, now seen corresponding path program 1 times
[2025-03-03 11:05:08,632 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 11:05:08,632 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612704397]
[2025-03-03 11:05:08,632 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 11:05:08,632 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 11:05:08,644 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes.
[2025-03-03 11:05:08,658 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements.
[2025-03-03 11:05:08,658 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 11:05:08,658 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 11:05:08,770 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 11:05:08,770 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 11:05:08,770 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612704397]
[2025-03-03 11:05:08,770 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612704397] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 11:05:08,770 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 11:05:08,770 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 11:05:08,770 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392776150]
[2025-03-03 11:05:08,770 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 11:05:08,770 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 11:05:08,770 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 11:05:08,771 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 11:05:08,771 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 11:05:08,771 INFO  L87              Difference]: Start difference. First operand 9664 states and 11677 transitions. Second operand  has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 11:05:10,453 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 11:05:10,454 INFO  L93              Difference]: Finished difference Result 24156 states and 29566 transitions.
[2025-03-03 11:05:10,454 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 11:05:10,454 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 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 124
[2025-03-03 11:05:10,454 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 11:05:10,485 INFO  L225             Difference]: With dead ends: 24156
[2025-03-03 11:05:10,485 INFO  L226             Difference]: Without dead ends: 14494
[2025-03-03 11:05:10,495 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 11:05:10,496 INFO  L435           NwaCegarLoop]: 842 mSDtfsCounter, 701 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2362 mSolverCounterSat, 439 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 701 SdHoareTripleChecker+Valid, 849 SdHoareTripleChecker+Invalid, 2801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 439 IncrementalHoareTripleChecker+Valid, 2362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time
[2025-03-03 11:05:10,496 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [701 Valid, 849 Invalid, 2801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [439 Valid, 2362 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time]
[2025-03-03 11:05:10,507 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 14494 states.
[2025-03-03 11:05:10,670 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 14494 to 13114.
[2025-03-03 11:05:10,686 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 13114 states, 13113 states have (on average 1.2332036909936703) internal successors, (16171), 13113 states have internal predecessors, (16171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 11:05:10,702 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 13114 states to 13114 states and 16171 transitions.
[2025-03-03 11:05:10,702 INFO  L78                 Accepts]: Start accepts. Automaton has 13114 states and 16171 transitions. Word has length 124
[2025-03-03 11:05:10,703 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 11:05:10,703 INFO  L471      AbstractCegarLoop]: Abstraction has 13114 states and 16171 transitions.
[2025-03-03 11:05:10,703 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 11:05:10,704 INFO  L276                IsEmpty]: Start isEmpty. Operand 13114 states and 16171 transitions.
[2025-03-03 11:05:10,710 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 253
[2025-03-03 11:05:10,710 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 11:05:10,710 INFO  L218           NwaCegarLoop]: trace histogram [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, 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-03-03 11:05:10,710 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-03-03 11:05:10,710 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 11:05:10,711 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 11:05:10,711 INFO  L85        PathProgramCache]: Analyzing trace with hash -1576264951, now seen corresponding path program 1 times
[2025-03-03 11:05:10,711 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 11:05:10,711 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498916090]
[2025-03-03 11:05:10,712 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 11:05:10,712 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 11:05:10,734 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes.
[2025-03-03 11:05:10,748 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements.
[2025-03-03 11:05:10,749 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 11:05:10,750 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 11:05:11,155 INFO  L134       CoverageAnalysis]: Checked inductivity of 124 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2025-03-03 11:05:11,156 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 11:05:11,156 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498916090]
[2025-03-03 11:05:11,156 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498916090] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 11:05:11,156 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 11:05:11,156 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 11:05:11,156 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433068686]
[2025-03-03 11:05:11,157 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 11:05:11,157 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-03 11:05:11,160 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 11:05:11,161 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-03 11:05:11,161 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-03 11:05:11,161 INFO  L87              Difference]: Start difference. First operand 13114 states and 16171 transitions. Second operand  has 4 states, 4 states have (on average 62.25) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 11:05:13,733 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 11:05:13,733 INFO  L93              Difference]: Finished difference Result 28988 states and 35570 transitions.
[2025-03-03 11:05:13,733 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 11:05:13,734 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 62.25) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 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 252
[2025-03-03 11:05:13,734 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 11:05:13,760 INFO  L225             Difference]: With dead ends: 28988
[2025-03-03 11:05:13,760 INFO  L226             Difference]: Without dead ends: 16566
[2025-03-03 11:05:13,770 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-03-03 11:05:13,771 INFO  L435           NwaCegarLoop]: 605 mSDtfsCounter, 1875 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 4314 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1875 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 4431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 4314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time
[2025-03-03 11:05:13,771 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1875 Valid, 622 Invalid, 4431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 4314 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time]
[2025-03-03 11:05:13,782 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 16566 states.
[2025-03-03 11:05:13,960 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 16566 to 15874.
[2025-03-03 11:05:13,979 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 15874 states, 15873 states have (on average 1.208971208971209) internal successors, (19190), 15873 states have internal predecessors, (19190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 11:05:14,000 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 15874 states to 15874 states and 19190 transitions.
[2025-03-03 11:05:14,000 INFO  L78                 Accepts]: Start accepts. Automaton has 15874 states and 19190 transitions. Word has length 252
[2025-03-03 11:05:14,000 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 11:05:14,000 INFO  L471      AbstractCegarLoop]: Abstraction has 15874 states and 19190 transitions.
[2025-03-03 11:05:14,001 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 62.25) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 11:05:14,001 INFO  L276                IsEmpty]: Start isEmpty. Operand 15874 states and 19190 transitions.
[2025-03-03 11:05:14,006 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 373
[2025-03-03 11:05:14,006 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 11:05:14,006 INFO  L218           NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 11:05:14,006 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-03-03 11:05:14,006 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 11:05:14,007 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 11:05:14,007 INFO  L85        PathProgramCache]: Analyzing trace with hash -394662826, now seen corresponding path program 1 times
[2025-03-03 11:05:14,007 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 11:05:14,007 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783211178]
[2025-03-03 11:05:14,007 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 11:05:14,007 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 11:05:14,042 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 372 statements into 1 equivalence classes.
[2025-03-03 11:05:14,074 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 372 of 372 statements.
[2025-03-03 11:05:14,075 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 11:05:14,075 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 11:05:14,300 INFO  L134       CoverageAnalysis]: Checked inductivity of 73 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 11:05:14,301 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 11:05:14,301 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783211178]
[2025-03-03 11:05:14,301 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783211178] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 11:05:14,301 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 11:05:14,301 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 11:05:14,301 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527216052]
[2025-03-03 11:05:14,301 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 11:05:14,302 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 11:05:14,302 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 11:05:14,302 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 11:05:14,302 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 11:05:14,302 INFO  L87              Difference]: Start difference. First operand 15874 states and 19190 transitions. Second operand  has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 11:05:16,279 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 11:05:16,279 INFO  L93              Difference]: Finished difference Result 37266 states and 45170 transitions.
[2025-03-03 11:05:16,279 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 11:05:16,279 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 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 372
[2025-03-03 11:05:16,280 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 11:05:16,315 INFO  L225             Difference]: With dead ends: 37266
[2025-03-03 11:05:16,315 INFO  L226             Difference]: Without dead ends: 22084
[2025-03-03 11:05:16,326 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 11:05:16,327 INFO  L435           NwaCegarLoop]: 141 mSDtfsCounter, 656 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1991 mSolverCounterSat, 909 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 656 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 2900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 909 IncrementalHoareTripleChecker+Valid, 1991 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time
[2025-03-03 11:05:16,327 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [656 Valid, 146 Invalid, 2900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [909 Valid, 1991 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time]
[2025-03-03 11:05:16,344 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 22084 states.
[2025-03-03 11:05:16,483 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 22084 to 21394.
[2025-03-03 11:05:16,502 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 21394 states, 21393 states have (on average 1.1867433272565793) internal successors, (25388), 21393 states have internal predecessors, (25388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 11:05:16,521 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 21394 states to 21394 states and 25388 transitions.
[2025-03-03 11:05:16,522 INFO  L78                 Accepts]: Start accepts. Automaton has 21394 states and 25388 transitions. Word has length 372
[2025-03-03 11:05:16,522 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 11:05:16,522 INFO  L471      AbstractCegarLoop]: Abstraction has 21394 states and 25388 transitions.
[2025-03-03 11:05:16,523 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 11:05:16,523 INFO  L276                IsEmpty]: Start isEmpty. Operand 21394 states and 25388 transitions.
[2025-03-03 11:05:16,527 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 410
[2025-03-03 11:05:16,529 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 11:05:16,529 INFO  L218           NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 11:05:16,530 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-03-03 11:05:16,530 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 11:05:16,530 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 11:05:16,531 INFO  L85        PathProgramCache]: Analyzing trace with hash 743094217, now seen corresponding path program 1 times
[2025-03-03 11:05:16,531 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 11:05:16,531 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748376962]
[2025-03-03 11:05:16,531 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 11:05:16,531 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 11:05:16,557 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 409 statements into 1 equivalence classes.
[2025-03-03 11:05:16,576 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 409 of 409 statements.
[2025-03-03 11:05:16,577 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 11:05:16,577 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 11:05:16,971 INFO  L134       CoverageAnalysis]: Checked inductivity of 110 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 11:05:16,971 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 11:05:16,971 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748376962]
[2025-03-03 11:05:16,971 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748376962] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 11:05:16,971 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 11:05:16,972 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 11:05:16,972 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790194431]
[2025-03-03 11:05:16,972 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 11:05:16,972 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 11:05:16,972 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 11:05:16,972 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 11:05:16,972 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 11:05:16,973 INFO  L87              Difference]: Start difference. First operand 21394 states and 25388 transitions. Second operand  has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 11:05:18,627 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 11:05:18,627 INFO  L93              Difference]: Finished difference Result 42786 states and 50768 transitions.
[2025-03-03 11:05:18,628 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 11:05:18,629 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 409
[2025-03-03 11:05:18,629 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 11:05:18,653 INFO  L225             Difference]: With dead ends: 42786
[2025-03-03 11:05:18,653 INFO  L226             Difference]: Without dead ends: 22084
[2025-03-03 11:05:18,663 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 11:05:18,664 INFO  L435           NwaCegarLoop]: 1064 mSDtfsCounter, 590 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2196 mSolverCounterSat, 222 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 590 SdHoareTripleChecker+Valid, 1071 SdHoareTripleChecker+Invalid, 2418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 222 IncrementalHoareTripleChecker+Valid, 2196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time
[2025-03-03 11:05:18,664 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [590 Valid, 1071 Invalid, 2418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [222 Valid, 2196 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time]
[2025-03-03 11:05:18,675 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 22084 states.
[2025-03-03 11:05:18,802 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 22084 to 21394.
[2025-03-03 11:05:18,820 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 21394 states, 21393 states have (on average 1.1696349273126723) internal successors, (25022), 21393 states have internal predecessors, (25022), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 11:05:18,840 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 21394 states to 21394 states and 25022 transitions.
[2025-03-03 11:05:18,841 INFO  L78                 Accepts]: Start accepts. Automaton has 21394 states and 25022 transitions. Word has length 409
[2025-03-03 11:05:18,841 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 11:05:18,841 INFO  L471      AbstractCegarLoop]: Abstraction has 21394 states and 25022 transitions.
[2025-03-03 11:05:18,841 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 11:05:18,842 INFO  L276                IsEmpty]: Start isEmpty. Operand 21394 states and 25022 transitions.
[2025-03-03 11:05:18,846 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 417
[2025-03-03 11:05:18,846 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 11:05:18,847 INFO  L218           NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 11:05:18,848 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-03-03 11:05:18,848 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 11:05:18,848 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 11:05:18,848 INFO  L85        PathProgramCache]: Analyzing trace with hash 354782476, now seen corresponding path program 1 times
[2025-03-03 11:05:18,848 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 11:05:18,848 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249185957]
[2025-03-03 11:05:18,849 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 11:05:18,849 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 11:05:18,875 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 416 statements into 1 equivalence classes.
[2025-03-03 11:05:18,891 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 416 of 416 statements.
[2025-03-03 11:05:18,892 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 11:05:18,892 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 11:05:19,272 INFO  L134       CoverageAnalysis]: Checked inductivity of 110 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 11:05:19,273 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 11:05:19,273 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249185957]
[2025-03-03 11:05:19,273 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249185957] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 11:05:19,273 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 11:05:19,274 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 11:05:19,274 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035156945]
[2025-03-03 11:05:19,274 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 11:05:19,275 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 11:05:19,275 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 11:05:19,275 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 11:05:19,275 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 11:05:19,275 INFO  L87              Difference]: Start difference. First operand 21394 states and 25022 transitions. Second operand  has 3 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 11:05:21,203 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 11:05:21,203 INFO  L93              Difference]: Finished difference Result 42096 states and 49340 transitions.
[2025-03-03 11:05:21,204 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 11:05:21,204 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 0 states have call successors, (0), 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 416
[2025-03-03 11:05:21,204 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 11:05:21,226 INFO  L225             Difference]: With dead ends: 42096
[2025-03-03 11:05:21,227 INFO  L226             Difference]: Without dead ends: 21394
[2025-03-03 11:05:21,240 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 11:05:21,241 INFO  L435           NwaCegarLoop]: 581 mSDtfsCounter, 592 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 2409 mSolverCounterSat, 269 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 592 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 2678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 269 IncrementalHoareTripleChecker+Valid, 2409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time
[2025-03-03 11:05:21,241 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [592 Valid, 586 Invalid, 2678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [269 Valid, 2409 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time]
[2025-03-03 11:05:21,254 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 21394 states.
[2025-03-03 11:05:21,444 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 21394 to 21394.
[2025-03-03 11:05:21,467 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 21394 states, 21393 states have (on average 1.1429906978918338) internal successors, (24452), 21393 states have internal predecessors, (24452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 11:05:21,501 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 21394 states to 21394 states and 24452 transitions.
[2025-03-03 11:05:21,502 INFO  L78                 Accepts]: Start accepts. Automaton has 21394 states and 24452 transitions. Word has length 416
[2025-03-03 11:05:21,502 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 11:05:21,502 INFO  L471      AbstractCegarLoop]: Abstraction has 21394 states and 24452 transitions.
[2025-03-03 11:05:21,505 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 11:05:21,506 INFO  L276                IsEmpty]: Start isEmpty. Operand 21394 states and 24452 transitions.
[2025-03-03 11:05:21,509 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 513
[2025-03-03 11:05:21,512 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 11:05:21,513 INFO  L218           NwaCegarLoop]: trace histogram [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, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 11:05:21,513 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-03-03 11:05:21,513 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 11:05:21,514 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 11:05:21,514 INFO  L85        PathProgramCache]: Analyzing trace with hash 1327836765, now seen corresponding path program 1 times
[2025-03-03 11:05:21,514 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 11:05:21,514 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680124039]
[2025-03-03 11:05:21,514 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 11:05:21,514 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 11:05:21,557 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 512 statements into 1 equivalence classes.
[2025-03-03 11:05:21,569 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 512 of 512 statements.
[2025-03-03 11:05:21,569 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 11:05:21,569 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 11:05:21,826 INFO  L134       CoverageAnalysis]: Checked inductivity of 748 backedges. 480 proven. 0 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked.
[2025-03-03 11:05:21,828 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 11:05:21,828 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680124039]
[2025-03-03 11:05:21,828 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680124039] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 11:05:21,828 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 11:05:21,828 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 11:05:21,829 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648225814]
[2025-03-03 11:05:21,829 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 11:05:21,829 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-03 11:05:21,829 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 11:05:21,829 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-03 11:05:21,830 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-03 11:05:21,830 INFO  L87              Difference]: Start difference. First operand 21394 states and 24452 transitions. Second operand  has 4 states, 4 states have (on average 89.25) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 11:05:23,575 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 11:05:23,575 INFO  L93              Difference]: Finished difference Result 44221 states and 50366 transitions.
[2025-03-03 11:05:23,576 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 11:05:23,576 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 89.25) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 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 512
[2025-03-03 11:05:23,576 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 11:05:23,593 INFO  L225             Difference]: With dead ends: 44221
[2025-03-03 11:05:23,593 INFO  L226             Difference]: Without dead ends: 23466
[2025-03-03 11:05:23,600 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-03 11:05:23,601 INFO  L435           NwaCegarLoop]: 625 mSDtfsCounter, 531 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 2592 mSolverCounterSat, 381 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 531 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 2973 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 381 IncrementalHoareTripleChecker+Valid, 2592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time
[2025-03-03 11:05:23,601 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [531 Valid, 638 Invalid, 2973 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [381 Valid, 2592 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time]
[2025-03-03 11:05:23,613 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 23466 states.
[2025-03-03 11:05:23,725 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 23466 to 23464.
[2025-03-03 11:05:23,742 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 23464 states, 23463 states have (on average 1.0994757703618463) internal successors, (25797), 23463 states have internal predecessors, (25797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 11:05:23,760 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 23464 states to 23464 states and 25797 transitions.
[2025-03-03 11:05:23,761 INFO  L78                 Accepts]: Start accepts. Automaton has 23464 states and 25797 transitions. Word has length 512
[2025-03-03 11:05:23,761 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 11:05:23,761 INFO  L471      AbstractCegarLoop]: Abstraction has 23464 states and 25797 transitions.
[2025-03-03 11:05:23,761 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 89.25) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 11:05:23,761 INFO  L276                IsEmpty]: Start isEmpty. Operand 23464 states and 25797 transitions.
[2025-03-03 11:05:23,767 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 973
[2025-03-03 11:05:23,767 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 11:05:23,767 INFO  L218           NwaCegarLoop]: trace histogram [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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 11:05:23,767 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-03-03 11:05:23,768 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 11:05:23,768 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 11:05:23,768 INFO  L85        PathProgramCache]: Analyzing trace with hash -632573469, now seen corresponding path program 1 times
[2025-03-03 11:05:23,768 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 11:05:23,769 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286911648]
[2025-03-03 11:05:23,769 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 11:05:23,769 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 11:05:23,816 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 972 statements into 1 equivalence classes.
[2025-03-03 11:05:23,848 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 972 of 972 statements.
[2025-03-03 11:05:23,849 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 11:05:23,849 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 11:05:24,226 INFO  L134       CoverageAnalysis]: Checked inductivity of 682 backedges. 211 proven. 0 refuted. 0 times theorem prover too weak. 471 trivial. 0 not checked.
[2025-03-03 11:05:24,227 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 11:05:24,227 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286911648]
[2025-03-03 11:05:24,227 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286911648] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 11:05:24,227 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 11:05:24,227 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-03 11:05:24,227 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601964526]
[2025-03-03 11:05:24,227 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 11:05:24,228 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 11:05:24,228 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 11:05:24,228 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 11:05:24,228 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 11:05:24,229 INFO  L87              Difference]: Start difference. First operand 23464 states and 25797 transitions. Second operand  has 3 states, 3 states have (on average 196.0) internal successors, (588), 2 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 11:05:25,684 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 11:05:25,684 INFO  L93              Difference]: Finished difference Result 53136 states and 58409 transitions.
[2025-03-03 11:05:25,685 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 11:05:25,685 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 196.0) internal successors, (588), 2 states have internal predecessors, (588), 0 states have call successors, (0), 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 972
[2025-03-03 11:05:25,686 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 11:05:25,714 INFO  L225             Difference]: With dead ends: 53136
[2025-03-03 11:05:25,714 INFO  L226             Difference]: Without dead ends: 30364
[2025-03-03 11:05:25,732 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 11:05:25,732 INFO  L435           NwaCegarLoop]: 81 mSDtfsCounter, 248 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1798 mSolverCounterSat, 516 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 2314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 516 IncrementalHoareTripleChecker+Valid, 1798 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time
[2025-03-03 11:05:25,732 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 86 Invalid, 2314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [516 Valid, 1798 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time]
[2025-03-03 11:05:25,753 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 30364 states.
[2025-03-03 11:05:26,041 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 30364 to 30364.
[2025-03-03 11:05:26,064 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 30364 states, 30363 states have (on average 1.0826005335441162) internal successors, (32871), 30363 states have internal predecessors, (32871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 11:05:26,102 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 30364 states to 30364 states and 32871 transitions.
[2025-03-03 11:05:26,103 INFO  L78                 Accepts]: Start accepts. Automaton has 30364 states and 32871 transitions. Word has length 972
[2025-03-03 11:05:26,104 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 11:05:26,104 INFO  L471      AbstractCegarLoop]: Abstraction has 30364 states and 32871 transitions.
[2025-03-03 11:05:26,104 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 196.0) internal successors, (588), 2 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 11:05:26,104 INFO  L276                IsEmpty]: Start isEmpty. Operand 30364 states and 32871 transitions.
[2025-03-03 11:05:26,115 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 974
[2025-03-03 11:05:26,115 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 11:05:26,115 INFO  L218           NwaCegarLoop]: trace histogram [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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 11:05:26,116 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-03-03 11:05:26,116 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 11:05:26,116 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 11:05:26,117 INFO  L85        PathProgramCache]: Analyzing trace with hash 1730188050, now seen corresponding path program 1 times
[2025-03-03 11:05:26,117 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 11:05:26,117 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954279326]
[2025-03-03 11:05:26,117 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 11:05:26,117 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 11:05:26,190 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 973 statements into 1 equivalence classes.
[2025-03-03 11:05:26,232 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 973 of 973 statements.
[2025-03-03 11:05:26,232 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 11:05:26,232 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 11:05:27,062 INFO  L134       CoverageAnalysis]: Checked inductivity of 684 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 669 trivial. 0 not checked.
[2025-03-03 11:05:27,062 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 11:05:27,062 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954279326]
[2025-03-03 11:05:27,063 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954279326] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 11:05:27,063 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 11:05:27,063 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 11:05:27,063 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9290775]
[2025-03-03 11:05:27,063 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 11:05:27,064 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 11:05:27,064 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 11:05:27,064 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 11:05:27,065 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 11:05:27,065 INFO  L87              Difference]: Start difference. First operand 30364 states and 32871 transitions. Second operand  has 3 states, 3 states have (on average 175.0) internal successors, (525), 3 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 11:05:28,455 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 11:05:28,455 INFO  L93              Difference]: Finished difference Result 60036 states and 65049 transitions.
[2025-03-03 11:05:28,456 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 11:05:28,456 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 175.0) internal successors, (525), 3 states have internal predecessors, (525), 0 states have call successors, (0), 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 973
[2025-03-03 11:05:28,457 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 11:05:28,487 INFO  L225             Difference]: With dead ends: 60036
[2025-03-03 11:05:28,487 INFO  L226             Difference]: Without dead ends: 30364
[2025-03-03 11:05:28,496 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 11:05:28,496 INFO  L435           NwaCegarLoop]: 773 mSDtfsCounter, 791 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1974 mSolverCounterSat, 191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 791 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 2165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 1974 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time
[2025-03-03 11:05:28,496 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [791 Valid, 780 Invalid, 2165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 1974 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time]
[2025-03-03 11:05:28,512 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 30364 states.
[2025-03-03 11:05:28,666 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 30364 to 30364.
[2025-03-03 11:05:28,683 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 30364 states, 30363 states have (on average 1.069163126173303) internal successors, (32463), 30363 states have internal predecessors, (32463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 11:05:28,708 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 30364 states to 30364 states and 32463 transitions.
[2025-03-03 11:05:28,709 INFO  L78                 Accepts]: Start accepts. Automaton has 30364 states and 32463 transitions. Word has length 973
[2025-03-03 11:05:28,710 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 11:05:28,710 INFO  L471      AbstractCegarLoop]: Abstraction has 30364 states and 32463 transitions.
[2025-03-03 11:05:28,710 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 175.0) internal successors, (525), 3 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 11:05:28,710 INFO  L276                IsEmpty]: Start isEmpty. Operand 30364 states and 32463 transitions.
[2025-03-03 11:05:28,728 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1375
[2025-03-03 11:05:28,728 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 11:05:28,728 INFO  L218           NwaCegarLoop]: trace histogram [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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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]
[2025-03-03 11:05:28,728 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2025-03-03 11:05:28,729 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 11:05:28,729 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 11:05:28,729 INFO  L85        PathProgramCache]: Analyzing trace with hash 1673502352, now seen corresponding path program 1 times
[2025-03-03 11:05:28,729 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 11:05:28,729 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270764151]
[2025-03-03 11:05:28,729 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 11:05:28,729 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 11:05:28,797 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1374 statements into 1 equivalence classes.
[2025-03-03 11:05:28,826 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1374 of 1374 statements.
[2025-03-03 11:05:28,826 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 11:05:28,826 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 11:05:29,757 INFO  L134       CoverageAnalysis]: Checked inductivity of 1407 backedges. 1099 proven. 0 refuted. 0 times theorem prover too weak. 308 trivial. 0 not checked.
[2025-03-03 11:05:29,757 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 11:05:29,757 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270764151]
[2025-03-03 11:05:29,758 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270764151] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 11:05:29,758 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 11:05:29,758 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 11:05:29,758 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168118940]
[2025-03-03 11:05:29,758 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 11:05:29,759 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-03 11:05:29,759 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 11:05:29,760 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-03 11:05:29,760 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-03 11:05:29,762 INFO  L87              Difference]: Start difference. First operand 30364 states and 32463 transitions. Second operand  has 4 states, 4 states have (on average 267.0) internal successors, (1068), 3 states have internal predecessors, (1068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 11:05:32,005 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 11:05:32,005 INFO  L93              Difference]: Finished difference Result 60036 states and 64233 transitions.
[2025-03-03 11:05:32,006 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 11:05:32,006 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 267.0) internal successors, (1068), 3 states have internal predecessors, (1068), 0 states have call successors, (0), 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 1374
[2025-03-03 11:05:32,007 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 11:05:32,037 INFO  L225             Difference]: With dead ends: 60036
[2025-03-03 11:05:32,037 INFO  L226             Difference]: Without dead ends: 30364
[2025-03-03 11:05:32,057 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-03 11:05:32,058 INFO  L435           NwaCegarLoop]: 89 mSDtfsCounter, 827 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 3064 mSolverCounterSat, 499 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 827 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 3563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 499 IncrementalHoareTripleChecker+Valid, 3064 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time
[2025-03-03 11:05:32,058 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [827 Valid, 99 Invalid, 3563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [499 Valid, 3064 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time]
[2025-03-03 11:05:32,074 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 30364 states.
[2025-03-03 11:05:32,304 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 30364 to 30364.
[2025-03-03 11:05:32,324 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 30364 states, 30363 states have (on average 1.068240951157659) internal successors, (32435), 30363 states have internal predecessors, (32435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 11:05:32,358 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 30364 states to 30364 states and 32435 transitions.
[2025-03-03 11:05:32,359 INFO  L78                 Accepts]: Start accepts. Automaton has 30364 states and 32435 transitions. Word has length 1374
[2025-03-03 11:05:32,360 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 11:05:32,360 INFO  L471      AbstractCegarLoop]: Abstraction has 30364 states and 32435 transitions.
[2025-03-03 11:05:32,360 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 267.0) internal successors, (1068), 3 states have internal predecessors, (1068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 11:05:32,360 INFO  L276                IsEmpty]: Start isEmpty. Operand 30364 states and 32435 transitions.
[2025-03-03 11:05:32,379 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1376
[2025-03-03 11:05:32,380 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 11:05:32,380 INFO  L218           NwaCegarLoop]: trace histogram [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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 11:05:32,380 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2025-03-03 11:05:32,380 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 11:05:32,381 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 11:05:32,381 INFO  L85        PathProgramCache]: Analyzing trace with hash 1341057601, now seen corresponding path program 1 times
[2025-03-03 11:05:32,381 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 11:05:32,381 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396689907]
[2025-03-03 11:05:32,381 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 11:05:32,381 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 11:05:32,440 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1375 statements into 1 equivalence classes.
[2025-03-03 11:05:32,477 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1375 of 1375 statements.
[2025-03-03 11:05:32,477 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 11:05:32,477 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 11:05:33,559 INFO  L134       CoverageAnalysis]: Checked inductivity of 1595 backedges. 490 proven. 848 refuted. 0 times theorem prover too weak. 257 trivial. 0 not checked.
[2025-03-03 11:05:33,559 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 11:05:33,559 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396689907]
[2025-03-03 11:05:33,560 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396689907] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 11:05:33,560 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [244928337]
[2025-03-03 11:05:33,560 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 11:05:33,560 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 11:05:33,560 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 11:05:33,563 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-03 11:05:33,564 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2025-03-03 11:05:33,686 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1375 statements into 1 equivalence classes.
[2025-03-03 11:05:33,834 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1375 of 1375 statements.
[2025-03-03 11:05:33,834 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 11:05:33,834 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 11:05:33,840 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1570 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-03-03 11:05:33,867 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 11:05:34,226 INFO  L134       CoverageAnalysis]: Checked inductivity of 1595 backedges. 872 proven. 0 refuted. 0 times theorem prover too weak. 723 trivial. 0 not checked.
[2025-03-03 11:05:34,226 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-03 11:05:34,226 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [244928337] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 11:05:34,226 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-03 11:05:34,226 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7
[2025-03-03 11:05:34,227 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662823634]
[2025-03-03 11:05:34,227 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 11:05:34,227 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 11:05:34,228 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 11:05:34,228 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 11:05:34,228 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2025-03-03 11:05:34,229 INFO  L87              Difference]: Start difference. First operand 30364 states and 32435 transitions. Second operand  has 3 states, 3 states have (on average 303.0) internal successors, (909), 3 states have internal predecessors, (909), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 11:05:35,675 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 11:05:35,675 INFO  L93              Difference]: Finished difference Result 71076 states and 76354 transitions.
[2025-03-03 11:05:35,676 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 11:05:35,676 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 303.0) internal successors, (909), 3 states have internal predecessors, (909), 0 states have call successors, (0), 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 1375
[2025-03-03 11:05:35,677 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 11:05:35,714 INFO  L225             Difference]: With dead ends: 71076
[2025-03-03 11:05:35,715 INFO  L226             Difference]: Without dead ends: 36574
[2025-03-03 11:05:35,737 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 1380 GetRequests, 1375 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2025-03-03 11:05:35,738 INFO  L435           NwaCegarLoop]: 967 mSDtfsCounter, 356 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1703 mSolverCounterSat, 568 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 973 SdHoareTripleChecker+Invalid, 2271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 568 IncrementalHoareTripleChecker+Valid, 1703 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time
[2025-03-03 11:05:35,738 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 973 Invalid, 2271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [568 Valid, 1703 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time]
[2025-03-03 11:05:35,759 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 36574 states.
[2025-03-03 11:05:35,948 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 36574 to 33814.
[2025-03-03 11:05:35,970 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 33814 states, 33813 states have (on average 1.0454854641705853) internal successors, (35351), 33813 states have internal predecessors, (35351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 11:05:35,996 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 33814 states to 33814 states and 35351 transitions.
[2025-03-03 11:05:35,997 INFO  L78                 Accepts]: Start accepts. Automaton has 33814 states and 35351 transitions. Word has length 1375
[2025-03-03 11:05:35,998 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 11:05:35,998 INFO  L471      AbstractCegarLoop]: Abstraction has 33814 states and 35351 transitions.
[2025-03-03 11:05:35,998 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 303.0) internal successors, (909), 3 states have internal predecessors, (909), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 11:05:35,998 INFO  L276                IsEmpty]: Start isEmpty. Operand 33814 states and 35351 transitions.
[2025-03-03 11:05:36,015 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1400
[2025-03-03 11:05:36,015 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 11:05:36,016 INFO  L218           NwaCegarLoop]: trace histogram [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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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-03-03 11:05:36,023 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2025-03-03 11:05:36,216 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13
[2025-03-03 11:05:36,217 INFO  L396      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 11:05:36,217 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 11:05:36,217 INFO  L85        PathProgramCache]: Analyzing trace with hash -67615363, now seen corresponding path program 1 times
[2025-03-03 11:05:36,217 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 11:05:36,217 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428551799]
[2025-03-03 11:05:36,217 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 11:05:36,218 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 11:05:36,273 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1399 statements into 1 equivalence classes.
[2025-03-03 11:05:36,310 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1399 of 1399 statements.
[2025-03-03 11:05:36,310 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 11:05:36,310 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 11:05:37,653 INFO  L134       CoverageAnalysis]: Checked inductivity of 1619 backedges. 385 proven. 1149 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked.
[2025-03-03 11:05:37,654 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 11:05:37,654 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428551799]
[2025-03-03 11:05:37,654 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428551799] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 11:05:37,654 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1322070025]
[2025-03-03 11:05:37,654 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 11:05:37,654 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 11:05:37,654 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 11:05:37,656 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-03 11:05:37,658 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2025-03-03 11:05:37,746 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1399 statements into 1 equivalence classes.
[2025-03-03 11:05:37,884 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1399 of 1399 statements.
[2025-03-03 11:05:37,884 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 11:05:37,884 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 11:05:37,888 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1595 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-03-03 11:05:37,897 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 11:05:37,931 INFO  L134       CoverageAnalysis]: Checked inductivity of 1619 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 1598 trivial. 0 not checked.
[2025-03-03 11:05:37,931 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-03 11:05:37,931 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1322070025] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 11:05:37,931 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-03 11:05:37,931 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9
[2025-03-03 11:05:37,933 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706075780]
[2025-03-03 11:05:37,933 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 11:05:37,933 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 11:05:37,933 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 11:05:37,934 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 11:05:37,934 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2025-03-03 11:05:37,934 INFO  L87              Difference]: Start difference. First operand 33814 states and 35351 transitions. Second operand  has 3 states, 3 states have (on average 175.66666666666666) internal successors, (527), 3 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 11:05:39,337 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 11:05:39,337 INFO  L93              Difference]: Finished difference Result 79356 states and 83375 transitions.
[2025-03-03 11:05:39,337 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 11:05:39,337 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 175.66666666666666) internal successors, (527), 3 states have internal predecessors, (527), 0 states have call successors, (0), 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 1399
[2025-03-03 11:05:39,338 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 11:05:39,378 INFO  L225             Difference]: With dead ends: 79356
[2025-03-03 11:05:39,378 INFO  L226             Difference]: Without dead ends: 45544
[2025-03-03 11:05:39,399 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 1406 GetRequests, 1399 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2025-03-03 11:05:39,400 INFO  L435           NwaCegarLoop]: 805 mSDtfsCounter, 726 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1675 mSolverCounterSat, 377 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 726 SdHoareTripleChecker+Valid, 812 SdHoareTripleChecker+Invalid, 2052 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 377 IncrementalHoareTripleChecker+Valid, 1675 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time
[2025-03-03 11:05:39,400 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [726 Valid, 812 Invalid, 2052 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [377 Valid, 1675 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time]
[2025-03-03 11:05:39,431 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 45544 states.
[2025-03-03 11:05:39,662 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 45544 to 42094.
[2025-03-03 11:05:39,689 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 42094 states, 42093 states have (on average 1.0523840068419927) internal successors, (44298), 42093 states have internal predecessors, (44298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 11:05:39,721 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 42094 states to 42094 states and 44298 transitions.
[2025-03-03 11:05:39,721 INFO  L78                 Accepts]: Start accepts. Automaton has 42094 states and 44298 transitions. Word has length 1399
[2025-03-03 11:05:39,722 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 11:05:39,722 INFO  L471      AbstractCegarLoop]: Abstraction has 42094 states and 44298 transitions.
[2025-03-03 11:05:39,722 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 175.66666666666666) internal successors, (527), 3 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 11:05:39,722 INFO  L276                IsEmpty]: Start isEmpty. Operand 42094 states and 44298 transitions.
[2025-03-03 11:05:39,831 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1646
[2025-03-03 11:05:39,831 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 11:05:39,832 INFO  L218           NwaCegarLoop]: trace histogram [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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-03-03 11:05:39,839 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2025-03-03 11:05:40,032 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14
[2025-03-03 11:05:40,032 INFO  L396      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 11:05:40,033 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 11:05:40,033 INFO  L85        PathProgramCache]: Analyzing trace with hash 1665134496, now seen corresponding path program 1 times
[2025-03-03 11:05:40,033 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 11:05:40,033 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523627447]
[2025-03-03 11:05:40,034 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 11:05:40,034 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 11:05:40,141 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1645 statements into 1 equivalence classes.
[2025-03-03 11:05:40,208 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1645 of 1645 statements.
[2025-03-03 11:05:40,208 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 11:05:40,208 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 11:05:41,029 INFO  L134       CoverageAnalysis]: Checked inductivity of 2230 backedges. 1503 proven. 0 refuted. 0 times theorem prover too weak. 727 trivial. 0 not checked.
[2025-03-03 11:05:41,029 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 11:05:41,029 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523627447]
[2025-03-03 11:05:41,029 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523627447] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 11:05:41,029 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 11:05:41,030 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 11:05:41,030 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070910891]
[2025-03-03 11:05:41,030 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 11:05:41,031 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 11:05:41,031 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 11:05:41,032 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 11:05:41,032 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 11:05:41,032 INFO  L87              Difference]: Start difference. First operand 42094 states and 44298 transitions. Second operand  has 3 states, 3 states have (on average 392.0) internal successors, (1176), 3 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 11:05:42,359 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 11:05:42,360 INFO  L93              Difference]: Finished difference Result 90396 states and 95269 transitions.
[2025-03-03 11:05:42,360 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 11:05:42,360 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 392.0) internal successors, (1176), 3 states have internal predecessors, (1176), 0 states have call successors, (0), 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 1645
[2025-03-03 11:05:42,361 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 11:05:42,412 INFO  L225             Difference]: With dead ends: 90396
[2025-03-03 11:05:42,412 INFO  L226             Difference]: Without dead ends: 48994
[2025-03-03 11:05:42,441 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 11:05:42,442 INFO  L435           NwaCegarLoop]: 923 mSDtfsCounter, 599 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1660 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 599 SdHoareTripleChecker+Valid, 929 SdHoareTripleChecker+Invalid, 1784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 1660 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time
[2025-03-03 11:05:42,442 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [599 Valid, 929 Invalid, 1784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 1660 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2025-03-03 11:05:42,473 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 48994 states.
[2025-03-03 11:05:42,721 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 48994 to 48304.
[2025-03-03 11:05:42,749 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 48304 states, 48303 states have (on average 1.0505765687431423) internal successors, (50746), 48303 states have internal predecessors, (50746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 11:05:42,787 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 48304 states to 48304 states and 50746 transitions.
[2025-03-03 11:05:42,788 INFO  L78                 Accepts]: Start accepts. Automaton has 48304 states and 50746 transitions. Word has length 1645
[2025-03-03 11:05:42,789 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 11:05:42,789 INFO  L471      AbstractCegarLoop]: Abstraction has 48304 states and 50746 transitions.
[2025-03-03 11:05:42,789 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 392.0) internal successors, (1176), 3 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 11:05:42,789 INFO  L276                IsEmpty]: Start isEmpty. Operand 48304 states and 50746 transitions.
[2025-03-03 11:05:42,819 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1699
[2025-03-03 11:05:42,820 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 11:05:42,820 INFO  L218           NwaCegarLoop]: trace histogram [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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-03-03 11:05:42,820 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2025-03-03 11:05:42,820 INFO  L396      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 11:05:42,821 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 11:05:42,821 INFO  L85        PathProgramCache]: Analyzing trace with hash 896534074, now seen corresponding path program 1 times
[2025-03-03 11:05:42,821 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 11:05:42,821 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733065346]
[2025-03-03 11:05:42,822 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 11:05:42,822 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 11:05:42,886 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1698 statements into 1 equivalence classes.
[2025-03-03 11:05:42,927 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1698 of 1698 statements.
[2025-03-03 11:05:42,927 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 11:05:42,927 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 11:05:44,627 INFO  L134       CoverageAnalysis]: Checked inductivity of 2216 backedges. 549 proven. 1581 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked.
[2025-03-03 11:05:44,627 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 11:05:44,627 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733065346]
[2025-03-03 11:05:44,627 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733065346] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 11:05:44,628 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1866622530]
[2025-03-03 11:05:44,628 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 11:05:44,628 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 11:05:44,629 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 11:05:44,630 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-03 11:05:44,631 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2025-03-03 11:05:44,732 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1698 statements into 1 equivalence classes.
[2025-03-03 11:05:44,975 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1698 of 1698 statements.
[2025-03-03 11:05:44,976 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 11:05:44,976 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 11:05:44,981 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1899 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-03-03 11:05:45,008 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 11:05:45,555 INFO  L134       CoverageAnalysis]: Checked inductivity of 2216 backedges. 1166 proven. 0 refuted. 0 times theorem prover too weak. 1050 trivial. 0 not checked.
[2025-03-03 11:05:45,555 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-03 11:05:45,555 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1866622530] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 11:05:45,555 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-03 11:05:45,556 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9
[2025-03-03 11:05:45,556 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130027890]
[2025-03-03 11:05:45,556 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 11:05:45,557 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 11:05:45,557 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 11:05:45,557 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 11:05:45,558 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2025-03-03 11:05:45,558 INFO  L87              Difference]: Start difference. First operand 48304 states and 50746 transitions. Second operand  has 3 states, 3 states have (on average 356.3333333333333) internal successors, (1069), 3 states have internal predecessors, (1069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 11:05:46,768 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 11:05:46,768 INFO  L93              Difference]: Finished difference Result 98676 states and 103592 transitions.
[2025-03-03 11:05:46,769 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 11:05:46,769 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 356.3333333333333) internal successors, (1069), 3 states have internal predecessors, (1069), 0 states have call successors, (0), 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 1698
[2025-03-03 11:05:46,770 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 11:05:46,810 INFO  L225             Difference]: With dead ends: 98676
[2025-03-03 11:05:46,810 INFO  L226             Difference]: Without dead ends: 48304
[2025-03-03 11:05:46,834 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 1705 GetRequests, 1698 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2025-03-03 11:05:46,835 INFO  L435           NwaCegarLoop]: 800 mSDtfsCounter, 184 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1653 mSolverCounterSat, 209 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 806 SdHoareTripleChecker+Invalid, 1862 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 209 IncrementalHoareTripleChecker+Valid, 1653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time
[2025-03-03 11:05:46,835 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 806 Invalid, 1862 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [209 Valid, 1653 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time]
[2025-03-03 11:05:46,861 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 48304 states.
[2025-03-03 11:05:47,160 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 48304 to 48304.
[2025-03-03 11:05:47,191 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 48304 states, 48303 states have (on average 1.0461669047471172) internal successors, (50533), 48303 states have internal predecessors, (50533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 11:05:47,230 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 48304 states to 48304 states and 50533 transitions.
[2025-03-03 11:05:47,231 INFO  L78                 Accepts]: Start accepts. Automaton has 48304 states and 50533 transitions. Word has length 1698
[2025-03-03 11:05:47,231 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 11:05:47,231 INFO  L471      AbstractCegarLoop]: Abstraction has 48304 states and 50533 transitions.
[2025-03-03 11:05:47,231 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 356.3333333333333) internal successors, (1069), 3 states have internal predecessors, (1069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 11:05:47,231 INFO  L276                IsEmpty]: Start isEmpty. Operand 48304 states and 50533 transitions.
[2025-03-03 11:05:47,264 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1750
[2025-03-03 11:05:47,264 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 11:05:47,265 INFO  L218           NwaCegarLoop]: trace histogram [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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-03-03 11:05:47,273 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2025-03-03 11:05:47,465 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 11:05:47,466 INFO  L396      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 11:05:47,466 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 11:05:47,467 INFO  L85        PathProgramCache]: Analyzing trace with hash -1279374536, now seen corresponding path program 1 times
[2025-03-03 11:05:47,467 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 11:05:47,467 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347412199]
[2025-03-03 11:05:47,467 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 11:05:47,467 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 11:05:47,535 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1749 statements into 1 equivalence classes.
[2025-03-03 11:05:47,650 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1749 of 1749 statements.
[2025-03-03 11:05:47,650 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 11:05:47,650 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 11:05:49,685 INFO  L134       CoverageAnalysis]: Checked inductivity of 2576 backedges. 627 proven. 1682 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked.
[2025-03-03 11:05:49,685 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 11:05:49,685 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347412199]
[2025-03-03 11:05:49,685 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347412199] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 11:05:49,685 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [387523679]
[2025-03-03 11:05:49,685 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 11:05:49,685 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 11:05:49,685 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 11:05:49,687 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-03 11:05:49,688 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2025-03-03 11:05:49,783 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1749 statements into 1 equivalence classes.
[2025-03-03 11:05:49,969 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1749 of 1749 statements.
[2025-03-03 11:05:49,969 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 11:05:49,969 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 11:05:49,975 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1970 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-03-03 11:05:49,985 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 11:05:50,477 INFO  L134       CoverageAnalysis]: Checked inductivity of 2576 backedges. 1605 proven. 0 refuted. 0 times theorem prover too weak. 971 trivial. 0 not checked.
[2025-03-03 11:05:50,477 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-03 11:05:50,477 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [387523679] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 11:05:50,477 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-03 11:05:50,478 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9
[2025-03-03 11:05:50,478 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489425610]
[2025-03-03 11:05:50,478 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 11:05:50,478 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 11:05:50,478 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 11:05:50,479 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 11:05:50,479 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72
[2025-03-03 11:05:50,479 INFO  L87              Difference]: Start difference. First operand 48304 states and 50533 transitions. Second operand  has 3 states, 3 states have (on average 356.6666666666667) internal successors, (1070), 3 states have internal predecessors, (1070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 11:05:51,750 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 11:05:51,750 INFO  L93              Difference]: Finished difference Result 113166 states and 118920 transitions.
[2025-03-03 11:05:51,751 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 11:05:51,751 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 356.6666666666667) internal successors, (1070), 3 states have internal predecessors, (1070), 0 states have call successors, (0), 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 1749
[2025-03-03 11:05:51,752 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 11:05:51,812 INFO  L225             Difference]: With dead ends: 113166
[2025-03-03 11:05:51,813 INFO  L226             Difference]: Without dead ends: 65554
[2025-03-03 11:05:51,844 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 1756 GetRequests, 1749 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72
[2025-03-03 11:05:51,845 INFO  L435           NwaCegarLoop]: 139 mSDtfsCounter, 196 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1726 mSolverCounterSat, 211 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 1937 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 211 IncrementalHoareTripleChecker+Valid, 1726 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time
[2025-03-03 11:05:51,845 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 144 Invalid, 1937 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [211 Valid, 1726 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2025-03-03 11:05:51,882 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 65554 states.
[2025-03-03 11:05:52,223 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 65554 to 64864.
[2025-03-03 11:05:52,266 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 64864 states, 64863 states have (on average 1.0424433035783112) internal successors, (67616), 64863 states have internal predecessors, (67616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 11:05:52,323 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 64864 states to 64864 states and 67616 transitions.
[2025-03-03 11:05:52,323 INFO  L78                 Accepts]: Start accepts. Automaton has 64864 states and 67616 transitions. Word has length 1749
[2025-03-03 11:05:52,324 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 11:05:52,324 INFO  L471      AbstractCegarLoop]: Abstraction has 64864 states and 67616 transitions.
[2025-03-03 11:05:52,324 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 356.6666666666667) internal successors, (1070), 3 states have internal predecessors, (1070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 11:05:52,324 INFO  L276                IsEmpty]: Start isEmpty. Operand 64864 states and 67616 transitions.
[2025-03-03 11:05:52,359 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1791
[2025-03-03 11:05:52,359 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 11:05:52,360 INFO  L218           NwaCegarLoop]: trace histogram [9, 9, 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, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-03-03 11:05:52,367 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0
[2025-03-03 11:05:52,560 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17
[2025-03-03 11:05:52,560 INFO  L396      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 11:05:52,561 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 11:05:52,561 INFO  L85        PathProgramCache]: Analyzing trace with hash -849435745, now seen corresponding path program 1 times
[2025-03-03 11:05:52,561 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 11:05:52,561 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906812106]
[2025-03-03 11:05:52,561 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 11:05:52,562 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 11:05:52,725 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1790 statements into 1 equivalence classes.
[2025-03-03 11:05:52,771 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1790 of 1790 statements.
[2025-03-03 11:05:52,771 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 11:05:52,771 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 11:05:54,050 INFO  L134       CoverageAnalysis]: Checked inductivity of 3161 backedges. 2034 proven. 0 refuted. 0 times theorem prover too weak. 1127 trivial. 0 not checked.
[2025-03-03 11:05:54,050 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 11:05:54,050 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906812106]
[2025-03-03 11:05:54,050 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906812106] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 11:05:54,050 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 11:05:54,050 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 11:05:54,050 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231556940]
[2025-03-03 11:05:54,050 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 11:05:54,051 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 11:05:54,051 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 11:05:54,052 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 11:05:54,052 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 11:05:54,052 INFO  L87              Difference]: Start difference. First operand 64864 states and 67616 transitions. Second operand  has 3 states, 3 states have (on average 379.3333333333333) internal successors, (1138), 3 states have internal predecessors, (1138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 11:05:55,403 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 11:05:55,404 INFO  L93              Difference]: Finished difference Result 129036 states and 134539 transitions.
[2025-03-03 11:05:55,404 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 11:05:55,404 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 379.3333333333333) internal successors, (1138), 3 states have internal predecessors, (1138), 0 states have call successors, (0), 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 1790
[2025-03-03 11:05:55,405 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 11:05:55,469 INFO  L225             Difference]: With dead ends: 129036
[2025-03-03 11:05:55,470 INFO  L226             Difference]: Without dead ends: 64864
[2025-03-03 11:05:55,497 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 11:05:55,498 INFO  L435           NwaCegarLoop]: 752 mSDtfsCounter, 657 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1660 mSolverCounterSat, 224 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 657 SdHoareTripleChecker+Valid, 758 SdHoareTripleChecker+Invalid, 1884 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 224 IncrementalHoareTripleChecker+Valid, 1660 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time
[2025-03-03 11:05:55,498 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [657 Valid, 758 Invalid, 1884 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [224 Valid, 1660 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2025-03-03 11:05:55,541 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 64864 states.
[2025-03-03 11:05:55,901 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 64864 to 64864.
[2025-03-03 11:05:55,938 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 64864 states, 64863 states have (on average 1.0409786781369965) internal successors, (67521), 64863 states have internal predecessors, (67521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 11:05:55,990 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 64864 states to 64864 states and 67521 transitions.
[2025-03-03 11:05:55,990 INFO  L78                 Accepts]: Start accepts. Automaton has 64864 states and 67521 transitions. Word has length 1790
[2025-03-03 11:05:55,991 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 11:05:55,991 INFO  L471      AbstractCegarLoop]: Abstraction has 64864 states and 67521 transitions.
[2025-03-03 11:05:55,991 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 379.3333333333333) internal successors, (1138), 3 states have internal predecessors, (1138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 11:05:55,991 INFO  L276                IsEmpty]: Start isEmpty. Operand 64864 states and 67521 transitions.
[2025-03-03 11:05:56,026 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1802
[2025-03-03 11:05:56,026 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 11:05:56,026 INFO  L218           NwaCegarLoop]: trace histogram [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, 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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-03-03 11:05:56,026 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2025-03-03 11:05:56,027 INFO  L396      AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 11:05:56,027 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 11:05:56,027 INFO  L85        PathProgramCache]: Analyzing trace with hash 100966735, now seen corresponding path program 1 times
[2025-03-03 11:05:56,027 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 11:05:56,027 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341254218]
[2025-03-03 11:05:56,028 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 11:05:56,028 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 11:05:56,098 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1801 statements into 1 equivalence classes.
[2025-03-03 11:05:56,225 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1801 of 1801 statements.
[2025-03-03 11:05:56,225 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 11:05:56,225 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 11:05:57,426 INFO  L134       CoverageAnalysis]: Checked inductivity of 2913 backedges. 1277 proven. 0 refuted. 0 times theorem prover too weak. 1636 trivial. 0 not checked.
[2025-03-03 11:05:57,426 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 11:05:57,427 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341254218]
[2025-03-03 11:05:57,427 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341254218] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 11:05:57,427 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 11:05:57,427 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 11:05:57,427 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973483664]
[2025-03-03 11:05:57,427 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 11:05:57,428 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 11:05:57,428 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 11:05:57,429 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 11:05:57,429 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 11:05:57,429 INFO  L87              Difference]: Start difference. First operand 64864 states and 67521 transitions. Second operand  has 3 states, 3 states have (on average 357.0) internal successors, (1071), 3 states have internal predecessors, (1071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 11:05:58,954 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 11:05:58,954 INFO  L93              Difference]: Finished difference Result 132486 states and 138041 transitions.
[2025-03-03 11:05:58,955 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 11:05:58,955 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 357.0) internal successors, (1071), 3 states have internal predecessors, (1071), 0 states have call successors, (0), 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 1801
[2025-03-03 11:05:58,956 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 11:05:59,020 INFO  L225             Difference]: With dead ends: 132486
[2025-03-03 11:05:59,020 INFO  L226             Difference]: Without dead ends: 68314
[2025-03-03 11:05:59,057 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 11:05:59,057 INFO  L435           NwaCegarLoop]: 244 mSDtfsCounter, 158 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1720 mSolverCounterSat, 213 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 1933 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 213 IncrementalHoareTripleChecker+Valid, 1720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time
[2025-03-03 11:05:59,057 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 249 Invalid, 1933 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [213 Valid, 1720 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time]
[2025-03-03 11:05:59,099 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 68314 states.
[2025-03-03 11:05:59,611 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 68314 to 58654.
[2025-03-03 11:05:59,652 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 58654 states, 58653 states have (on average 1.037593984962406) internal successors, (60858), 58653 states have internal predecessors, (60858), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 11:05:59,719 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 58654 states to 58654 states and 60858 transitions.
[2025-03-03 11:05:59,720 INFO  L78                 Accepts]: Start accepts. Automaton has 58654 states and 60858 transitions. Word has length 1801
[2025-03-03 11:05:59,721 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 11:05:59,721 INFO  L471      AbstractCegarLoop]: Abstraction has 58654 states and 60858 transitions.
[2025-03-03 11:05:59,722 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 357.0) internal successors, (1071), 3 states have internal predecessors, (1071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 11:05:59,722 INFO  L276                IsEmpty]: Start isEmpty. Operand 58654 states and 60858 transitions.
[2025-03-03 11:05:59,780 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1833
[2025-03-03 11:05:59,780 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 11:05:59,781 INFO  L218           NwaCegarLoop]: trace histogram [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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-03-03 11:05:59,781 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2025-03-03 11:05:59,781 INFO  L396      AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 11:05:59,782 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 11:05:59,782 INFO  L85        PathProgramCache]: Analyzing trace with hash 646870148, now seen corresponding path program 1 times
[2025-03-03 11:05:59,782 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 11:05:59,782 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84115128]
[2025-03-03 11:05:59,782 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 11:05:59,782 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 11:05:59,871 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1832 statements into 1 equivalence classes.
[2025-03-03 11:05:59,919 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1832 of 1832 statements.
[2025-03-03 11:05:59,920 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 11:05:59,920 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 11:06:00,643 INFO  L134       CoverageAnalysis]: Checked inductivity of 2841 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 2815 trivial. 0 not checked.
[2025-03-03 11:06:00,643 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 11:06:00,643 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84115128]
[2025-03-03 11:06:00,643 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84115128] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 11:06:00,643 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 11:06:00,644 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 11:06:00,644 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447003033]
[2025-03-03 11:06:00,644 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 11:06:00,644 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 11:06:00,644 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 11:06:00,645 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 11:06:00,645 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 11:06:00,645 INFO  L87              Difference]: Start difference. First operand 58654 states and 60858 transitions. Second operand  has 3 states, 3 states have (on average 186.0) internal successors, (558), 3 states have internal predecessors, (558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 11:06:01,859 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 11:06:01,859 INFO  L93              Difference]: Finished difference Result 117306 states and 121714 transitions.
[2025-03-03 11:06:01,860 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 11:06:01,860 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 186.0) internal successors, (558), 3 states have internal predecessors, (558), 0 states have call successors, (0), 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 1832
[2025-03-03 11:06:01,861 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 11:06:01,921 INFO  L225             Difference]: With dead ends: 117306
[2025-03-03 11:06:01,921 INFO  L226             Difference]: Without dead ends: 58654
[2025-03-03 11:06:01,952 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 11:06:01,953 INFO  L435           NwaCegarLoop]: 927 mSDtfsCounter, 690 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1652 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 690 SdHoareTripleChecker+Valid, 934 SdHoareTripleChecker+Invalid, 1781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 1652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time
[2025-03-03 11:06:01,953 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [690 Valid, 934 Invalid, 1781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 1652 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time]
[2025-03-03 11:06:01,988 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 58654 states.
[2025-03-03 11:06:02,301 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 58654 to 58654.
[2025-03-03 11:06:02,338 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 58654 states, 58653 states have (on average 1.0328201456021004) internal successors, (60578), 58653 states have internal predecessors, (60578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 11:06:02,606 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 58654 states to 58654 states and 60578 transitions.
[2025-03-03 11:06:02,607 INFO  L78                 Accepts]: Start accepts. Automaton has 58654 states and 60578 transitions. Word has length 1832
[2025-03-03 11:06:02,608 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 11:06:02,608 INFO  L471      AbstractCegarLoop]: Abstraction has 58654 states and 60578 transitions.
[2025-03-03 11:06:02,608 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 186.0) internal successors, (558), 3 states have internal predecessors, (558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 11:06:02,608 INFO  L276                IsEmpty]: Start isEmpty. Operand 58654 states and 60578 transitions.
[2025-03-03 11:06:02,643 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1844
[2025-03-03 11:06:02,643 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 11:06:02,643 INFO  L218           NwaCegarLoop]: trace histogram [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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-03-03 11:06:02,643 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2025-03-03 11:06:02,644 INFO  L396      AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 11:06:02,644 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 11:06:02,645 INFO  L85        PathProgramCache]: Analyzing trace with hash -703302366, now seen corresponding path program 1 times
[2025-03-03 11:06:02,645 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 11:06:02,645 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029286041]
[2025-03-03 11:06:02,645 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 11:06:02,645 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 11:06:02,715 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1843 statements into 1 equivalence classes.
[2025-03-03 11:06:02,758 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1843 of 1843 statements.
[2025-03-03 11:06:02,758 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 11:06:02,758 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 11:06:05,052 INFO  L134       CoverageAnalysis]: Checked inductivity of 2216 backedges. 1747 proven. 0 refuted. 0 times theorem prover too weak. 469 trivial. 0 not checked.
[2025-03-03 11:06:05,052 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 11:06:05,052 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029286041]
[2025-03-03 11:06:05,052 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029286041] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 11:06:05,052 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 11:06:05,053 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-03-03 11:06:05,053 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989953688]
[2025-03-03 11:06:05,053 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 11:06:05,054 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-03 11:06:05,054 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 11:06:05,055 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-03 11:06:05,055 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2025-03-03 11:06:05,055 INFO  L87              Difference]: Start difference. First operand 58654 states and 60578 transitions. Second operand  has 6 states, 6 states have (on average 243.5) internal successors, (1461), 6 states have internal predecessors, (1461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 11:06:10,930 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 11:06:10,930 INFO  L93              Difference]: Finished difference Result 172082 states and 178031 transitions.
[2025-03-03 11:06:10,931 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2025-03-03 11:06:10,931 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 243.5) internal successors, (1461), 6 states have internal predecessors, (1461), 0 states have call successors, (0), 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 1843
[2025-03-03 11:06:10,932 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 11:06:11,047 INFO  L225             Difference]: With dead ends: 172082
[2025-03-03 11:06:11,049 INFO  L226             Difference]: Without dead ends: 114120
[2025-03-03 11:06:11,099 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156
[2025-03-03 11:06:11,101 INFO  L435           NwaCegarLoop]: 321 mSDtfsCounter, 2140 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 10195 mSolverCounterSat, 1007 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2140 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 11202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1007 IncrementalHoareTripleChecker+Valid, 10195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time
[2025-03-03 11:06:11,101 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2140 Valid, 371 Invalid, 11202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1007 Valid, 10195 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time]
[2025-03-03 11:06:11,192 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 114120 states.
[2025-03-03 11:06:11,907 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 114120 to 68314.
[2025-03-03 11:06:11,942 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 68314 states, 68313 states have (on average 1.0294526664031736) internal successors, (70325), 68313 states have internal predecessors, (70325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 11:06:11,998 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 68314 states to 68314 states and 70325 transitions.
[2025-03-03 11:06:11,999 INFO  L78                 Accepts]: Start accepts. Automaton has 68314 states and 70325 transitions. Word has length 1843
[2025-03-03 11:06:12,000 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 11:06:12,000 INFO  L471      AbstractCegarLoop]: Abstraction has 68314 states and 70325 transitions.
[2025-03-03 11:06:12,000 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 243.5) internal successors, (1461), 6 states have internal predecessors, (1461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 11:06:12,000 INFO  L276                IsEmpty]: Start isEmpty. Operand 68314 states and 70325 transitions.
[2025-03-03 11:06:12,044 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1953
[2025-03-03 11:06:12,044 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 11:06:12,045 INFO  L218           NwaCegarLoop]: trace histogram [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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-03-03 11:06:12,045 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2025-03-03 11:06:12,045 INFO  L396      AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 11:06:12,045 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 11:06:12,046 INFO  L85        PathProgramCache]: Analyzing trace with hash -607593444, now seen corresponding path program 1 times
[2025-03-03 11:06:12,046 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 11:06:12,046 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340404932]
[2025-03-03 11:06:12,046 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 11:06:12,046 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 11:06:12,124 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1952 statements into 1 equivalence classes.
[2025-03-03 11:06:12,174 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1952 of 1952 statements.
[2025-03-03 11:06:12,174 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 11:06:12,174 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 11:06:13,070 INFO  L134       CoverageAnalysis]: Checked inductivity of 2485 backedges. 1823 proven. 0 refuted. 0 times theorem prover too weak. 662 trivial. 0 not checked.
[2025-03-03 11:06:13,070 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 11:06:13,070 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340404932]
[2025-03-03 11:06:13,070 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340404932] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 11:06:13,070 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 11:06:13,070 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 11:06:13,070 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444735497]
[2025-03-03 11:06:13,071 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 11:06:13,071 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 11:06:13,071 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 11:06:13,075 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 11:06:13,075 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 11:06:13,075 INFO  L87              Difference]: Start difference. First operand 68314 states and 70325 transitions. Second operand  has 3 states, 3 states have (on average 432.3333333333333) internal successors, (1297), 3 states have internal predecessors, (1297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 11:06:14,515 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 11:06:14,515 INFO  L93              Difference]: Finished difference Result 157326 states and 162124 transitions.
[2025-03-03 11:06:14,516 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 11:06:14,516 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 432.3333333333333) internal successors, (1297), 3 states have internal predecessors, (1297), 0 states have call successors, (0), 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 1952
[2025-03-03 11:06:14,516 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 11:06:14,597 INFO  L225             Difference]: With dead ends: 157326
[2025-03-03 11:06:14,597 INFO  L226             Difference]: Without dead ends: 89704
[2025-03-03 11:06:14,642 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 11:06:14,643 INFO  L435           NwaCegarLoop]: 213 mSDtfsCounter, 616 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1735 mSolverCounterSat, 245 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 616 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 1980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 245 IncrementalHoareTripleChecker+Valid, 1735 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time
[2025-03-03 11:06:14,643 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [616 Valid, 218 Invalid, 1980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [245 Valid, 1735 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2025-03-03 11:06:14,706 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 89704 states.
[2025-03-03 11:06:15,200 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 89704 to 89014.
[2025-03-03 11:06:15,256 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 89014 states, 89013 states have (on average 1.0265466841921966) internal successors, (91376), 89013 states have internal predecessors, (91376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 11:06:15,328 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 89014 states to 89014 states and 91376 transitions.
[2025-03-03 11:06:15,329 INFO  L78                 Accepts]: Start accepts. Automaton has 89014 states and 91376 transitions. Word has length 1952
[2025-03-03 11:06:15,330 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 11:06:15,330 INFO  L471      AbstractCegarLoop]: Abstraction has 89014 states and 91376 transitions.
[2025-03-03 11:06:15,330 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 432.3333333333333) internal successors, (1297), 3 states have internal predecessors, (1297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 11:06:15,330 INFO  L276                IsEmpty]: Start isEmpty. Operand 89014 states and 91376 transitions.
[2025-03-03 11:06:15,379 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 2004
[2025-03-03 11:06:15,379 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 11:06:15,380 INFO  L218           NwaCegarLoop]: trace histogram [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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-03-03 11:06:15,380 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2025-03-03 11:06:15,380 INFO  L396      AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 11:06:15,381 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 11:06:15,381 INFO  L85        PathProgramCache]: Analyzing trace with hash 1798086868, now seen corresponding path program 1 times
[2025-03-03 11:06:15,381 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 11:06:15,381 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884667320]
[2025-03-03 11:06:15,381 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 11:06:15,381 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 11:06:15,457 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2003 statements into 1 equivalence classes.
[2025-03-03 11:06:15,508 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2003 of 2003 statements.
[2025-03-03 11:06:15,508 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 11:06:15,508 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 11:06:17,937 INFO  L134       CoverageAnalysis]: Checked inductivity of 2966 backedges. 2071 proven. 0 refuted. 0 times theorem prover too weak. 895 trivial. 0 not checked.
[2025-03-03 11:06:17,937 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 11:06:17,937 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884667320]
[2025-03-03 11:06:17,937 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884667320] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 11:06:17,937 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 11:06:17,937 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-03-03 11:06:17,937 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051054077]
[2025-03-03 11:06:17,937 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 11:06:17,938 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-03 11:06:17,938 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 11:06:17,939 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-03 11:06:17,939 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2025-03-03 11:06:17,939 INFO  L87              Difference]: Start difference. First operand 89014 states and 91376 transitions. Second operand  has 6 states, 6 states have (on average 243.66666666666666) internal successors, (1462), 6 states have internal predecessors, (1462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)