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


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


Checking for ERROR reachability
Using default analysis
Version e2fb8bed
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_label40.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 1a53e4c70dff58f3400fe09c8b43892b5493d2ca012910f006ca78f70be38079
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-e2fb8be-m
[2025-03-08 02:16:52,162 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-03-08 02:16:52,228 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2025-03-08 02:16:52,234 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-03-08 02:16:52,236 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-03-08 02:16:52,258 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-03-08 02:16:52,259 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-03-08 02:16:52,259 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-03-08 02:16:52,259 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-03-08 02:16:52,260 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-03-08 02:16:52,260 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-03-08 02:16:52,261 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-03-08 02:16:52,261 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-03-08 02:16:52,261 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-03-08 02:16:52,261 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-03-08 02:16:52,261 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-03-08 02:16:52,261 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-03-08 02:16:52,261 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-03-08 02:16:52,261 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-03-08 02:16:52,261 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-03-08 02:16:52,261 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-03-08 02:16:52,261 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-03-08 02:16:52,262 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-03-08 02:16:52,262 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-03-08 02:16:52,262 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-03-08 02:16:52,262 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-03-08 02:16:52,262 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-03-08 02:16:52,262 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-03-08 02:16:52,263 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-03-08 02:16:52,263 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-03-08 02:16:52,263 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-03-08 02:16:52,263 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-03-08 02:16:52,263 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-08 02:16:52,263 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-03-08 02:16:52,264 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-03-08 02:16:52,264 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-03-08 02:16:52,264 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-03-08 02:16:52,264 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-03-08 02:16:52,264 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-03-08 02:16:52,264 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-03-08 02:16:52,264 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-03-08 02:16:52,264 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-03-08 02:16:52,264 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-03-08 02:16:52,264 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 -> 1a53e4c70dff58f3400fe09c8b43892b5493d2ca012910f006ca78f70be38079
[2025-03-08 02:16:52,528 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-03-08 02:16:52,537 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-03-08 02:16:52,539 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-03-08 02:16:52,540 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-03-08 02:16:52,541 INFO  L274        PluginConnector]: CDTParser initialized
[2025-03-08 02:16:52,542 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem18_label40.c
[2025-03-08 02:16:53,714 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5c4aaab1/56f79af6fd44457f8020352d99253a03/FLAG742bf3676
[2025-03-08 02:16:54,100 INFO  L384              CDTParser]: Found 1 translation units.
[2025-03-08 02:16:54,102 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem18_label40.c
[2025-03-08 02:16:54,127 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5c4aaab1/56f79af6fd44457f8020352d99253a03/FLAG742bf3676
[2025-03-08 02:16:54,141 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5c4aaab1/56f79af6fd44457f8020352d99253a03
[2025-03-08 02:16:54,143 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-03-08 02:16:54,144 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-03-08 02:16:54,146 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-03-08 02:16:54,146 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-03-08 02:16:54,149 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-03-08 02:16:54,150 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:16:54" (1/1) ...
[2025-03-08 02:16:54,151 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3373b649 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:16:54, skipping insertion in model container
[2025-03-08 02:16:54,152 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:16:54" (1/1) ...
[2025-03-08 02:16:54,225 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-03-08 02:16:54,376 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_label40.c[4742,4755]
[2025-03-08 02:16:54,698 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-08 02:16:54,708 INFO  L200         MainTranslator]: Completed pre-run
[2025-03-08 02:16:54,739 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_label40.c[4742,4755]
[2025-03-08 02:16:54,917 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-08 02:16:54,932 INFO  L204         MainTranslator]: Completed translation
[2025-03-08 02:16:54,932 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:16:54 WrapperNode
[2025-03-08 02:16:54,932 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-03-08 02:16:54,934 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-03-08 02:16:54,934 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-03-08 02:16:54,934 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-03-08 02:16:54,938 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:16:54" (1/1) ...
[2025-03-08 02:16:54,966 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:16:54" (1/1) ...
[2025-03-08 02:16:55,115 INFO  L138                Inliner]: procedures = 16, calls = 10, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 4132
[2025-03-08 02:16:55,115 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-03-08 02:16:55,116 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-03-08 02:16:55,116 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-03-08 02:16:55,116 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-03-08 02:16:55,122 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:16:54" (1/1) ...
[2025-03-08 02:16:55,122 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:16:54" (1/1) ...
[2025-03-08 02:16:55,147 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:16:54" (1/1) ...
[2025-03-08 02:16:55,218 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-08 02:16:55,218 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:16:54" (1/1) ...
[2025-03-08 02:16:55,219 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:16:54" (1/1) ...
[2025-03-08 02:16:55,273 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:16:54" (1/1) ...
[2025-03-08 02:16:55,284 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:16:54" (1/1) ...
[2025-03-08 02:16:55,295 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:16:54" (1/1) ...
[2025-03-08 02:16:55,305 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:16:54" (1/1) ...
[2025-03-08 02:16:55,332 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-03-08 02:16:55,334 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-03-08 02:16:55,334 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-03-08 02:16:55,334 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-03-08 02:16:55,335 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:16:54" (1/1) ...
[2025-03-08 02:16:55,339 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-08 02:16:55,348 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 02:16:55,360 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-08 02:16:55,365 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-08 02:16:55,380 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-03-08 02:16:55,380 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-03-08 02:16:55,380 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-03-08 02:16:55,380 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-03-08 02:16:55,428 INFO  L256             CfgBuilder]: Building ICFG
[2025-03-08 02:16:55,429 INFO  L286             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-03-08 02:16:58,039 INFO  L1307  $ProcedureCfgBuilder]: dead code at ProgramPoint L1647: havoc calculate_output_#t~ret8#1;
[2025-03-08 02:16:58,039 INFO  L1307  $ProcedureCfgBuilder]: dead code at ProgramPoint L3060: havoc calculate_output2_#t~ret9#1;
[2025-03-08 02:16:58,136 INFO  L?                        ?]: Removed 639 outVars from TransFormulas that were not future-live.
[2025-03-08 02:16:58,136 INFO  L307             CfgBuilder]: Performing block encoding
[2025-03-08 02:16:58,161 INFO  L331             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-03-08 02:16:58,164 INFO  L336             CfgBuilder]: Removed 0 assume(true) statements.
[2025-03-08 02:16:58,164 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:16:58 BoogieIcfgContainer
[2025-03-08 02:16:58,164 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-03-08 02:16:58,166 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-03-08 02:16:58,166 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-03-08 02:16:58,170 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-03-08 02:16:58,170 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 02:16:54" (1/3) ...
[2025-03-08 02:16:58,171 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76cbfea2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:16:58, skipping insertion in model container
[2025-03-08 02:16:58,171 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:16:54" (2/3) ...
[2025-03-08 02:16:58,172 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76cbfea2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:16:58, skipping insertion in model container
[2025-03-08 02:16:58,172 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:16:58" (3/3) ...
[2025-03-08 02:16:58,172 INFO  L128   eAbstractionObserver]: Analyzing ICFG Problem18_label40.c
[2025-03-08 02:16:58,184 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-03-08 02:16:58,185 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG Problem18_label40.c that has 1 procedures, 757 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-03-08 02:16:58,241 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-03-08 02:16:58,249 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;@3782c9ca, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-03-08 02:16:58,249 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-03-08 02:16:58,256 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-08 02:16:58,261 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 45
[2025-03-08 02:16:58,262 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 02:16:58,262 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 02:16:58,263 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 02:16:58,267 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 02:16:58,267 INFO  L85        PathProgramCache]: Analyzing trace with hash -1247574331, now seen corresponding path program 1 times
[2025-03-08 02:16:58,272 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 02:16:58,272 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317940219]
[2025-03-08 02:16:58,273 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 02:16:58,274 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 02:16:58,326 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes.
[2025-03-08 02:16:58,356 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements.
[2025-03-08 02:16:58,356 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 02:16:58,357 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 02:16:58,485 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-08 02:16:58,485 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 02:16:58,486 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317940219]
[2025-03-08 02:16:58,486 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317940219] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 02:16:58,486 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 02:16:58,487 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-08 02:16:58,488 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794655656]
[2025-03-08 02:16:58,489 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 02:16:58,491 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 02:16:58,492 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 02:16:58,505 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 02:16:58,506 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 02:16:58,508 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 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 0 states have call successors, (0), 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-08 02:17:00,893 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 02:17:00,894 INFO  L93              Difference]: Finished difference Result 2205 states and 4263 transitions.
[2025-03-08 02:17:00,895 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 02:17:00,896 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 0 states have call successors, (0), 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 44
[2025-03-08 02:17:00,896 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 02:17:00,909 INFO  L225             Difference]: With dead ends: 2205
[2025-03-08 02:17:00,909 INFO  L226             Difference]: Without dead ends: 1384
[2025-03-08 02:17:00,915 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-08 02:17:00,918 INFO  L435           NwaCegarLoop]: 421 mSDtfsCounter, 675 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 2232 mSolverCounterSat, 530 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 675 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.3s IncrementalHoareTripleChecker+Time
[2025-03-08 02:17:00,922 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [675 Valid, 430 Invalid, 2762 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [530 Valid, 2232 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time]
[2025-03-08 02:17:00,943 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1384 states.
[2025-03-08 02:17:01,005 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1384 to 1384.
[2025-03-08 02:17:01,012 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-08 02:17:01,021 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1384 states to 1384 states and 2284 transitions.
[2025-03-08 02:17:01,022 INFO  L78                 Accepts]: Start accepts. Automaton has 1384 states and 2284 transitions. Word has length 44
[2025-03-08 02:17:01,023 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 02:17:01,023 INFO  L471      AbstractCegarLoop]: Abstraction has 1384 states and 2284 transitions.
[2025-03-08 02:17:01,023 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 0 states have call successors, (0), 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-08 02:17:01,023 INFO  L276                IsEmpty]: Start isEmpty. Operand 1384 states and 2284 transitions.
[2025-03-08 02:17:01,025 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 111
[2025-03-08 02:17:01,025 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 02:17:01,025 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 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-08 02:17:01,025 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2025-03-08 02:17:01,025 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 02:17:01,025 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 02:17:01,026 INFO  L85        PathProgramCache]: Analyzing trace with hash 1954742297, now seen corresponding path program 1 times
[2025-03-08 02:17:01,026 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 02:17:01,026 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241346430]
[2025-03-08 02:17:01,026 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 02:17:01,026 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 02:17:01,036 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes.
[2025-03-08 02:17:01,071 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements.
[2025-03-08 02:17:01,075 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 02:17:01,076 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 02:17:01,212 INFO  L134       CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 02:17:01,212 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 02:17:01,212 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241346430]
[2025-03-08 02:17:01,212 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241346430] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 02:17:01,213 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 02:17:01,214 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-08 02:17:01,214 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119798759]
[2025-03-08 02:17:01,214 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 02:17:01,215 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 02:17:01,215 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 02:17:01,216 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 02:17:01,216 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 02:17:01,216 INFO  L87              Difference]: Start difference. First operand 1384 states and 2284 transitions. Second operand  has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 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-08 02:17:03,349 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 02:17:03,350 INFO  L93              Difference]: Finished difference Result 4146 states and 6847 transitions.
[2025-03-08 02:17:03,353 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 02:17:03,353 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 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 110
[2025-03-08 02:17:03,353 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 02:17:03,364 INFO  L225             Difference]: With dead ends: 4146
[2025-03-08 02:17:03,365 INFO  L226             Difference]: Without dead ends: 2764
[2025-03-08 02:17:03,369 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-08 02:17:03,370 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.1s IncrementalHoareTripleChecker+Time
[2025-03-08 02:17:03,370 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.1s Time]
[2025-03-08 02:17:03,373 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2764 states.
[2025-03-08 02:17:03,412 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2764 to 2764.
[2025-03-08 02:17:03,415 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-08 02:17:03,419 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2764 states to 2764 states and 3881 transitions.
[2025-03-08 02:17:03,419 INFO  L78                 Accepts]: Start accepts. Automaton has 2764 states and 3881 transitions. Word has length 110
[2025-03-08 02:17:03,419 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 02:17:03,419 INFO  L471      AbstractCegarLoop]: Abstraction has 2764 states and 3881 transitions.
[2025-03-08 02:17:03,419 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 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-08 02:17:03,419 INFO  L276                IsEmpty]: Start isEmpty. Operand 2764 states and 3881 transitions.
[2025-03-08 02:17:03,422 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 112
[2025-03-08 02:17:03,422 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 02:17:03,422 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 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-08 02:17:03,422 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-03-08 02:17:03,423 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 02:17:03,423 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 02:17:03,423 INFO  L85        PathProgramCache]: Analyzing trace with hash 394103283, now seen corresponding path program 1 times
[2025-03-08 02:17:03,423 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 02:17:03,423 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281771653]
[2025-03-08 02:17:03,423 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 02:17:03,423 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 02:17:03,441 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes.
[2025-03-08 02:17:03,455 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements.
[2025-03-08 02:17:03,455 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 02:17:03,455 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 02:17:03,582 INFO  L134       CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 02:17:03,582 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 02:17:03,582 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281771653]
[2025-03-08 02:17:03,582 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281771653] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 02:17:03,582 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 02:17:03,582 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-08 02:17:03,582 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827618017]
[2025-03-08 02:17:03,582 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 02:17:03,583 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 02:17:03,583 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 02:17:03,583 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 02:17:03,583 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 02:17:03,583 INFO  L87              Difference]: Start difference. First operand 2764 states and 3881 transitions. Second operand  has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 0 states have call successors, (0), 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-08 02:17:05,504 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 02:17:05,504 INFO  L93              Difference]: Finished difference Result 8288 states and 11639 transitions.
[2025-03-08 02:17:05,505 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 02:17:05,505 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 0 states have call successors, (0), 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 111
[2025-03-08 02:17:05,506 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 02:17:05,522 INFO  L225             Difference]: With dead ends: 8288
[2025-03-08 02:17:05,523 INFO  L226             Difference]: Without dead ends: 5526
[2025-03-08 02:17:05,527 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-08 02:17:05,527 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.9s IncrementalHoareTripleChecker+Time
[2025-03-08 02:17:05,528 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.9s Time]
[2025-03-08 02:17:05,532 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 5526 states.
[2025-03-08 02:17:05,594 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 5526 to 5524.
[2025-03-08 02:17:05,601 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-08 02:17:05,609 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5524 states to 5524 states and 6991 transitions.
[2025-03-08 02:17:05,609 INFO  L78                 Accepts]: Start accepts. Automaton has 5524 states and 6991 transitions. Word has length 111
[2025-03-08 02:17:05,610 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 02:17:05,610 INFO  L471      AbstractCegarLoop]: Abstraction has 5524 states and 6991 transitions.
[2025-03-08 02:17:05,610 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 0 states have call successors, (0), 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-08 02:17:05,610 INFO  L276                IsEmpty]: Start isEmpty. Operand 5524 states and 6991 transitions.
[2025-03-08 02:17:05,611 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 138
[2025-03-08 02:17:05,611 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 02:17:05,611 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 02:17:05,611 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-03-08 02:17:05,611 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 02:17:05,613 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 02:17:05,613 INFO  L85        PathProgramCache]: Analyzing trace with hash 547723666, now seen corresponding path program 1 times
[2025-03-08 02:17:05,614 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 02:17:05,614 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010493547]
[2025-03-08 02:17:05,614 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 02:17:05,614 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 02:17:05,631 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes.
[2025-03-08 02:17:05,645 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements.
[2025-03-08 02:17:05,646 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 02:17:05,646 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 02:17:06,029 INFO  L134       CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 02:17:06,030 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 02:17:06,030 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010493547]
[2025-03-08 02:17:06,030 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010493547] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 02:17:06,030 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 02:17:06,030 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 02:17:06,030 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955187635]
[2025-03-08 02:17:06,030 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 02:17:06,030 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-08 02:17:06,030 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 02:17:06,031 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-08 02:17:06,031 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-08 02:17:06,031 INFO  L87              Difference]: Start difference. First operand 5524 states and 6991 transitions. Second operand  has 4 states, 4 states have (on average 34.25) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 02:17:09,227 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 02:17:09,227 INFO  L93              Difference]: Finished difference Result 13808 states and 17091 transitions.
[2025-03-08 02:17:09,227 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-08 02:17:09,228 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 34.25) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 137
[2025-03-08 02:17:09,229 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 02:17:09,250 INFO  L225             Difference]: With dead ends: 13808
[2025-03-08 02:17:09,250 INFO  L226             Difference]: Without dead ends: 8286
[2025-03-08 02:17:09,257 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-08 02:17:09,257 INFO  L435           NwaCegarLoop]: 625 mSDtfsCounter, 1925 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 4350 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1925 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 4467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 4350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time
[2025-03-08 02:17:09,257 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1925 Valid, 643 Invalid, 4467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 4350 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time]
[2025-03-08 02:17:09,264 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 8286 states.
[2025-03-08 02:17:09,353 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 8286 to 8284.
[2025-03-08 02:17:09,364 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 8284 states, 8283 states have (on average 1.202100688156465) internal successors, (9957), 8283 states have internal predecessors, (9957), 0 states have call successors, (0), 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-08 02:17:09,377 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8284 states to 8284 states and 9957 transitions.
[2025-03-08 02:17:09,378 INFO  L78                 Accepts]: Start accepts. Automaton has 8284 states and 9957 transitions. Word has length 137
[2025-03-08 02:17:09,378 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 02:17:09,378 INFO  L471      AbstractCegarLoop]: Abstraction has 8284 states and 9957 transitions.
[2025-03-08 02:17:09,378 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 34.25) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 02:17:09,378 INFO  L276                IsEmpty]: Start isEmpty. Operand 8284 states and 9957 transitions.
[2025-03-08 02:17:09,380 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 227
[2025-03-08 02:17:09,380 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 02:17:09,380 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 02:17:09,380 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-03-08 02:17:09,380 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 02:17:09,380 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 02:17:09,381 INFO  L85        PathProgramCache]: Analyzing trace with hash -1433811977, now seen corresponding path program 1 times
[2025-03-08 02:17:09,381 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 02:17:09,381 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411239569]
[2025-03-08 02:17:09,381 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 02:17:09,381 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 02:17:09,404 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes.
[2025-03-08 02:17:09,428 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements.
[2025-03-08 02:17:09,429 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 02:17:09,429 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 02:17:09,707 INFO  L134       CoverageAnalysis]: Checked inductivity of 41 backedges. 10 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 02:17:09,707 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 02:17:09,707 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411239569]
[2025-03-08 02:17:09,707 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411239569] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-08 02:17:09,707 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1810540762]
[2025-03-08 02:17:09,707 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 02:17:09,707 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-08 02:17:09,707 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 02:17:09,715 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-08 02:17:09,716 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-08 02:17:09,763 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes.
[2025-03-08 02:17:09,796 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements.
[2025-03-08 02:17:09,796 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 02:17:09,796 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 02:17:09,798 INFO  L256         TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-03-08 02:17:09,804 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 02:17:09,877 INFO  L134       CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 02:17:09,877 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-08 02:17:09,877 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1810540762] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 02:17:09,878 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-08 02:17:09,878 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6
[2025-03-08 02:17:09,878 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744030599]
[2025-03-08 02:17:09,878 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 02:17:09,878 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 02:17:09,878 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 02:17:09,879 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 02:17:09,879 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2025-03-08 02:17:09,879 INFO  L87              Difference]: Start difference. First operand 8284 states and 9957 transitions. Second operand  has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 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-08 02:17:11,939 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 02:17:11,939 INFO  L93              Difference]: Finished difference Result 22086 states and 26900 transitions.
[2025-03-08 02:17:11,940 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 02:17:11,940 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 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 226
[2025-03-08 02:17:11,940 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 02:17:11,970 INFO  L225             Difference]: With dead ends: 22086
[2025-03-08 02:17:11,970 INFO  L226             Difference]: Without dead ends: 13804
[2025-03-08 02:17:11,978 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2025-03-08 02:17:11,978 INFO  L435           NwaCegarLoop]: 1316 mSDtfsCounter, 649 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1968 mSolverCounterSat, 753 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 649 SdHoareTripleChecker+Valid, 1323 SdHoareTripleChecker+Invalid, 2721 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 753 IncrementalHoareTripleChecker+Valid, 1968 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time
[2025-03-08 02:17:11,979 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [649 Valid, 1323 Invalid, 2721 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [753 Valid, 1968 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time]
[2025-03-08 02:17:11,989 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 13804 states.
[2025-03-08 02:17:12,122 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 13804 to 12424.
[2025-03-08 02:17:12,142 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 12424 states, 12423 states have (on average 1.1787007969089591) internal successors, (14643), 12423 states have internal predecessors, (14643), 0 states have call successors, (0), 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-08 02:17:12,155 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 12424 states to 12424 states and 14643 transitions.
[2025-03-08 02:17:12,155 INFO  L78                 Accepts]: Start accepts. Automaton has 12424 states and 14643 transitions. Word has length 226
[2025-03-08 02:17:12,156 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 02:17:12,156 INFO  L471      AbstractCegarLoop]: Abstraction has 12424 states and 14643 transitions.
[2025-03-08 02:17:12,156 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 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-08 02:17:12,156 INFO  L276                IsEmpty]: Start isEmpty. Operand 12424 states and 14643 transitions.
[2025-03-08 02:17:12,160 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 345
[2025-03-08 02:17:12,160 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 02:17:12,161 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-03-08 02:17:12,168 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-08 02:17:12,361 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-08 02:17:12,362 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 02:17:12,363 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 02:17:12,363 INFO  L85        PathProgramCache]: Analyzing trace with hash -330807223, now seen corresponding path program 1 times
[2025-03-08 02:17:12,363 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 02:17:12,363 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206923923]
[2025-03-08 02:17:12,363 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 02:17:12,363 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 02:17:12,383 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 344 statements into 1 equivalence classes.
[2025-03-08 02:17:12,395 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 344 of 344 statements.
[2025-03-08 02:17:12,396 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 02:17:12,396 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 02:17:12,679 INFO  L134       CoverageAnalysis]: Checked inductivity of 200 backedges. 200 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 02:17:12,679 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 02:17:12,679 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206923923]
[2025-03-08 02:17:12,679 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206923923] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 02:17:12,679 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 02:17:12,679 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 02:17:12,679 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920764053]
[2025-03-08 02:17:12,679 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 02:17:12,679 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-08 02:17:12,679 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 02:17:12,680 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-08 02:17:12,680 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-08 02:17:12,680 INFO  L87              Difference]: Start difference. First operand 12424 states and 14643 transitions. Second operand  has 4 states, 4 states have (on average 86.0) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 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-08 02:17:14,617 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 02:17:14,617 INFO  L93              Difference]: Finished difference Result 27661 states and 32159 transitions.
[2025-03-08 02:17:14,618 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-08 02:17:14,618 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 86.0) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 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 344
[2025-03-08 02:17:14,622 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 02:17:14,645 INFO  L225             Difference]: With dead ends: 27661
[2025-03-08 02:17:14,645 INFO  L226             Difference]: Without dead ends: 15186
[2025-03-08 02:17:14,656 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-08 02:17:14,657 INFO  L435           NwaCegarLoop]: 626 mSDtfsCounter, 531 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 2592 mSolverCounterSat, 381 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 531 SdHoareTripleChecker+Valid, 639 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.8s IncrementalHoareTripleChecker+Time
[2025-03-08 02:17:14,657 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [531 Valid, 639 Invalid, 2973 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [381 Valid, 2592 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time]
[2025-03-08 02:17:14,667 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 15186 states.
[2025-03-08 02:17:14,773 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 15186 to 15184.
[2025-03-08 02:17:14,788 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 15184 states, 15183 states have (on average 1.1130211420667853) internal successors, (16899), 15183 states have internal predecessors, (16899), 0 states have call successors, (0), 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-08 02:17:14,804 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 15184 states to 15184 states and 16899 transitions.
[2025-03-08 02:17:14,805 INFO  L78                 Accepts]: Start accepts. Automaton has 15184 states and 16899 transitions. Word has length 344
[2025-03-08 02:17:14,805 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 02:17:14,805 INFO  L471      AbstractCegarLoop]: Abstraction has 15184 states and 16899 transitions.
[2025-03-08 02:17:14,805 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 86.0) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 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-08 02:17:14,805 INFO  L276                IsEmpty]: Start isEmpty. Operand 15184 states and 16899 transitions.
[2025-03-08 02:17:14,808 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 411
[2025-03-08 02:17:14,809 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 02:17:14,809 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 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-08 02:17:14,809 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-03-08 02:17:14,809 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 02:17:14,809 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 02:17:14,810 INFO  L85        PathProgramCache]: Analyzing trace with hash -905127139, now seen corresponding path program 1 times
[2025-03-08 02:17:14,810 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 02:17:14,810 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240789157]
[2025-03-08 02:17:14,810 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 02:17:14,810 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 02:17:14,831 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 410 statements into 1 equivalence classes.
[2025-03-08 02:17:14,849 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 410 of 410 statements.
[2025-03-08 02:17:14,850 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 02:17:14,850 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 02:17:15,089 INFO  L134       CoverageAnalysis]: Checked inductivity of 149 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 02:17:15,089 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 02:17:15,089 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240789157]
[2025-03-08 02:17:15,090 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240789157] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 02:17:15,090 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 02:17:15,090 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 02:17:15,090 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73487330]
[2025-03-08 02:17:15,090 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 02:17:15,090 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 02:17:15,091 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 02:17:15,091 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 02:17:15,091 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 02:17:15,092 INFO  L87              Difference]: Start difference. First operand 15184 states and 16899 transitions. Second operand  has 3 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 02:17:16,806 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 02:17:16,807 INFO  L93              Difference]: Finished difference Result 37266 states and 41935 transitions.
[2025-03-08 02:17:16,807 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 02:17:16,807 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 410
[2025-03-08 02:17:16,808 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 02:17:16,841 INFO  L225             Difference]: With dead ends: 37266
[2025-03-08 02:17:16,841 INFO  L226             Difference]: Without dead ends: 22084
[2025-03-08 02:17:16,856 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-08 02:17:16,857 INFO  L435           NwaCegarLoop]: 339 mSDtfsCounter, 633 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1934 mSolverCounterSat, 490 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 633 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 2424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 490 IncrementalHoareTripleChecker+Valid, 1934 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time
[2025-03-08 02:17:16,857 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [633 Valid, 344 Invalid, 2424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [490 Valid, 1934 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time]
[2025-03-08 02:17:16,871 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 22084 states.
[2025-03-08 02:17:17,050 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 22084 to 21394.
[2025-03-08 02:17:17,068 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 21394 states, 21393 states have (on average 1.126910671715047) internal successors, (24108), 21393 states have internal predecessors, (24108), 0 states have call successors, (0), 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-08 02:17:17,086 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 21394 states to 21394 states and 24108 transitions.
[2025-03-08 02:17:17,087 INFO  L78                 Accepts]: Start accepts. Automaton has 21394 states and 24108 transitions. Word has length 410
[2025-03-08 02:17:17,087 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 02:17:17,087 INFO  L471      AbstractCegarLoop]: Abstraction has 21394 states and 24108 transitions.
[2025-03-08 02:17:17,088 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 02:17:17,088 INFO  L276                IsEmpty]: Start isEmpty. Operand 21394 states and 24108 transitions.
[2025-03-08 02:17:17,091 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 429
[2025-03-08 02:17:17,091 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 02:17:17,092 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 02:17:17,092 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-03-08 02:17:17,092 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 02:17:17,092 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 02:17:17,092 INFO  L85        PathProgramCache]: Analyzing trace with hash 1538772688, now seen corresponding path program 1 times
[2025-03-08 02:17:17,092 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 02:17:17,092 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773774942]
[2025-03-08 02:17:17,093 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 02:17:17,093 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 02:17:17,118 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 428 statements into 1 equivalence classes.
[2025-03-08 02:17:17,134 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 428 of 428 statements.
[2025-03-08 02:17:17,134 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 02:17:17,134 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 02:17:17,306 INFO  L134       CoverageAnalysis]: Checked inductivity of 167 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked.
[2025-03-08 02:17:17,307 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 02:17:17,307 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773774942]
[2025-03-08 02:17:17,307 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773774942] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 02:17:17,307 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 02:17:17,307 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-08 02:17:17,307 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354479424]
[2025-03-08 02:17:17,307 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 02:17:17,308 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 02:17:17,308 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 02:17:17,308 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 02:17:17,308 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 02:17:17,308 INFO  L87              Difference]: Start difference. First operand 21394 states and 24108 transitions. Second operand  has 3 states, 3 states have (on average 115.0) internal successors, (345), 2 states have internal predecessors, (345), 0 states have call successors, (0), 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-08 02:17:18,944 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 02:17:18,945 INFO  L93              Difference]: Finished difference Result 49686 states and 55870 transitions.
[2025-03-08 02:17:18,946 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 02:17:18,946 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 115.0) internal successors, (345), 2 states have internal predecessors, (345), 0 states have call successors, (0), 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 428
[2025-03-08 02:17:18,946 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 02:17:18,983 INFO  L225             Difference]: With dead ends: 49686
[2025-03-08 02:17:18,983 INFO  L226             Difference]: Without dead ends: 28294
[2025-03-08 02:17:18,997 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-08 02:17:18,997 INFO  L435           NwaCegarLoop]: 76 mSDtfsCounter, 465 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1794 mSolverCounterSat, 517 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 465 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 2311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 517 IncrementalHoareTripleChecker+Valid, 1794 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time
[2025-03-08 02:17:18,998 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [465 Valid, 81 Invalid, 2311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [517 Valid, 1794 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time]
[2025-03-08 02:17:19,019 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 28294 states.
[2025-03-08 02:17:19,199 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 28294 to 28294.
[2025-03-08 02:17:19,223 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 28294 states, 28293 states have (on average 1.1052557169617927) internal successors, (31271), 28293 states have internal predecessors, (31271), 0 states have call successors, (0), 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-08 02:17:19,250 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 28294 states to 28294 states and 31271 transitions.
[2025-03-08 02:17:19,250 INFO  L78                 Accepts]: Start accepts. Automaton has 28294 states and 31271 transitions. Word has length 428
[2025-03-08 02:17:19,251 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 02:17:19,251 INFO  L471      AbstractCegarLoop]: Abstraction has 28294 states and 31271 transitions.
[2025-03-08 02:17:19,251 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 115.0) internal successors, (345), 2 states have internal predecessors, (345), 0 states have call successors, (0), 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-08 02:17:19,251 INFO  L276                IsEmpty]: Start isEmpty. Operand 28294 states and 31271 transitions.
[2025-03-08 02:17:19,256 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 462
[2025-03-08 02:17:19,256 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 02:17:19,257 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-03-08 02:17:19,257 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-03-08 02:17:19,257 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 02:17:19,258 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 02:17:19,258 INFO  L85        PathProgramCache]: Analyzing trace with hash 1208096557, now seen corresponding path program 1 times
[2025-03-08 02:17:19,258 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 02:17:19,258 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480246284]
[2025-03-08 02:17:19,259 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 02:17:19,259 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 02:17:19,292 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 461 statements into 1 equivalence classes.
[2025-03-08 02:17:19,311 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 461 of 461 statements.
[2025-03-08 02:17:19,311 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 02:17:19,311 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 02:17:19,674 INFO  L134       CoverageAnalysis]: Checked inductivity of 200 backedges. 200 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 02:17:19,675 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 02:17:19,675 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480246284]
[2025-03-08 02:17:19,676 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480246284] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 02:17:19,676 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 02:17:19,676 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 02:17:19,676 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609422227]
[2025-03-08 02:17:19,676 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 02:17:19,676 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 02:17:19,676 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 02:17:19,677 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 02:17:19,677 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 02:17:19,677 INFO  L87              Difference]: Start difference. First operand 28294 states and 31271 transitions. Second operand  has 3 states, 3 states have (on average 153.66666666666666) internal successors, (461), 3 states have internal predecessors, (461), 0 states have call successors, (0), 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-08 02:17:21,445 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 02:17:21,445 INFO  L93              Difference]: Finished difference Result 62796 states and 69558 transitions.
[2025-03-08 02:17:21,445 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 02:17:21,446 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 153.66666666666666) internal successors, (461), 3 states have internal predecessors, (461), 0 states have call successors, (0), 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 461
[2025-03-08 02:17:21,446 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 02:17:21,487 INFO  L225             Difference]: With dead ends: 62796
[2025-03-08 02:17:21,487 INFO  L226             Difference]: Without dead ends: 34504
[2025-03-08 02:17:21,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-08 02:17:21,504 INFO  L435           NwaCegarLoop]: 972 mSDtfsCounter, 575 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1955 mSolverCounterSat, 264 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 575 SdHoareTripleChecker+Valid, 979 SdHoareTripleChecker+Invalid, 2219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 264 IncrementalHoareTripleChecker+Valid, 1955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time
[2025-03-08 02:17:21,504 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [575 Valid, 979 Invalid, 2219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [264 Valid, 1955 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time]
[2025-03-08 02:17:21,528 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 34504 states.
[2025-03-08 02:17:21,863 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 34504 to 33124.
[2025-03-08 02:17:21,893 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 33124 states, 33123 states have (on average 1.0961869395888053) internal successors, (36309), 33123 states have internal predecessors, (36309), 0 states have call successors, (0), 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-08 02:17:21,937 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 33124 states to 33124 states and 36309 transitions.
[2025-03-08 02:17:21,937 INFO  L78                 Accepts]: Start accepts. Automaton has 33124 states and 36309 transitions. Word has length 461
[2025-03-08 02:17:21,938 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 02:17:21,938 INFO  L471      AbstractCegarLoop]: Abstraction has 33124 states and 36309 transitions.
[2025-03-08 02:17:21,938 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 153.66666666666666) internal successors, (461), 3 states have internal predecessors, (461), 0 states have call successors, (0), 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-08 02:17:21,938 INFO  L276                IsEmpty]: Start isEmpty. Operand 33124 states and 36309 transitions.
[2025-03-08 02:17:21,942 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 497
[2025-03-08 02:17:21,943 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 02:17:21,943 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 02:17:21,943 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-03-08 02:17:21,943 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 02:17:21,944 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 02:17:21,944 INFO  L85        PathProgramCache]: Analyzing trace with hash -1430024645, now seen corresponding path program 1 times
[2025-03-08 02:17:21,944 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 02:17:21,944 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515105875]
[2025-03-08 02:17:21,944 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 02:17:21,944 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 02:17:21,967 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 496 statements into 1 equivalence classes.
[2025-03-08 02:17:21,984 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 496 of 496 statements.
[2025-03-08 02:17:21,984 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 02:17:21,984 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 02:17:22,148 INFO  L134       CoverageAnalysis]: Checked inductivity of 343 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked.
[2025-03-08 02:17:22,148 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 02:17:22,148 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515105875]
[2025-03-08 02:17:22,148 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515105875] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 02:17:22,148 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 02:17:22,148 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 02:17:22,148 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755016550]
[2025-03-08 02:17:22,148 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 02:17:22,149 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 02:17:22,149 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 02:17:22,149 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 02:17:22,149 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 02:17:22,149 INFO  L87              Difference]: Start difference. First operand 33124 states and 36309 transitions. Second operand  has 3 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 0 states have call successors, (0), 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-08 02:17:23,998 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 02:17:23,998 INFO  L93              Difference]: Finished difference Result 74526 states and 82491 transitions.
[2025-03-08 02:17:23,999 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 02:17:23,999 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 0 states have call successors, (0), 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 496
[2025-03-08 02:17:23,999 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 02:17:24,043 INFO  L225             Difference]: With dead ends: 74526
[2025-03-08 02:17:24,043 INFO  L226             Difference]: Without dead ends: 37954
[2025-03-08 02:17:24,065 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-08 02:17:24,066 INFO  L435           NwaCegarLoop]: 1090 mSDtfsCounter, 657 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1870 mSolverCounterSat, 364 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 657 SdHoareTripleChecker+Valid, 1097 SdHoareTripleChecker+Invalid, 2234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 364 IncrementalHoareTripleChecker+Valid, 1870 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time
[2025-03-08 02:17:24,066 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [657 Valid, 1097 Invalid, 2234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [364 Valid, 1870 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time]
[2025-03-08 02:17:24,094 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 37954 states.
[2025-03-08 02:17:24,322 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 37954 to 37954.
[2025-03-08 02:17:24,349 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 37954 states, 37953 states have (on average 1.0922720206571286) internal successors, (41455), 37953 states have internal predecessors, (41455), 0 states have call successors, (0), 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-08 02:17:24,382 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 37954 states to 37954 states and 41455 transitions.
[2025-03-08 02:17:24,383 INFO  L78                 Accepts]: Start accepts. Automaton has 37954 states and 41455 transitions. Word has length 496
[2025-03-08 02:17:24,384 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 02:17:24,384 INFO  L471      AbstractCegarLoop]: Abstraction has 37954 states and 41455 transitions.
[2025-03-08 02:17:24,384 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 0 states have call successors, (0), 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-08 02:17:24,384 INFO  L276                IsEmpty]: Start isEmpty. Operand 37954 states and 41455 transitions.
[2025-03-08 02:17:24,388 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 539
[2025-03-08 02:17:24,388 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 02:17:24,388 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 02:17:24,388 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-03-08 02:17:24,388 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 02:17:24,389 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 02:17:24,389 INFO  L85        PathProgramCache]: Analyzing trace with hash -1368285638, now seen corresponding path program 1 times
[2025-03-08 02:17:24,389 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 02:17:24,389 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190304093]
[2025-03-08 02:17:24,389 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 02:17:24,389 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 02:17:24,413 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 538 statements into 1 equivalence classes.
[2025-03-08 02:17:24,429 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 538 of 538 statements.
[2025-03-08 02:17:24,429 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 02:17:24,429 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 02:17:24,864 INFO  L134       CoverageAnalysis]: Checked inductivity of 381 backedges. 264 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked.
[2025-03-08 02:17:24,865 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 02:17:24,865 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190304093]
[2025-03-08 02:17:24,865 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190304093] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 02:17:24,865 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 02:17:24,865 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-08 02:17:24,865 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408696426]
[2025-03-08 02:17:24,865 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 02:17:24,865 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-08 02:17:24,865 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 02:17:24,866 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-08 02:17:24,866 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-03-08 02:17:24,866 INFO  L87              Difference]: Start difference. First operand 37954 states and 41455 transitions. Second operand  has 5 states, 5 states have (on average 84.4) internal successors, (422), 5 states have internal predecessors, (422), 0 states have call successors, (0), 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-08 02:17:26,881 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 02:17:26,881 INFO  L93              Difference]: Finished difference Result 84268 states and 92739 transitions.
[2025-03-08 02:17:26,882 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-08 02:17:26,882 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 84.4) internal successors, (422), 5 states have internal predecessors, (422), 0 states have call successors, (0), 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 538
[2025-03-08 02:17:26,882 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 02:17:26,921 INFO  L225             Difference]: With dead ends: 84268
[2025-03-08 02:17:26,921 INFO  L226             Difference]: Without dead ends: 41486
[2025-03-08 02:17:26,938 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-03-08 02:17:26,939 INFO  L435           NwaCegarLoop]: 1054 mSDtfsCounter, 2089 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 2436 mSolverCounterSat, 1148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2089 SdHoareTripleChecker+Valid, 1063 SdHoareTripleChecker+Invalid, 3584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1148 IncrementalHoareTripleChecker+Valid, 2436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time
[2025-03-08 02:17:26,939 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2089 Valid, 1063 Invalid, 3584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1148 Valid, 2436 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time]
[2025-03-08 02:17:26,963 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 41486 states.
[2025-03-08 02:17:27,169 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 41486 to 38644.
[2025-03-08 02:17:27,192 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 38644 states, 38643 states have (on average 1.05470589757524) internal successors, (40757), 38643 states have internal predecessors, (40757), 0 states have call successors, (0), 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-08 02:17:27,225 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 38644 states to 38644 states and 40757 transitions.
[2025-03-08 02:17:27,225 INFO  L78                 Accepts]: Start accepts. Automaton has 38644 states and 40757 transitions. Word has length 538
[2025-03-08 02:17:27,226 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 02:17:27,226 INFO  L471      AbstractCegarLoop]: Abstraction has 38644 states and 40757 transitions.
[2025-03-08 02:17:27,226 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 84.4) internal successors, (422), 5 states have internal predecessors, (422), 0 states have call successors, (0), 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-08 02:17:27,226 INFO  L276                IsEmpty]: Start isEmpty. Operand 38644 states and 40757 transitions.
[2025-03-08 02:17:27,232 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 678
[2025-03-08 02:17:27,233 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 02:17:27,233 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 02:17:27,233 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-03-08 02:17:27,233 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 02:17:27,233 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 02:17:27,234 INFO  L85        PathProgramCache]: Analyzing trace with hash 108857994, now seen corresponding path program 1 times
[2025-03-08 02:17:27,234 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 02:17:27,234 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103852407]
[2025-03-08 02:17:27,234 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 02:17:27,234 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 02:17:27,265 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 677 statements into 1 equivalence classes.
[2025-03-08 02:17:27,286 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 677 of 677 statements.
[2025-03-08 02:17:27,287 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 02:17:27,287 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 02:17:27,985 INFO  L134       CoverageAnalysis]: Checked inductivity of 543 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 418 trivial. 0 not checked.
[2025-03-08 02:17:27,985 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 02:17:27,985 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103852407]
[2025-03-08 02:17:27,985 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103852407] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 02:17:27,985 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 02:17:27,985 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 02:17:27,985 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298946]
[2025-03-08 02:17:27,985 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 02:17:27,986 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 02:17:27,986 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 02:17:27,986 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 02:17:27,987 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 02:17:27,987 INFO  L87              Difference]: Start difference. First operand 38644 states and 40757 transitions. Second operand  has 3 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 0 states have call successors, (0), 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-08 02:17:29,276 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 02:17:29,276 INFO  L93              Difference]: Finished difference Result 77286 states and 81512 transitions.
[2025-03-08 02:17:29,276 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 02:17:29,276 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 0 states have call successors, (0), 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 677
[2025-03-08 02:17:29,277 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 02:17:29,311 INFO  L225             Difference]: With dead ends: 77286
[2025-03-08 02:17:29,311 INFO  L226             Difference]: Without dead ends: 38644
[2025-03-08 02:17:29,332 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-08 02:17:29,332 INFO  L435           NwaCegarLoop]: 739 mSDtfsCounter, 753 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1674 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 753 SdHoareTripleChecker+Valid, 746 SdHoareTripleChecker+Invalid, 1831 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 1674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time
[2025-03-08 02:17:29,332 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [753 Valid, 746 Invalid, 1831 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 1674 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2025-03-08 02:17:29,354 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 38644 states.
[2025-03-08 02:17:29,603 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 38644 to 38644.
[2025-03-08 02:17:29,628 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 38644 states, 38643 states have (on average 1.0487798566363895) internal successors, (40528), 38643 states have internal predecessors, (40528), 0 states have call successors, (0), 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-08 02:17:29,665 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 38644 states to 38644 states and 40528 transitions.
[2025-03-08 02:17:29,666 INFO  L78                 Accepts]: Start accepts. Automaton has 38644 states and 40528 transitions. Word has length 677
[2025-03-08 02:17:29,666 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 02:17:29,666 INFO  L471      AbstractCegarLoop]: Abstraction has 38644 states and 40528 transitions.
[2025-03-08 02:17:29,666 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 0 states have call successors, (0), 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-08 02:17:29,667 INFO  L276                IsEmpty]: Start isEmpty. Operand 38644 states and 40528 transitions.
[2025-03-08 02:17:29,675 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 734
[2025-03-08 02:17:29,675 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 02:17:29,676 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 02:17:29,676 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2025-03-08 02:17:29,676 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 02:17:29,676 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 02:17:29,677 INFO  L85        PathProgramCache]: Analyzing trace with hash -934171310, now seen corresponding path program 1 times
[2025-03-08 02:17:29,677 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 02:17:29,677 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217477383]
[2025-03-08 02:17:29,677 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 02:17:29,677 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 02:17:29,708 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 733 statements into 1 equivalence classes.
[2025-03-08 02:17:29,722 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 733 of 733 statements.
[2025-03-08 02:17:29,722 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 02:17:29,722 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 02:17:30,083 INFO  L134       CoverageAnalysis]: Checked inductivity of 833 backedges. 665 proven. 0 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked.
[2025-03-08 02:17:30,084 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 02:17:30,084 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217477383]
[2025-03-08 02:17:30,084 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217477383] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 02:17:30,084 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 02:17:30,084 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 02:17:30,084 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496552704]
[2025-03-08 02:17:30,084 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 02:17:30,084 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-08 02:17:30,084 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 02:17:30,085 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-08 02:17:30,085 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-08 02:17:30,085 INFO  L87              Difference]: Start difference. First operand 38644 states and 40528 transitions. Second operand  has 4 states, 4 states have (on average 152.25) internal successors, (609), 3 states have internal predecessors, (609), 0 states have call successors, (0), 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-08 02:17:32,212 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 02:17:32,212 INFO  L93              Difference]: Finished difference Result 78666 states and 82438 transitions.
[2025-03-08 02:17:32,213 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-08 02:17:32,213 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 152.25) internal successors, (609), 3 states have internal predecessors, (609), 0 states have call successors, (0), 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 733
[2025-03-08 02:17:32,213 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 02:17:32,246 INFO  L225             Difference]: With dead ends: 78666
[2025-03-08 02:17:32,246 INFO  L226             Difference]: Without dead ends: 40024
[2025-03-08 02:17:32,261 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-08 02:17:32,262 INFO  L435           NwaCegarLoop]: 84 mSDtfsCounter, 1006 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 2699 mSolverCounterSat, 359 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1006 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 3058 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 359 IncrementalHoareTripleChecker+Valid, 2699 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time
[2025-03-08 02:17:32,262 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1006 Valid, 94 Invalid, 3058 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [359 Valid, 2699 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time]
[2025-03-08 02:17:32,283 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 40024 states.
[2025-03-08 02:17:32,482 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 40024 to 39334.
[2025-03-08 02:17:32,506 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 39334 states, 39333 states have (on average 1.041974931990949) internal successors, (40984), 39333 states have internal predecessors, (40984), 0 states have call successors, (0), 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-08 02:17:32,538 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 39334 states to 39334 states and 40984 transitions.
[2025-03-08 02:17:32,538 INFO  L78                 Accepts]: Start accepts. Automaton has 39334 states and 40984 transitions. Word has length 733
[2025-03-08 02:17:32,539 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 02:17:32,539 INFO  L471      AbstractCegarLoop]: Abstraction has 39334 states and 40984 transitions.
[2025-03-08 02:17:32,539 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 152.25) internal successors, (609), 3 states have internal predecessors, (609), 0 states have call successors, (0), 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-08 02:17:32,539 INFO  L276                IsEmpty]: Start isEmpty. Operand 39334 states and 40984 transitions.
[2025-03-08 02:17:32,551 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1277
[2025-03-08 02:17:32,551 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 02:17:32,552 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 02:17:32,552 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2025-03-08 02:17:32,552 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 02:17:32,552 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 02:17:32,553 INFO  L85        PathProgramCache]: Analyzing trace with hash -2127228909, now seen corresponding path program 1 times
[2025-03-08 02:17:32,553 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 02:17:32,553 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630815045]
[2025-03-08 02:17:32,553 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 02:17:32,553 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 02:17:32,609 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1276 statements into 1 equivalence classes.
[2025-03-08 02:17:32,644 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1276 of 1276 statements.
[2025-03-08 02:17:32,644 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 02:17:32,644 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 02:17:34,163 INFO  L134       CoverageAnalysis]: Checked inductivity of 1594 backedges. 570 proven. 938 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked.
[2025-03-08 02:17:34,164 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 02:17:34,164 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630815045]
[2025-03-08 02:17:34,164 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630815045] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-08 02:17:34,164 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1054282790]
[2025-03-08 02:17:34,164 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 02:17:34,164 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-08 02:17:34,164 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 02:17:34,166 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-08 02:17:34,167 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-08 02:17:34,288 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1276 statements into 1 equivalence classes.
[2025-03-08 02:17:34,464 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1276 of 1276 statements.
[2025-03-08 02:17:34,464 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 02:17:34,464 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 02:17:34,469 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1463 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-03-08 02:17:34,489 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 02:17:34,636 INFO  L134       CoverageAnalysis]: Checked inductivity of 1594 backedges. 544 proven. 0 refuted. 0 times theorem prover too weak. 1050 trivial. 0 not checked.
[2025-03-08 02:17:34,636 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-08 02:17:34,636 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1054282790] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 02:17:34,636 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-08 02:17:34,636 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9
[2025-03-08 02:17:34,637 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308922221]
[2025-03-08 02:17:34,637 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 02:17:34,638 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 02:17:34,638 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 02:17:34,639 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 02:17:34,639 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2025-03-08 02:17:34,639 INFO  L87              Difference]: Start difference. First operand 39334 states and 40984 transitions. Second operand  has 3 states, 3 states have (on average 215.66666666666666) internal successors, (647), 3 states have internal predecessors, (647), 0 states have call successors, (0), 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-08 02:17:36,061 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 02:17:36,061 INFO  L93              Difference]: Finished difference Result 79356 states and 82666 transitions.
[2025-03-08 02:17:36,062 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 02:17:36,062 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 215.66666666666666) internal successors, (647), 3 states have internal predecessors, (647), 0 states have call successors, (0), 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 1276
[2025-03-08 02:17:36,063 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 02:17:36,101 INFO  L225             Difference]: With dead ends: 79356
[2025-03-08 02:17:36,101 INFO  L226             Difference]: Without dead ends: 39334
[2025-03-08 02:17:36,126 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 1283 GetRequests, 1276 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-08 02:17:36,126 INFO  L435           NwaCegarLoop]: 799 mSDtfsCounter, 642 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1652 mSolverCounterSat, 209 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 642 SdHoareTripleChecker+Valid, 805 SdHoareTripleChecker+Invalid, 1861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 209 IncrementalHoareTripleChecker+Valid, 1652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time
[2025-03-08 02:17:36,126 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [642 Valid, 805 Invalid, 1861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [209 Valid, 1652 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time]
[2025-03-08 02:17:36,157 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 39334 states.
[2025-03-08 02:17:36,365 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 39334 to 38644.
[2025-03-08 02:17:36,391 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 38644 states, 38643 states have (on average 1.0391015190332014) internal successors, (40154), 38643 states have internal predecessors, (40154), 0 states have call successors, (0), 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-08 02:17:36,431 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 38644 states to 38644 states and 40154 transitions.
[2025-03-08 02:17:36,432 INFO  L78                 Accepts]: Start accepts. Automaton has 38644 states and 40154 transitions. Word has length 1276
[2025-03-08 02:17:36,433 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 02:17:36,433 INFO  L471      AbstractCegarLoop]: Abstraction has 38644 states and 40154 transitions.
[2025-03-08 02:17:36,433 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 215.66666666666666) internal successors, (647), 3 states have internal predecessors, (647), 0 states have call successors, (0), 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-08 02:17:36,433 INFO  L276                IsEmpty]: Start isEmpty. Operand 38644 states and 40154 transitions.
[2025-03-08 02:17:36,448 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1328
[2025-03-08 02:17:36,448 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 02:17:36,449 INFO  L218           NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 02:17:36,458 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-08 02:17:36,649 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,SelfDestructingSolverStorable13
[2025-03-08 02:17:36,649 INFO  L396      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 02:17:36,650 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 02:17:36,650 INFO  L85        PathProgramCache]: Analyzing trace with hash 1804390257, now seen corresponding path program 1 times
[2025-03-08 02:17:36,650 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 02:17:36,650 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626494933]
[2025-03-08 02:17:36,650 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 02:17:36,650 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 02:17:36,712 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1327 statements into 1 equivalence classes.
[2025-03-08 02:17:36,808 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1327 of 1327 statements.
[2025-03-08 02:17:36,808 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 02:17:36,808 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 02:17:37,277 INFO  L134       CoverageAnalysis]: Checked inductivity of 2025 backedges. 1151 proven. 0 refuted. 0 times theorem prover too weak. 874 trivial. 0 not checked.
[2025-03-08 02:17:37,278 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 02:17:37,278 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626494933]
[2025-03-08 02:17:37,278 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626494933] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 02:17:37,278 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 02:17:37,278 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 02:17:37,278 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298903411]
[2025-03-08 02:17:37,278 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 02:17:37,279 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 02:17:37,279 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 02:17:37,280 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 02:17:37,280 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 02:17:37,280 INFO  L87              Difference]: Start difference. First operand 38644 states and 40154 transitions. Second operand  has 3 states, 3 states have (on average 248.33333333333334) internal successors, (745), 3 states have internal predecessors, (745), 0 states have call successors, (0), 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-08 02:17:38,849 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 02:17:38,849 INFO  L93              Difference]: Finished difference Result 89706 states and 93614 transitions.
[2025-03-08 02:17:38,850 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 02:17:38,850 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 248.33333333333334) internal successors, (745), 3 states have internal predecessors, (745), 0 states have call successors, (0), 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 1327
[2025-03-08 02:17:38,851 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 02:17:38,905 INFO  L225             Difference]: With dead ends: 89706
[2025-03-08 02:17:38,905 INFO  L226             Difference]: Without dead ends: 51754
[2025-03-08 02:17:38,930 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-08 02:17:38,930 INFO  L435           NwaCegarLoop]: 871 mSDtfsCounter, 533 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1743 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 533 SdHoareTripleChecker+Valid, 878 SdHoareTripleChecker+Invalid, 1905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 1743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time
[2025-03-08 02:17:38,931 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [533 Valid, 878 Invalid, 1905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 1743 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time]
[2025-03-08 02:17:38,964 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 51754 states.
[2025-03-08 02:17:39,274 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 51754 to 51064.
[2025-03-08 02:17:39,300 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 51064 states, 51063 states have (on average 1.0370718524176017) internal successors, (52956), 51063 states have internal predecessors, (52956), 0 states have call successors, (0), 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-08 02:17:39,348 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 51064 states to 51064 states and 52956 transitions.
[2025-03-08 02:17:39,349 INFO  L78                 Accepts]: Start accepts. Automaton has 51064 states and 52956 transitions. Word has length 1327
[2025-03-08 02:17:39,349 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 02:17:39,349 INFO  L471      AbstractCegarLoop]: Abstraction has 51064 states and 52956 transitions.
[2025-03-08 02:17:39,349 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 248.33333333333334) internal successors, (745), 3 states have internal predecessors, (745), 0 states have call successors, (0), 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-08 02:17:39,349 INFO  L276                IsEmpty]: Start isEmpty. Operand 51064 states and 52956 transitions.
[2025-03-08 02:17:39,365 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1369
[2025-03-08 02:17:39,366 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 02:17:39,366 INFO  L218           NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 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, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 02:17:39,366 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2025-03-08 02:17:39,366 INFO  L396      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 02:17:39,367 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 02:17:39,367 INFO  L85        PathProgramCache]: Analyzing trace with hash 277925400, now seen corresponding path program 1 times
[2025-03-08 02:17:39,367 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 02:17:39,367 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747228618]
[2025-03-08 02:17:39,367 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 02:17:39,367 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 02:17:39,499 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1368 statements into 1 equivalence classes.
[2025-03-08 02:17:39,541 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1368 of 1368 statements.
[2025-03-08 02:17:39,541 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 02:17:39,541 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 02:17:40,387 INFO  L134       CoverageAnalysis]: Checked inductivity of 2783 backedges. 1606 proven. 0 refuted. 0 times theorem prover too weak. 1177 trivial. 0 not checked.
[2025-03-08 02:17:40,388 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 02:17:40,388 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747228618]
[2025-03-08 02:17:40,388 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747228618] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 02:17:40,388 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 02:17:40,388 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-08 02:17:40,388 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36539101]
[2025-03-08 02:17:40,388 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 02:17:40,389 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-08 02:17:40,389 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 02:17:40,389 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-08 02:17:40,390 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-03-08 02:17:40,390 INFO  L87              Difference]: Start difference. First operand 51064 states and 52956 transitions. Second operand  has 5 states, 5 states have (on average 140.8) internal successors, (704), 5 states have internal predecessors, (704), 0 states have call successors, (0), 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-08 02:17:42,039 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 02:17:42,039 INFO  L93              Difference]: Finished difference Result 101537 states and 105320 transitions.
[2025-03-08 02:17:42,044 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-08 02:17:42,044 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 140.8) internal successors, (704), 5 states have internal predecessors, (704), 0 states have call successors, (0), 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 1368
[2025-03-08 02:17:42,044 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 02:17:42,090 INFO  L225             Difference]: With dead ends: 101537
[2025-03-08 02:17:42,090 INFO  L226             Difference]: Without dead ends: 51165
[2025-03-08 02:17:42,117 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-03-08 02:17:42,118 INFO  L435           NwaCegarLoop]: 934 mSDtfsCounter, 2010 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 2431 mSolverCounterSat, 319 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2010 SdHoareTripleChecker+Valid, 943 SdHoareTripleChecker+Invalid, 2750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 319 IncrementalHoareTripleChecker+Valid, 2431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time
[2025-03-08 02:17:42,118 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2010 Valid, 943 Invalid, 2750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [319 Valid, 2431 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time]
[2025-03-08 02:17:42,146 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 51165 states.
[2025-03-08 02:17:42,435 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 51165 to 51064.
[2025-03-08 02:17:42,468 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 51064 states, 51063 states have (on average 1.035093903609267) internal successors, (52855), 51063 states have internal predecessors, (52855), 0 states have call successors, (0), 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-08 02:17:42,513 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 51064 states to 51064 states and 52855 transitions.
[2025-03-08 02:17:42,514 INFO  L78                 Accepts]: Start accepts. Automaton has 51064 states and 52855 transitions. Word has length 1368
[2025-03-08 02:17:42,515 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 02:17:42,515 INFO  L471      AbstractCegarLoop]: Abstraction has 51064 states and 52855 transitions.
[2025-03-08 02:17:42,515 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 140.8) internal successors, (704), 5 states have internal predecessors, (704), 0 states have call successors, (0), 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-08 02:17:42,515 INFO  L276                IsEmpty]: Start isEmpty. Operand 51064 states and 52855 transitions.
[2025-03-08 02:17:42,530 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1380
[2025-03-08 02:17:42,531 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 02:17:42,531 INFO  L218           NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 02:17:42,531 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2025-03-08 02:17:42,531 INFO  L396      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 02:17:42,532 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 02:17:42,532 INFO  L85        PathProgramCache]: Analyzing trace with hash -949599960, now seen corresponding path program 1 times
[2025-03-08 02:17:42,532 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 02:17:42,532 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665532112]
[2025-03-08 02:17:42,532 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 02:17:42,532 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 02:17:42,587 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1379 statements into 1 equivalence classes.
[2025-03-08 02:17:42,622 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1379 of 1379 statements.
[2025-03-08 02:17:42,622 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 02:17:42,623 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 02:17:43,431 INFO  L134       CoverageAnalysis]: Checked inductivity of 2416 backedges. 780 proven. 0 refuted. 0 times theorem prover too weak. 1636 trivial. 0 not checked.
[2025-03-08 02:17:43,431 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 02:17:43,431 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665532112]
[2025-03-08 02:17:43,431 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665532112] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 02:17:43,431 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 02:17:43,431 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 02:17:43,431 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245737015]
[2025-03-08 02:17:43,431 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 02:17:43,432 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 02:17:43,432 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 02:17:43,433 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 02:17:43,433 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 02:17:43,433 INFO  L87              Difference]: Start difference. First operand 51064 states and 52855 transitions. Second operand  has 3 states, 3 states have (on average 216.33333333333334) internal successors, (649), 3 states have internal predecessors, (649), 0 states have call successors, (0), 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-08 02:17:45,053 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 02:17:45,053 INFO  L93              Difference]: Finished difference Result 111096 states and 115372 transitions.
[2025-03-08 02:17:45,053 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 02:17:45,053 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 216.33333333333334) internal successors, (649), 3 states have internal predecessors, (649), 0 states have call successors, (0), 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 1379
[2025-03-08 02:17:45,054 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 02:17:45,116 INFO  L225             Difference]: With dead ends: 111096
[2025-03-08 02:17:45,116 INFO  L226             Difference]: Without dead ends: 60724
[2025-03-08 02:17:45,146 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-08 02:17:45,147 INFO  L435           NwaCegarLoop]: 266 mSDtfsCounter, 613 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1743 mSolverCounterSat, 222 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 613 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 1965 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 222 IncrementalHoareTripleChecker+Valid, 1743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time
[2025-03-08 02:17:45,147 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [613 Valid, 271 Invalid, 1965 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [222 Valid, 1743 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time]
[2025-03-08 02:17:45,188 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 60724 states.
[2025-03-08 02:17:45,519 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 60724 to 51754.
[2025-03-08 02:17:45,552 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 51754 states, 51753 states have (on average 1.0348192375321237) internal successors, (53555), 51753 states have internal predecessors, (53555), 0 states have call successors, (0), 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-08 02:17:45,599 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 51754 states to 51754 states and 53555 transitions.
[2025-03-08 02:17:45,600 INFO  L78                 Accepts]: Start accepts. Automaton has 51754 states and 53555 transitions. Word has length 1379
[2025-03-08 02:17:45,601 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 02:17:45,601 INFO  L471      AbstractCegarLoop]: Abstraction has 51754 states and 53555 transitions.
[2025-03-08 02:17:45,601 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 216.33333333333334) internal successors, (649), 3 states have internal predecessors, (649), 0 states have call successors, (0), 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-08 02:17:45,601 INFO  L276                IsEmpty]: Start isEmpty. Operand 51754 states and 53555 transitions.
[2025-03-08 02:17:45,617 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1411
[2025-03-08 02:17:45,617 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 02:17:45,618 INFO  L218           NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 02:17:45,618 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2025-03-08 02:17:45,618 INFO  L396      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 02:17:45,619 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 02:17:45,619 INFO  L85        PathProgramCache]: Analyzing trace with hash -220270723, now seen corresponding path program 1 times
[2025-03-08 02:17:45,619 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 02:17:45,619 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097954597]
[2025-03-08 02:17:45,619 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 02:17:45,619 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 02:17:45,675 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1410 statements into 1 equivalence classes.
[2025-03-08 02:17:45,713 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1410 of 1410 statements.
[2025-03-08 02:17:45,713 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 02:17:45,713 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 02:17:46,222 INFO  L134       CoverageAnalysis]: Checked inductivity of 2207 backedges. 251 proven. 0 refuted. 0 times theorem prover too weak. 1956 trivial. 0 not checked.
[2025-03-08 02:17:46,222 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 02:17:46,222 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097954597]
[2025-03-08 02:17:46,222 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097954597] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 02:17:46,222 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 02:17:46,222 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 02:17:46,222 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088606605]
[2025-03-08 02:17:46,222 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 02:17:46,223 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 02:17:46,223 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 02:17:46,223 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 02:17:46,223 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 02:17:46,223 INFO  L87              Difference]: Start difference. First operand 51754 states and 53555 transitions. Second operand  has 3 states, 3 states have (on average 188.33333333333334) internal successors, (565), 3 states have internal predecessors, (565), 0 states have call successors, (0), 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-08 02:17:47,746 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 02:17:47,747 INFO  L93              Difference]: Finished difference Result 113166 states and 117429 transitions.
[2025-03-08 02:17:47,747 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 02:17:47,747 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 188.33333333333334) internal successors, (565), 3 states have internal predecessors, (565), 0 states have call successors, (0), 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 1410
[2025-03-08 02:17:47,748 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 02:17:47,819 INFO  L225             Difference]: With dead ends: 113166
[2025-03-08 02:17:47,819 INFO  L226             Difference]: Without dead ends: 61414
[2025-03-08 02:17:47,854 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-08 02:17:47,855 INFO  L435           NwaCegarLoop]: 948 mSDtfsCounter, 651 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1787 mSolverCounterSat, 221 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 651 SdHoareTripleChecker+Valid, 955 SdHoareTripleChecker+Invalid, 2008 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 221 IncrementalHoareTripleChecker+Valid, 1787 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time
[2025-03-08 02:17:47,855 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [651 Valid, 955 Invalid, 2008 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [221 Valid, 1787 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time]
[2025-03-08 02:17:47,898 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 61414 states.
[2025-03-08 02:17:48,269 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 61414 to 60034.
[2025-03-08 02:17:48,303 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 60034 states, 60033 states have (on average 1.0336814751886463) internal successors, (62055), 60033 states have internal predecessors, (62055), 0 states have call successors, (0), 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-08 02:17:48,356 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 60034 states to 60034 states and 62055 transitions.
[2025-03-08 02:17:48,357 INFO  L78                 Accepts]: Start accepts. Automaton has 60034 states and 62055 transitions. Word has length 1410
[2025-03-08 02:17:48,357 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 02:17:48,357 INFO  L471      AbstractCegarLoop]: Abstraction has 60034 states and 62055 transitions.
[2025-03-08 02:17:48,357 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 188.33333333333334) internal successors, (565), 3 states have internal predecessors, (565), 0 states have call successors, (0), 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-08 02:17:48,358 INFO  L276                IsEmpty]: Start isEmpty. Operand 60034 states and 62055 transitions.
[2025-03-08 02:17:48,378 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1510
[2025-03-08 02:17:48,378 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 02:17:48,379 INFO  L218           NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 02:17:48,379 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2025-03-08 02:17:48,379 INFO  L396      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 02:17:48,380 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 02:17:48,380 INFO  L85        PathProgramCache]: Analyzing trace with hash -134445141, now seen corresponding path program 1 times
[2025-03-08 02:17:48,380 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 02:17:48,380 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888455784]
[2025-03-08 02:17:48,380 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 02:17:48,380 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 02:17:48,444 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1509 statements into 1 equivalence classes.
[2025-03-08 02:17:48,486 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1509 of 1509 statements.
[2025-03-08 02:17:48,486 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 02:17:48,486 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 02:17:49,175 INFO  L134       CoverageAnalysis]: Checked inductivity of 2142 backedges. 253 proven. 0 refuted. 0 times theorem prover too weak. 1889 trivial. 0 not checked.
[2025-03-08 02:17:49,175 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 02:17:49,175 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888455784]
[2025-03-08 02:17:49,175 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888455784] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 02:17:49,175 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 02:17:49,175 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 02:17:49,175 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743347717]
[2025-03-08 02:17:49,176 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 02:17:49,176 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 02:17:49,176 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 02:17:49,177 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 02:17:49,177 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 02:17:49,177 INFO  L87              Difference]: Start difference. First operand 60034 states and 62055 transitions. Second operand  has 3 states, 3 states have (on average 188.66666666666666) internal successors, (566), 3 states have internal predecessors, (566), 0 states have call successors, (0), 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-08 02:17:50,892 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 02:17:50,893 INFO  L93              Difference]: Finished difference Result 141456 states and 146560 transitions.
[2025-03-08 02:17:50,893 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 02:17:50,893 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 188.66666666666666) internal successors, (566), 3 states have internal predecessors, (566), 0 states have call successors, (0), 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 1509
[2025-03-08 02:17:50,894 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 02:17:50,997 INFO  L225             Difference]: With dead ends: 141456
[2025-03-08 02:17:50,997 INFO  L226             Difference]: Without dead ends: 81424
[2025-03-08 02:17:51,040 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-08 02:17:51,040 INFO  L435           NwaCegarLoop]: 943 mSDtfsCounter, 670 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1800 mSolverCounterSat, 176 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 670 SdHoareTripleChecker+Valid, 950 SdHoareTripleChecker+Invalid, 1976 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 1800 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time
[2025-03-08 02:17:51,040 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [670 Valid, 950 Invalid, 1976 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 1800 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time]
[2025-03-08 02:17:51,097 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 81424 states.
[2025-03-08 02:17:51,613 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 81424 to 81424.
[2025-03-08 02:17:51,666 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 81424 states, 81423 states have (on average 1.0316249708313376) internal successors, (83998), 81423 states have internal predecessors, (83998), 0 states have call successors, (0), 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-08 02:17:51,738 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 81424 states to 81424 states and 83998 transitions.
[2025-03-08 02:17:51,739 INFO  L78                 Accepts]: Start accepts. Automaton has 81424 states and 83998 transitions. Word has length 1509
[2025-03-08 02:17:51,740 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 02:17:51,740 INFO  L471      AbstractCegarLoop]: Abstraction has 81424 states and 83998 transitions.
[2025-03-08 02:17:51,740 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 188.66666666666666) internal successors, (566), 3 states have internal predecessors, (566), 0 states have call successors, (0), 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-08 02:17:51,740 INFO  L276                IsEmpty]: Start isEmpty. Operand 81424 states and 83998 transitions.
[2025-03-08 02:17:51,926 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1786
[2025-03-08 02:17:51,926 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 02:17:51,926 INFO  L218           NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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]
[2025-03-08 02:17:51,926 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2025-03-08 02:17:51,926 INFO  L396      AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 02:17:51,927 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 02:17:51,927 INFO  L85        PathProgramCache]: Analyzing trace with hash 244644070, now seen corresponding path program 1 times
[2025-03-08 02:17:51,927 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 02:17:51,927 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595190451]
[2025-03-08 02:17:51,927 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 02:17:51,928 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 02:17:52,002 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1785 statements into 1 equivalence classes.
[2025-03-08 02:17:52,048 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1785 of 1785 statements.
[2025-03-08 02:17:52,048 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 02:17:52,048 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 02:17:54,067 INFO  L134       CoverageAnalysis]: Checked inductivity of 3040 backedges. 990 proven. 1794 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked.
[2025-03-08 02:17:54,067 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 02:17:54,067 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595190451]
[2025-03-08 02:17:54,067 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595190451] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-08 02:17:54,067 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [241914590]
[2025-03-08 02:17:54,067 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 02:17:54,067 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-08 02:17:54,067 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 02:17:54,069 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-08 02:17:54,070 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-08 02:17:54,190 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1785 statements into 1 equivalence classes.
[2025-03-08 02:17:54,371 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1785 of 1785 statements.
[2025-03-08 02:17:54,371 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 02:17:54,371 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 02:17:54,378 INFO  L256         TraceCheckSpWp]: Trace formula consists of 2012 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-03-08 02:17:54,390 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 02:17:54,895 INFO  L134       CoverageAnalysis]: Checked inductivity of 3040 backedges. 1478 proven. 0 refuted. 0 times theorem prover too weak. 1562 trivial. 0 not checked.
[2025-03-08 02:17:54,895 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-08 02:17:54,895 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [241914590] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 02:17:54,896 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-08 02:17:54,896 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9
[2025-03-08 02:17:54,897 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774031603]
[2025-03-08 02:17:54,897 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 02:17:54,897 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 02:17:54,897 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 02:17:54,898 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 02:17:54,898 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2025-03-08 02:17:54,898 INFO  L87              Difference]: Start difference. First operand 81424 states and 83998 transitions. Second operand  has 3 states, 3 states have (on average 316.3333333333333) internal successors, (949), 3 states have internal predecessors, (949), 0 states have call successors, (0), 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-08 02:17:56,499 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 02:17:56,499 INFO  L93              Difference]: Finished difference Result 162156 states and 167303 transitions.
[2025-03-08 02:17:56,499 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 02:17:56,499 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 316.3333333333333) internal successors, (949), 3 states have internal predecessors, (949), 0 states have call successors, (0), 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 1785
[2025-03-08 02:17:56,500 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 02:17:56,582 INFO  L225             Difference]: With dead ends: 162156
[2025-03-08 02:17:56,582 INFO  L226             Difference]: Without dead ends: 81424
[2025-03-08 02:17:56,633 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 1792 GetRequests, 1785 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2025-03-08 02:17:56,634 INFO  L435           NwaCegarLoop]: 879 mSDtfsCounter, 373 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1597 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 886 SdHoareTripleChecker+Invalid, 1795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 1597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time
[2025-03-08 02:17:56,634 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [373 Valid, 886 Invalid, 1795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 1597 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time]
[2025-03-08 02:17:56,698 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 81424 states.
[2025-03-08 02:17:57,244 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 81424 to 80044.
[2025-03-08 02:17:57,298 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 80044 states, 80043 states have (on average 1.0225253926014768) internal successors, (81846), 80043 states have internal predecessors, (81846), 0 states have call successors, (0), 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-08 02:17:57,367 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 80044 states to 80044 states and 81846 transitions.
[2025-03-08 02:17:57,368 INFO  L78                 Accepts]: Start accepts. Automaton has 80044 states and 81846 transitions. Word has length 1785
[2025-03-08 02:17:57,369 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 02:17:57,369 INFO  L471      AbstractCegarLoop]: Abstraction has 80044 states and 81846 transitions.
[2025-03-08 02:17:57,369 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 316.3333333333333) internal successors, (949), 3 states have internal predecessors, (949), 0 states have call successors, (0), 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-08 02:17:57,369 INFO  L276                IsEmpty]: Start isEmpty. Operand 80044 states and 81846 transitions.
[2025-03-08 02:17:57,421 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1832
[2025-03-08 02:17:57,421 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 02:17:57,422 INFO  L218           NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 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, 1]
[2025-03-08 02:17:57,431 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-08 02:17:57,622 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-08 02:17:57,623 INFO  L396      AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 02:17:57,624 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 02:17:57,624 INFO  L85        PathProgramCache]: Analyzing trace with hash 742639512, now seen corresponding path program 1 times
[2025-03-08 02:17:57,624 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 02:17:57,624 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228464183]
[2025-03-08 02:17:57,624 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 02:17:57,624 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 02:17:57,702 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1831 statements into 1 equivalence classes.
[2025-03-08 02:17:57,886 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1831 of 1831 statements.
[2025-03-08 02:17:57,886 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 02:17:57,886 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 02:17:58,623 INFO  L134       CoverageAnalysis]: Checked inductivity of 3397 backedges. 2341 proven. 0 refuted. 0 times theorem prover too weak. 1056 trivial. 0 not checked.
[2025-03-08 02:17:58,623 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 02:17:58,623 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228464183]
[2025-03-08 02:17:58,624 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228464183] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 02:17:58,624 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 02:17:58,624 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 02:17:58,624 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727091596]
[2025-03-08 02:17:58,624 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 02:17:58,625 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 02:17:58,625 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 02:17:58,625 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 02:17:58,626 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 02:17:58,626 INFO  L87              Difference]: Start difference. First operand 80044 states and 81846 transitions. Second operand  has 3 states, 3 states have (on average 393.0) internal successors, (1179), 3 states have internal predecessors, (1179), 0 states have call successors, (0), 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-08 02:18:00,336 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 02:18:00,337 INFO  L93              Difference]: Finished difference Result 159396 states and 162999 transitions.
[2025-03-08 02:18:00,338 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 02:18:00,338 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 393.0) internal successors, (1179), 3 states have internal predecessors, (1179), 0 states have call successors, (0), 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 1831
[2025-03-08 02:18:00,339 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 02:18:00,427 INFO  L225             Difference]: With dead ends: 159396
[2025-03-08 02:18:00,427 INFO  L226             Difference]: Without dead ends: 80044
[2025-03-08 02:18:00,456 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-08 02:18:00,456 INFO  L435           NwaCegarLoop]: 912 mSDtfsCounter, 425 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1731 mSolverCounterSat, 209 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 425 SdHoareTripleChecker+Valid, 919 SdHoareTripleChecker+Invalid, 1940 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 209 IncrementalHoareTripleChecker+Valid, 1731 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time
[2025-03-08 02:18:00,457 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [425 Valid, 919 Invalid, 1940 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [209 Valid, 1731 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time]
[2025-03-08 02:18:00,510 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 80044 states.
[2025-03-08 02:18:01,043 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 80044 to 80044.
[2025-03-08 02:18:01,098 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 80044 states, 80043 states have (on average 1.0177654510700498) internal successors, (81465), 80043 states have internal predecessors, (81465), 0 states have call successors, (0), 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-08 02:18:01,180 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 80044 states to 80044 states and 81465 transitions.
[2025-03-08 02:18:01,181 INFO  L78                 Accepts]: Start accepts. Automaton has 80044 states and 81465 transitions. Word has length 1831
[2025-03-08 02:18:01,182 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 02:18:01,182 INFO  L471      AbstractCegarLoop]: Abstraction has 80044 states and 81465 transitions.
[2025-03-08 02:18:01,182 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 393.0) internal successors, (1179), 3 states have internal predecessors, (1179), 0 states have call successors, (0), 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-08 02:18:01,182 INFO  L276                IsEmpty]: Start isEmpty. Operand 80044 states and 81465 transitions.
[2025-03-08 02:18:01,344 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1871
[2025-03-08 02:18:01,344 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 02:18:01,345 INFO  L218           NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-03-08 02:18:01,345 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2025-03-08 02:18:01,345 INFO  L396      AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 02:18:01,346 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 02:18:01,346 INFO  L85        PathProgramCache]: Analyzing trace with hash 1124801101, now seen corresponding path program 1 times
[2025-03-08 02:18:01,346 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 02:18:01,346 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507553917]
[2025-03-08 02:18:01,346 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 02:18:01,347 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 02:18:01,420 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1870 statements into 1 equivalence classes.
[2025-03-08 02:18:01,471 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1870 of 1870 statements.
[2025-03-08 02:18:01,471 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 02:18:01,471 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 02:18:04,528 INFO  L134       CoverageAnalysis]: Checked inductivity of 3237 backedges. 2225 proven. 501 refuted. 0 times theorem prover too weak. 511 trivial. 0 not checked.
[2025-03-08 02:18:04,528 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 02:18:04,528 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507553917]
[2025-03-08 02:18:04,529 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507553917] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-08 02:18:04,529 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [498048223]
[2025-03-08 02:18:04,529 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 02:18:04,529 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-08 02:18:04,529 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 02:18:04,532 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-08 02:18:04,549 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-08 02:18:04,721 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1870 statements into 1 equivalence classes.
[2025-03-08 02:18:04,965 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1870 of 1870 statements.
[2025-03-08 02:18:04,965 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 02:18:04,965 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 02:18:04,971 INFO  L256         TraceCheckSpWp]: Trace formula consists of 2091 conjuncts, 3 conjuncts are in the unsatisfiable core
[2025-03-08 02:18:04,989 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 02:18:05,314 INFO  L134       CoverageAnalysis]: Checked inductivity of 3237 backedges. 2300 proven. 0 refuted. 0 times theorem prover too weak. 937 trivial. 0 not checked.
[2025-03-08 02:18:05,314 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-08 02:18:05,314 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [498048223] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 02:18:05,314 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-08 02:18:05,315 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8
[2025-03-08 02:18:05,315 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160674058]
[2025-03-08 02:18:05,315 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 02:18:05,316 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 02:18:05,316 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 02:18:05,316 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 02:18:05,317 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56
[2025-03-08 02:18:05,317 INFO  L87              Difference]: Start difference. First operand 80044 states and 81465 transitions. Second operand  has 3 states, 3 states have (on average 354.6666666666667) internal successors, (1064), 3 states have internal predecessors, (1064), 0 states have call successors, (0), 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-08 02:18:06,878 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 02:18:06,878 INFO  L93              Difference]: Finished difference Result 159396 states and 162237 transitions.
[2025-03-08 02:18:06,880 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 02:18:06,880 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 354.6666666666667) internal successors, (1064), 3 states have internal predecessors, (1064), 0 states have call successors, (0), 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 1870
[2025-03-08 02:18:06,880 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 02:18:06,957 INFO  L225             Difference]: With dead ends: 159396
[2025-03-08 02:18:06,957 INFO  L226             Difference]: Without dead ends: 80044
[2025-03-08 02:18:06,986 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 1877 GetRequests, 1871 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56
[2025-03-08 02:18:06,988 INFO  L435           NwaCegarLoop]: 966 mSDtfsCounter, 573 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1663 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 573 SdHoareTripleChecker+Valid, 973 SdHoareTripleChecker+Invalid, 1673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time
[2025-03-08 02:18:06,990 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [573 Valid, 973 Invalid, 1673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1663 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time]
[2025-03-08 02:18:07,038 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 80044 states.
[2025-03-08 02:18:07,585 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 80044 to 77974.
[2025-03-08 02:18:07,647 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 77974 states, 77973 states have (on average 1.017954933117874) internal successors, (79373), 77973 states have internal predecessors, (79373), 0 states have call successors, (0), 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-08 02:18:07,729 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 77974 states to 77974 states and 79373 transitions.
[2025-03-08 02:18:07,731 INFO  L78                 Accepts]: Start accepts. Automaton has 77974 states and 79373 transitions. Word has length 1870
[2025-03-08 02:18:07,731 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 02:18:07,731 INFO  L471      AbstractCegarLoop]: Abstraction has 77974 states and 79373 transitions.
[2025-03-08 02:18:07,731 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 354.6666666666667) internal successors, (1064), 3 states have internal predecessors, (1064), 0 states have call successors, (0), 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-08 02:18:07,732 INFO  L276                IsEmpty]: Start isEmpty. Operand 77974 states and 79373 transitions.
[2025-03-08 02:18:07,797 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1880
[2025-03-08 02:18:07,797 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 02:18:07,798 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 02:18:07,807 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-08 02:18:07,998 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-08 02:18:07,999 INFO  L396      AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 02:18:08,000 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 02:18:08,000 INFO  L85        PathProgramCache]: Analyzing trace with hash -1002273654, now seen corresponding path program 1 times
[2025-03-08 02:18:08,000 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 02:18:08,000 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314490853]
[2025-03-08 02:18:08,000 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 02:18:08,001 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 02:18:08,089 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1879 statements into 1 equivalence classes.
[2025-03-08 02:18:08,157 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1879 of 1879 statements.
[2025-03-08 02:18:08,158 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 02:18:08,158 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 02:18:09,104 INFO  L134       CoverageAnalysis]: Checked inductivity of 3306 backedges. 2651 proven. 0 refuted. 0 times theorem prover too weak. 655 trivial. 0 not checked.
[2025-03-08 02:18:09,105 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 02:18:09,105 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314490853]
[2025-03-08 02:18:09,105 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314490853] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 02:18:09,105 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 02:18:09,105 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 02:18:09,105 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529514446]
[2025-03-08 02:18:09,105 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 02:18:09,106 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 02:18:09,106 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 02:18:09,107 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 02:18:09,107 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 02:18:09,107 INFO  L87              Difference]: Start difference. First operand 77974 states and 79373 transitions. Second operand  has 3 states, 3 states have (on average 423.0) internal successors, (1269), 3 states have internal predecessors, (1269), 0 states have call successors, (0), 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-08 02:18:10,843 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 02:18:10,844 INFO  L93              Difference]: Finished difference Result 176646 states and 179972 transitions.
[2025-03-08 02:18:10,844 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 02:18:10,844 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 423.0) internal successors, (1269), 3 states have internal predecessors, (1269), 0 states have call successors, (0), 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 1879
[2025-03-08 02:18:10,845 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 02:18:10,945 INFO  L225             Difference]: With dead ends: 176646
[2025-03-08 02:18:10,946 INFO  L226             Difference]: Without dead ends: 99364
[2025-03-08 02:18:10,995 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-08 02:18:10,996 INFO  L435           NwaCegarLoop]: 220 mSDtfsCounter, 338 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1742 mSolverCounterSat, 244 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 1986 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 244 IncrementalHoareTripleChecker+Valid, 1742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time
[2025-03-08 02:18:10,996 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 225 Invalid, 1986 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [244 Valid, 1742 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time]
[2025-03-08 02:18:11,071 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 99364 states.
[2025-03-08 02:18:11,875 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 99364 to 98674.
[2025-03-08 02:18:11,942 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 98674 states, 98673 states have (on average 1.0170462031153407) internal successors, (100355), 98673 states have internal predecessors, (100355), 0 states have call successors, (0), 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-08 02:18:12,032 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 98674 states to 98674 states and 100355 transitions.
[2025-03-08 02:18:12,033 INFO  L78                 Accepts]: Start accepts. Automaton has 98674 states and 100355 transitions. Word has length 1879
[2025-03-08 02:18:12,034 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 02:18:12,034 INFO  L471      AbstractCegarLoop]: Abstraction has 98674 states and 100355 transitions.
[2025-03-08 02:18:12,034 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 423.0) internal successors, (1269), 3 states have internal predecessors, (1269), 0 states have call successors, (0), 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-08 02:18:12,034 INFO  L276                IsEmpty]: Start isEmpty. Operand 98674 states and 100355 transitions.
[2025-03-08 02:18:12,076 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1924
[2025-03-08 02:18:12,077 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 02:18:12,077 INFO  L218           NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-03-08 02:18:12,077 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2025-03-08 02:18:12,077 INFO  L396      AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 02:18:12,078 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 02:18:12,078 INFO  L85        PathProgramCache]: Analyzing trace with hash 153822517, now seen corresponding path program 1 times
[2025-03-08 02:18:12,078 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 02:18:12,078 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759975411]
[2025-03-08 02:18:12,078 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 02:18:12,078 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 02:18:12,159 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1923 statements into 1 equivalence classes.
[2025-03-08 02:18:12,340 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1923 of 1923 statements.
[2025-03-08 02:18:12,340 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 02:18:12,340 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 02:18:15,400 INFO  L134       CoverageAnalysis]: Checked inductivity of 3481 backedges. 2432 proven. 581 refuted. 0 times theorem prover too weak. 468 trivial. 0 not checked.
[2025-03-08 02:18:15,400 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 02:18:15,400 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759975411]
[2025-03-08 02:18:15,401 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759975411] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-08 02:18:15,401 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [552108861]
[2025-03-08 02:18:15,401 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 02:18:15,401 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-08 02:18:15,401 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 02:18:15,403 INFO  L229       MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-08 02:18:15,404 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2025-03-08 02:18:15,566 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1923 statements into 1 equivalence classes.
[2025-03-08 02:18:15,836 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1923 of 1923 statements.
[2025-03-08 02:18:15,836 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 02:18:15,836 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 02:18:15,842 INFO  L256         TraceCheckSpWp]: Trace formula consists of 2143 conjuncts, 4 conjuncts are in the unsatisfiable core
[2025-03-08 02:18:15,858 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 02:18:17,049 INFO  L134       CoverageAnalysis]: Checked inductivity of 3481 backedges. 2438 proven. 0 refuted. 0 times theorem prover too weak. 1043 trivial. 0 not checked.
[2025-03-08 02:18:17,049 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-08 02:18:17,049 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [552108861] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 02:18:17,049 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-08 02:18:17,049 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 10
[2025-03-08 02:18:17,049 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655038223]
[2025-03-08 02:18:17,050 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 02:18:17,050 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-08 02:18:17,050 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 02:18:17,051 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-08 02:18:17,051 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110
[2025-03-08 02:18:17,054 INFO  L87              Difference]: Start difference. First operand 98674 states and 100355 transitions. Second operand  has 4 states, 4 states have (on average 266.0) internal successors, (1064), 3 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)