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


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


Checking for ERROR reachability
Using default analysis
Version 798a7b37
Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem16_label37.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 0c9b36c4432c83400aecd1170e3c902f5356c89b28a319ce0e390f2a9fbc6f35
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-798a7b3-m
[2025-03-03 10:55:49,012 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-03-03 10:55:49,058 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2025-03-03 10:55:49,064 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-03-03 10:55:49,064 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-03-03 10:55:49,086 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-03-03 10:55:49,087 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-03-03 10:55:49,087 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-03-03 10:55:49,088 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-03-03 10:55:49,088 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-03-03 10:55:49,089 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-03-03 10:55:49,089 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-03-03 10:55:49,089 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-03-03 10:55:49,089 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-03-03 10:55:49,089 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-03-03 10:55:49,090 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-03-03 10:55:49,090 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-03-03 10:55:49,090 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-03-03 10:55:49,090 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-03-03 10:55:49,090 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-03-03 10:55:49,090 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-03-03 10:55:49,090 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-03-03 10:55:49,091 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-03-03 10:55:49,091 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-03-03 10:55:49,091 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-03-03 10:55:49,091 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-03-03 10:55:49,091 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-03-03 10:55:49,091 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-03-03 10:55:49,091 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-03-03 10:55:49,091 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-03-03 10:55:49,092 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-03-03 10:55:49,092 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-03-03 10:55:49,092 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-03 10:55:49,092 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-03-03 10:55:49,092 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-03-03 10:55:49,092 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-03-03 10:55:49,092 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-03-03 10:55:49,092 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-03-03 10:55:49,092 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-03-03 10:55:49,092 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-03-03 10:55:49,092 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-03-03 10:55:49,093 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-03-03 10:55:49,093 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-03-03 10:55:49,093 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 -> 0c9b36c4432c83400aecd1170e3c902f5356c89b28a319ce0e390f2a9fbc6f35
[2025-03-03 10:55:49,310 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-03-03 10:55:49,317 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-03-03 10:55:49,318 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-03-03 10:55:49,319 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-03-03 10:55:49,319 INFO  L274        PluginConnector]: CDTParser initialized
[2025-03-03 10:55:49,320 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem16_label37.c
[2025-03-03 10:55:50,520 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ef07bae6/43393ae28b3a4da69165736644c534ac/FLAGb3519e019
[2025-03-03 10:55:50,861 INFO  L384              CDTParser]: Found 1 translation units.
[2025-03-03 10:55:50,863 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label37.c
[2025-03-03 10:55:50,878 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ef07bae6/43393ae28b3a4da69165736644c534ac/FLAGb3519e019
[2025-03-03 10:55:51,103 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ef07bae6/43393ae28b3a4da69165736644c534ac
[2025-03-03 10:55:51,106 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-03-03 10:55:51,107 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-03-03 10:55:51,108 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-03-03 10:55:51,108 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-03-03 10:55:51,112 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-03-03 10:55:51,112 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:55:51" (1/1) ...
[2025-03-03 10:55:51,113 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3abd4185 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:55:51, skipping insertion in model container
[2025-03-03 10:55:51,113 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:55:51" (1/1) ...
[2025-03-03 10:55:51,156 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-03-03 10:55:51,304 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/Problem16_label37.c[2305,2318]
[2025-03-03 10:55:51,589 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-03 10:55:51,598 INFO  L200         MainTranslator]: Completed pre-run
[2025-03-03 10:55:51,608 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/Problem16_label37.c[2305,2318]
[2025-03-03 10:55:51,722 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-03 10:55:51,734 INFO  L204         MainTranslator]: Completed translation
[2025-03-03 10:55:51,735 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:55:51 WrapperNode
[2025-03-03 10:55:51,735 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-03-03 10:55:51,737 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-03-03 10:55:51,737 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-03-03 10:55:51,737 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-03-03 10:55:51,741 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:55:51" (1/1) ...
[2025-03-03 10:55:51,762 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:55:51" (1/1) ...
[2025-03-03 10:55:51,852 INFO  L138                Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1767
[2025-03-03 10:55:51,853 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-03-03 10:55:51,854 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-03-03 10:55:51,854 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-03-03 10:55:51,854 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-03-03 10:55:51,861 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:55:51" (1/1) ...
[2025-03-03 10:55:51,861 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:55:51" (1/1) ...
[2025-03-03 10:55:51,918 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:55:51" (1/1) ...
[2025-03-03 10:55:51,964 INFO  L175           MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2025-03-03 10:55:51,964 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:55:51" (1/1) ...
[2025-03-03 10:55:51,964 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:55:51" (1/1) ...
[2025-03-03 10:55:52,001 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:55:51" (1/1) ...
[2025-03-03 10:55:52,007 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:55:51" (1/1) ...
[2025-03-03 10:55:52,016 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:55:51" (1/1) ...
[2025-03-03 10:55:52,024 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:55:51" (1/1) ...
[2025-03-03 10:55:52,036 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-03-03 10:55:52,038 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-03-03 10:55:52,038 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-03-03 10:55:52,038 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-03-03 10:55:52,039 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:55:51" (1/1) ...
[2025-03-03 10:55:52,043 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-03 10:55:52,052 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 10:55:52,064 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2025-03-03 10:55:52,070 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2025-03-03 10:55:52,086 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-03-03 10:55:52,087 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-03-03 10:55:52,087 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-03-03 10:55:52,087 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-03-03 10:55:52,138 INFO  L256             CfgBuilder]: Building ICFG
[2025-03-03 10:55:52,140 INFO  L286             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-03-03 10:55:53,830 INFO  L1325  $ProcedureCfgBuilder]: dead code at ProgramPoint L1501: havoc calculate_output_#t~ret7#1;
[2025-03-03 10:55:53,906 INFO  L?                        ?]: Removed 276 outVars from TransFormulas that were not future-live.
[2025-03-03 10:55:53,906 INFO  L307             CfgBuilder]: Performing block encoding
[2025-03-03 10:55:53,941 INFO  L331             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-03-03 10:55:53,945 INFO  L336             CfgBuilder]: Removed 0 assume(true) statements.
[2025-03-03 10:55:53,945 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:55:53 BoogieIcfgContainer
[2025-03-03 10:55:53,945 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-03-03 10:55:53,948 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-03-03 10:55:53,950 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-03-03 10:55:53,954 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-03-03 10:55:53,954 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:55:51" (1/3) ...
[2025-03-03 10:55:53,955 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f392e02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:55:53, skipping insertion in model container
[2025-03-03 10:55:53,955 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:55:51" (2/3) ...
[2025-03-03 10:55:53,956 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f392e02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:55:53, skipping insertion in model container
[2025-03-03 10:55:53,956 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:55:53" (3/3) ...
[2025-03-03 10:55:53,957 INFO  L128   eAbstractionObserver]: Analyzing ICFG Problem16_label37.c
[2025-03-03 10:55:53,975 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-03-03 10:55:53,977 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG Problem16_label37.c that has 1 procedures, 396 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-03-03 10:55:54,048 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-03-03 10:55:54,056 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;@2f93056e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-03-03 10:55:54,057 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-03-03 10:55:54,064 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 396 states, 394 states have (on average 1.83248730964467) internal successors, (722), 395 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:55:54,069 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2025-03-03 10:55:54,069 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 10:55:54,069 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]
[2025-03-03 10:55:54,070 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 10:55:54,073 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 10:55:54,073 INFO  L85        PathProgramCache]: Analyzing trace with hash -1130494295, now seen corresponding path program 1 times
[2025-03-03 10:55:54,079 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 10:55:54,079 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060447584]
[2025-03-03 10:55:54,079 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:55:54,080 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 10:55:54,132 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes.
[2025-03-03 10:55:54,152 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements.
[2025-03-03 10:55:54,153 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:55:54,154 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:55:54,260 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 10:55:54,268 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 10:55:54,268 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060447584]
[2025-03-03 10:55:54,269 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060447584] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 10:55:54,269 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 10:55:54,269 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-03 10:55:54,270 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685900492]
[2025-03-03 10:55:54,270 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 10:55:54,275 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 10:55:54,275 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 10:55:54,289 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 10:55:54,290 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 10:55:54,294 INFO  L87              Difference]: Start difference. First operand  has 396 states, 394 states have (on average 1.83248730964467) internal successors, (722), 395 states have internal predecessors, (722), 0 states have call successors, (0), 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 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:55:55,818 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 10:55:55,818 INFO  L93              Difference]: Finished difference Result 1137 states and 2115 transitions.
[2025-03-03 10:55:55,821 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 10:55:55,822 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 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 20
[2025-03-03 10:55:55,822 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 10:55:55,829 INFO  L225             Difference]: With dead ends: 1137
[2025-03-03 10:55:55,830 INFO  L226             Difference]: Without dead ends: 662
[2025-03-03 10:55:55,832 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 10:55:55,834 INFO  L435           NwaCegarLoop]: 106 mSDtfsCounter, 364 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 1009 mSolverCounterSat, 429 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 1438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 429 IncrementalHoareTripleChecker+Valid, 1009 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time
[2025-03-03 10:55:55,835 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 114 Invalid, 1438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [429 Valid, 1009 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time]
[2025-03-03 10:55:55,846 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 662 states.
[2025-03-03 10:55:55,874 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 662.
[2025-03-03 10:55:55,876 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 662 states, 661 states have (on average 1.7004538577912254) internal successors, (1124), 661 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:55:55,880 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 1124 transitions.
[2025-03-03 10:55:55,881 INFO  L78                 Accepts]: Start accepts. Automaton has 662 states and 1124 transitions. Word has length 20
[2025-03-03 10:55:55,881 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 10:55:55,881 INFO  L471      AbstractCegarLoop]: Abstraction has 662 states and 1124 transitions.
[2025-03-03 10:55:55,882 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:55:55,882 INFO  L276                IsEmpty]: Start isEmpty. Operand 662 states and 1124 transitions.
[2025-03-03 10:55:55,883 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 87
[2025-03-03 10:55:55,883 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 10:55:55,883 INFO  L218           NwaCegarLoop]: trace histogram [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]
[2025-03-03 10:55:55,883 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2025-03-03 10:55:55,883 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 10:55:55,884 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 10:55:55,884 INFO  L85        PathProgramCache]: Analyzing trace with hash -586579750, now seen corresponding path program 1 times
[2025-03-03 10:55:55,884 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 10:55:55,884 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814838648]
[2025-03-03 10:55:55,884 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:55:55,884 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 10:55:55,900 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes.
[2025-03-03 10:55:55,939 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements.
[2025-03-03 10:55:55,940 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:55:55,940 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:55:56,094 INFO  L134       CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 10:55:56,094 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 10:55:56,094 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814838648]
[2025-03-03 10:55:56,094 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814838648] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 10:55:56,095 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 10:55:56,095 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-03 10:55:56,095 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461751306]
[2025-03-03 10:55:56,095 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 10:55:56,096 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 10:55:56,097 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 10:55:56,097 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 10:55:56,098 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 10:55:56,098 INFO  L87              Difference]: Start difference. First operand 662 states and 1124 transitions. Second operand  has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 2 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:55:57,122 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 10:55:57,122 INFO  L93              Difference]: Finished difference Result 1980 states and 3367 transitions.
[2025-03-03 10:55:57,122 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 10:55:57,123 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 2 states have internal predecessors, (86), 0 states have call successors, (0), 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 86
[2025-03-03 10:55:57,123 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 10:55:57,127 INFO  L225             Difference]: With dead ends: 1980
[2025-03-03 10:55:57,127 INFO  L226             Difference]: Without dead ends: 1320
[2025-03-03 10:55:57,129 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 10:55:57,129 INFO  L435           NwaCegarLoop]: 213 mSDtfsCounter, 293 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 812 mSolverCounterSat, 390 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 1202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 390 IncrementalHoareTripleChecker+Valid, 812 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time
[2025-03-03 10:55:57,129 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 218 Invalid, 1202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [390 Valid, 812 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time]
[2025-03-03 10:55:57,131 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1320 states.
[2025-03-03 10:55:57,154 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1320 to 1320.
[2025-03-03 10:55:57,155 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1320 states, 1319 states have (on average 1.4556482183472328) internal successors, (1920), 1319 states have internal predecessors, (1920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:55:57,161 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1320 states to 1320 states and 1920 transitions.
[2025-03-03 10:55:57,162 INFO  L78                 Accepts]: Start accepts. Automaton has 1320 states and 1920 transitions. Word has length 86
[2025-03-03 10:55:57,162 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 10:55:57,162 INFO  L471      AbstractCegarLoop]: Abstraction has 1320 states and 1920 transitions.
[2025-03-03 10:55:57,162 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 2 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:55:57,162 INFO  L276                IsEmpty]: Start isEmpty. Operand 1320 states and 1920 transitions.
[2025-03-03 10:55:57,164 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2025-03-03 10:55:57,164 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 10:55:57,164 INFO  L218           NwaCegarLoop]: trace histogram [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]
[2025-03-03 10:55:57,164 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-03-03 10:55:57,164 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 10:55:57,164 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 10:55:57,164 INFO  L85        PathProgramCache]: Analyzing trace with hash -1757089511, now seen corresponding path program 1 times
[2025-03-03 10:55:57,164 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 10:55:57,164 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278941683]
[2025-03-03 10:55:57,164 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:55:57,165 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 10:55:57,182 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes.
[2025-03-03 10:55:57,194 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements.
[2025-03-03 10:55:57,195 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:55:57,195 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:55:57,397 INFO  L134       CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 10:55:57,398 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 10:55:57,399 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278941683]
[2025-03-03 10:55:57,399 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278941683] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 10:55:57,399 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 10:55:57,399 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 10:55:57,399 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511911126]
[2025-03-03 10:55:57,399 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 10:55:57,400 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-03 10:55:57,400 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 10:55:57,400 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-03 10:55:57,400 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-03 10:55:57,401 INFO  L87              Difference]: Start difference. First operand 1320 states and 1920 transitions. Second operand  has 4 states, 4 states have (on average 24.75) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:55:59,135 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 10:55:59,136 INFO  L93              Difference]: Finished difference Result 4283 states and 6144 transitions.
[2025-03-03 10:55:59,136 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 10:55:59,136 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 24.75) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99
[2025-03-03 10:55:59,138 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 10:55:59,147 INFO  L225             Difference]: With dead ends: 4283
[2025-03-03 10:55:59,147 INFO  L226             Difference]: Without dead ends: 2965
[2025-03-03 10:55:59,151 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-03-03 10:55:59,152 INFO  L435           NwaCegarLoop]: 137 mSDtfsCounter, 886 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 2071 mSolverCounterSat, 204 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 886 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 2275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 204 IncrementalHoareTripleChecker+Valid, 2071 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time
[2025-03-03 10:55:59,152 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [886 Valid, 150 Invalid, 2275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [204 Valid, 2071 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time]
[2025-03-03 10:55:59,155 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2965 states.
[2025-03-03 10:55:59,189 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2965 to 2965.
[2025-03-03 10:55:59,193 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2965 states, 2964 states have (on average 1.3670715249662617) internal successors, (4052), 2964 states have internal predecessors, (4052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:55:59,200 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2965 states to 2965 states and 4052 transitions.
[2025-03-03 10:55:59,201 INFO  L78                 Accepts]: Start accepts. Automaton has 2965 states and 4052 transitions. Word has length 99
[2025-03-03 10:55:59,201 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 10:55:59,202 INFO  L471      AbstractCegarLoop]: Abstraction has 2965 states and 4052 transitions.
[2025-03-03 10:55:59,202 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 24.75) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:55:59,202 INFO  L276                IsEmpty]: Start isEmpty. Operand 2965 states and 4052 transitions.
[2025-03-03 10:55:59,206 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 187
[2025-03-03 10:55:59,209 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 10:55:59,209 INFO  L218           NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 10:55:59,209 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-03-03 10:55:59,209 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 10:55:59,210 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 10:55:59,210 INFO  L85        PathProgramCache]: Analyzing trace with hash 1938680637, now seen corresponding path program 1 times
[2025-03-03 10:55:59,210 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 10:55:59,211 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675707280]
[2025-03-03 10:55:59,211 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:55:59,211 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 10:55:59,229 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes.
[2025-03-03 10:55:59,249 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements.
[2025-03-03 10:55:59,249 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:55:59,249 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:55:59,408 INFO  L134       CoverageAnalysis]: Checked inductivity of 113 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked.
[2025-03-03 10:55:59,408 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 10:55:59,408 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675707280]
[2025-03-03 10:55:59,408 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675707280] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 10:55:59,408 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 10:55:59,408 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-03 10:55:59,408 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790087392]
[2025-03-03 10:55:59,409 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 10:55:59,409 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 10:55:59,409 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 10:55:59,409 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 10:55:59,409 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 10:55:59,409 INFO  L87              Difference]: Start difference. First operand 2965 states and 4052 transitions. Second operand  has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:56:00,395 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 10:56:00,395 INFO  L93              Difference]: Finished difference Result 8231 states and 11469 transitions.
[2025-03-03 10:56:00,395 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 10:56:00,396 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 0 states have call successors, (0), 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 186
[2025-03-03 10:56:00,396 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 10:56:00,413 INFO  L225             Difference]: With dead ends: 8231
[2025-03-03 10:56:00,413 INFO  L226             Difference]: Without dead ends: 5597
[2025-03-03 10:56:00,417 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 10:56:00,418 INFO  L435           NwaCegarLoop]: 151 mSDtfsCounter, 359 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 368 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 1179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 368 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time
[2025-03-03 10:56:00,418 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 155 Invalid, 1179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [368 Valid, 811 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2025-03-03 10:56:00,423 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 5597 states.
[2025-03-03 10:56:00,479 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 5597 to 4281.
[2025-03-03 10:56:00,485 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 4281 states, 4280 states have (on average 1.3133177570093457) internal successors, (5621), 4280 states have internal predecessors, (5621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:56:00,491 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4281 states to 4281 states and 5621 transitions.
[2025-03-03 10:56:00,492 INFO  L78                 Accepts]: Start accepts. Automaton has 4281 states and 5621 transitions. Word has length 186
[2025-03-03 10:56:00,492 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 10:56:00,492 INFO  L471      AbstractCegarLoop]: Abstraction has 4281 states and 5621 transitions.
[2025-03-03 10:56:00,492 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:56:00,493 INFO  L276                IsEmpty]: Start isEmpty. Operand 4281 states and 5621 transitions.
[2025-03-03 10:56:00,494 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 218
[2025-03-03 10:56:00,494 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 10:56:00,494 INFO  L218           NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 10:56:00,494 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-03-03 10:56:00,495 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 10:56:00,495 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 10:56:00,495 INFO  L85        PathProgramCache]: Analyzing trace with hash -1340421304, now seen corresponding path program 1 times
[2025-03-03 10:56:00,495 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 10:56:00,495 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841688196]
[2025-03-03 10:56:00,495 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:56:00,496 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 10:56:00,524 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes.
[2025-03-03 10:56:00,541 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements.
[2025-03-03 10:56:00,541 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:56:00,541 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:56:00,684 INFO  L134       CoverageAnalysis]: Checked inductivity of 100 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked.
[2025-03-03 10:56:00,684 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 10:56:00,684 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841688196]
[2025-03-03 10:56:00,684 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841688196] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 10:56:00,684 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 10:56:00,684 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-03 10:56:00,684 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559153629]
[2025-03-03 10:56:00,684 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 10:56:00,684 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 10:56:00,684 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 10:56:00,685 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 10:56:00,685 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 10:56:00,685 INFO  L87              Difference]: Start difference. First operand 4281 states and 5621 transitions. Second operand  has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 2 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:56:01,635 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 10:56:01,635 INFO  L93              Difference]: Finished difference Result 9547 states and 12468 transitions.
[2025-03-03 10:56:01,636 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 10:56:01,636 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 2 states have internal predecessors, (200), 0 states have call successors, (0), 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 217
[2025-03-03 10:56:01,636 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 10:56:01,651 INFO  L225             Difference]: With dead ends: 9547
[2025-03-03 10:56:01,651 INFO  L226             Difference]: Without dead ends: 5597
[2025-03-03 10:56:01,656 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 10:56:01,656 INFO  L435           NwaCegarLoop]: 80 mSDtfsCounter, 277 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 883 mSolverCounterSat, 264 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 1147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 264 IncrementalHoareTripleChecker+Valid, 883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time
[2025-03-03 10:56:01,657 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 84 Invalid, 1147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [264 Valid, 883 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2025-03-03 10:56:01,662 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 5597 states.
[2025-03-03 10:56:01,715 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 5597 to 5597.
[2025-03-03 10:56:01,722 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 5597 states, 5596 states have (on average 1.2162258756254467) internal successors, (6806), 5596 states have internal predecessors, (6806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:56:01,730 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5597 states to 5597 states and 6806 transitions.
[2025-03-03 10:56:01,730 INFO  L78                 Accepts]: Start accepts. Automaton has 5597 states and 6806 transitions. Word has length 217
[2025-03-03 10:56:01,731 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 10:56:01,731 INFO  L471      AbstractCegarLoop]: Abstraction has 5597 states and 6806 transitions.
[2025-03-03 10:56:01,731 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 2 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:56:01,731 INFO  L276                IsEmpty]: Start isEmpty. Operand 5597 states and 6806 transitions.
[2025-03-03 10:56:01,734 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 353
[2025-03-03 10:56:01,734 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 10:56:01,735 INFO  L218           NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 10:56:01,736 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-03-03 10:56:01,736 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 10:56:01,736 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 10:56:01,736 INFO  L85        PathProgramCache]: Analyzing trace with hash 527593118, now seen corresponding path program 1 times
[2025-03-03 10:56:01,737 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 10:56:01,737 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838557554]
[2025-03-03 10:56:01,737 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:56:01,737 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 10:56:01,768 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 352 statements into 1 equivalence classes.
[2025-03-03 10:56:01,815 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 352 of 352 statements.
[2025-03-03 10:56:01,815 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:56:01,815 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:56:02,238 INFO  L134       CoverageAnalysis]: Checked inductivity of 121 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 10:56:02,238 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 10:56:02,239 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838557554]
[2025-03-03 10:56:02,239 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838557554] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 10:56:02,239 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 10:56:02,239 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-03-03 10:56:02,239 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038846005]
[2025-03-03 10:56:02,239 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 10:56:02,240 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-03-03 10:56:02,240 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 10:56:02,240 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-03-03 10:56:02,241 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42
[2025-03-03 10:56:02,241 INFO  L87              Difference]: Start difference. First operand 5597 states and 6806 transitions. Second operand  has 7 states, 7 states have (on average 50.285714285714285) internal successors, (352), 6 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:56:03,679 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 10:56:03,679 INFO  L93              Difference]: Finished difference Result 10722 states and 13122 transitions.
[2025-03-03 10:56:03,680 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-03-03 10:56:03,680 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 50.285714285714285) internal successors, (352), 6 states have internal predecessors, (352), 0 states have call successors, (0), 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 352
[2025-03-03 10:56:03,680 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 10:56:03,691 INFO  L225             Difference]: With dead ends: 10722
[2025-03-03 10:56:03,691 INFO  L226             Difference]: Without dead ends: 5268
[2025-03-03 10:56:03,696 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42
[2025-03-03 10:56:03,696 INFO  L435           NwaCegarLoop]: 263 mSDtfsCounter, 308 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 1870 mSolverCounterSat, 351 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 2221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 351 IncrementalHoareTripleChecker+Valid, 1870 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time
[2025-03-03 10:56:03,697 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 291 Invalid, 2221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [351 Valid, 1870 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time]
[2025-03-03 10:56:03,701 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 5268 states.
[2025-03-03 10:56:03,744 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 5268 to 5268.
[2025-03-03 10:56:03,750 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 5268 states, 5267 states have (on average 1.0924625023732675) internal successors, (5754), 5267 states have internal predecessors, (5754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:56:03,757 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5268 states to 5268 states and 5754 transitions.
[2025-03-03 10:56:03,757 INFO  L78                 Accepts]: Start accepts. Automaton has 5268 states and 5754 transitions. Word has length 352
[2025-03-03 10:56:03,757 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 10:56:03,757 INFO  L471      AbstractCegarLoop]: Abstraction has 5268 states and 5754 transitions.
[2025-03-03 10:56:03,758 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 50.285714285714285) internal successors, (352), 6 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:56:03,758 INFO  L276                IsEmpty]: Start isEmpty. Operand 5268 states and 5754 transitions.
[2025-03-03 10:56:03,760 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 360
[2025-03-03 10:56:03,760 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 10:56:03,760 INFO  L218           NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 10:56:03,760 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-03-03 10:56:03,761 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 10:56:03,761 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 10:56:03,761 INFO  L85        PathProgramCache]: Analyzing trace with hash -1981100155, now seen corresponding path program 1 times
[2025-03-03 10:56:03,761 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 10:56:03,761 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771814637]
[2025-03-03 10:56:03,761 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:56:03,762 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 10:56:03,788 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 359 statements into 1 equivalence classes.
[2025-03-03 10:56:03,813 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 359 of 359 statements.
[2025-03-03 10:56:03,814 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:56:03,814 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:56:04,200 INFO  L134       CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked.
[2025-03-03 10:56:04,201 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 10:56:04,201 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771814637]
[2025-03-03 10:56:04,201 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771814637] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 10:56:04,201 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [861410802]
[2025-03-03 10:56:04,201 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:56:04,201 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 10:56:04,201 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 10:56:04,203 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-03 10:56:04,205 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2025-03-03 10:56:04,260 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 359 statements into 1 equivalence classes.
[2025-03-03 10:56:04,317 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 359 of 359 statements.
[2025-03-03 10:56:04,317 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:56:04,317 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:56:04,320 INFO  L256         TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-03-03 10:56:04,326 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 10:56:04,377 INFO  L134       CoverageAnalysis]: Checked inductivity of 130 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked.
[2025-03-03 10:56:04,377 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-03 10:56:04,377 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [861410802] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 10:56:04,377 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-03 10:56:04,377 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5
[2025-03-03 10:56:04,377 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929075628]
[2025-03-03 10:56:04,378 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 10:56:04,378 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 10:56:04,378 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 10:56:04,378 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 10:56:04,379 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-03 10:56:04,379 INFO  L87              Difference]: Start difference. First operand 5268 states and 5754 transitions. Second operand  has 3 states, 3 states have (on average 88.33333333333333) internal successors, (265), 3 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:56:05,129 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 10:56:05,129 INFO  L93              Difference]: Finished difference Result 12837 states and 14168 transitions.
[2025-03-03 10:56:05,129 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 10:56:05,130 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 88.33333333333333) internal successors, (265), 3 states have internal predecessors, (265), 0 states have call successors, (0), 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 359
[2025-03-03 10:56:05,130 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 10:56:05,156 INFO  L225             Difference]: With dead ends: 12837
[2025-03-03 10:56:05,159 INFO  L226             Difference]: Without dead ends: 7900
[2025-03-03 10:56:05,163 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 361 GetRequests, 358 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-03 10:56:05,164 INFO  L435           NwaCegarLoop]: 35 mSDtfsCounter, 329 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 769 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 889 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-03-03 10:56:05,164 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 40 Invalid, 889 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 769 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-03-03 10:56:05,170 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 7900 states.
[2025-03-03 10:56:05,266 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 7900 to 7900.
[2025-03-03 10:56:05,276 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 7900 states, 7899 states have (on average 1.0946955310798836) internal successors, (8647), 7899 states have internal predecessors, (8647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:56:05,285 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7900 states to 7900 states and 8647 transitions.
[2025-03-03 10:56:05,285 INFO  L78                 Accepts]: Start accepts. Automaton has 7900 states and 8647 transitions. Word has length 359
[2025-03-03 10:56:05,286 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 10:56:05,286 INFO  L471      AbstractCegarLoop]: Abstraction has 7900 states and 8647 transitions.
[2025-03-03 10:56:05,286 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 88.33333333333333) internal successors, (265), 3 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:56:05,286 INFO  L276                IsEmpty]: Start isEmpty. Operand 7900 states and 8647 transitions.
[2025-03-03 10:56:05,290 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 477
[2025-03-03 10:56:05,291 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 10:56:05,291 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 10:56:05,298 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2025-03-03 10:56:05,495 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 10:56:05,495 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 10:56:05,496 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 10:56:05,496 INFO  L85        PathProgramCache]: Analyzing trace with hash -982879476, now seen corresponding path program 1 times
[2025-03-03 10:56:05,496 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 10:56:05,496 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684144220]
[2025-03-03 10:56:05,496 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:56:05,496 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 10:56:05,535 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 476 statements into 1 equivalence classes.
[2025-03-03 10:56:05,555 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 476 of 476 statements.
[2025-03-03 10:56:05,555 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:56:05,555 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:56:05,945 INFO  L134       CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked.
[2025-03-03 10:56:05,945 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 10:56:05,945 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684144220]
[2025-03-03 10:56:05,945 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684144220] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 10:56:05,945 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1635254304]
[2025-03-03 10:56:05,945 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:56:05,946 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 10:56:05,946 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 10:56:05,947 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-03 10:56:05,949 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2025-03-03 10:56:06,002 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 476 statements into 1 equivalence classes.
[2025-03-03 10:56:06,066 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 476 of 476 statements.
[2025-03-03 10:56:06,067 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:56:06,067 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:56:06,069 INFO  L256         TraceCheckSpWp]: Trace formula consists of 572 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-03-03 10:56:06,074 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 10:56:06,125 INFO  L134       CoverageAnalysis]: Checked inductivity of 255 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked.
[2025-03-03 10:56:06,126 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-03 10:56:06,126 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1635254304] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 10:56:06,126 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-03 10:56:06,128 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5
[2025-03-03 10:56:06,128 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247420963]
[2025-03-03 10:56:06,128 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 10:56:06,128 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 10:56:06,128 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 10:56:06,129 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 10:56:06,129 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-03 10:56:06,129 INFO  L87              Difference]: Start difference. First operand 7900 states and 8647 transitions. Second operand  has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:56:06,897 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 10:56:06,897 INFO  L93              Difference]: Finished difference Result 18101 states and 19954 transitions.
[2025-03-03 10:56:06,897 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 10:56:06,898 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 0 states have call successors, (0), 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 476
[2025-03-03 10:56:06,898 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 10:56:06,914 INFO  L225             Difference]: With dead ends: 18101
[2025-03-03 10:56:06,914 INFO  L226             Difference]: Without dead ends: 10532
[2025-03-03 10:56:06,921 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 478 GetRequests, 475 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-03 10:56:06,922 INFO  L435           NwaCegarLoop]: 28 mSDtfsCounter, 330 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 763 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 909 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-03-03 10:56:06,922 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 33 Invalid, 909 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 763 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-03-03 10:56:06,930 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 10532 states.
[2025-03-03 10:56:07,042 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 10532 to 10203.
[2025-03-03 10:56:07,059 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 10203 states, 10202 states have (on average 1.1027249558910017) internal successors, (11250), 10202 states have internal predecessors, (11250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:56:07,073 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10203 states to 10203 states and 11250 transitions.
[2025-03-03 10:56:07,074 INFO  L78                 Accepts]: Start accepts. Automaton has 10203 states and 11250 transitions. Word has length 476
[2025-03-03 10:56:07,075 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 10:56:07,075 INFO  L471      AbstractCegarLoop]: Abstraction has 10203 states and 11250 transitions.
[2025-03-03 10:56:07,078 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:56:07,079 INFO  L276                IsEmpty]: Start isEmpty. Operand 10203 states and 11250 transitions.
[2025-03-03 10:56:07,086 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 544
[2025-03-03 10:56:07,086 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 10:56:07,087 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-03-03 10:56:07,094 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0
[2025-03-03 10:56:07,287 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,SelfDestructingSolverStorable7
[2025-03-03 10:56:07,289 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 10:56:07,290 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 10:56:07,290 INFO  L85        PathProgramCache]: Analyzing trace with hash 172567727, now seen corresponding path program 1 times
[2025-03-03 10:56:07,290 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 10:56:07,290 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310765837]
[2025-03-03 10:56:07,290 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:56:07,290 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 10:56:07,351 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 543 statements into 1 equivalence classes.
[2025-03-03 10:56:07,385 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 543 of 543 statements.
[2025-03-03 10:56:07,386 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:56:07,386 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:56:07,848 INFO  L134       CoverageAnalysis]: Checked inductivity of 269 backedges. 269 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 10:56:07,849 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 10:56:07,849 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310765837]
[2025-03-03 10:56:07,849 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310765837] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 10:56:07,849 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 10:56:07,849 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 10:56:07,849 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001590524]
[2025-03-03 10:56:07,850 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 10:56:07,851 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-03 10:56:07,851 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 10:56:07,852 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-03 10:56:07,852 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-03 10:56:07,853 INFO  L87              Difference]: Start difference. First operand 10203 states and 11250 transitions. Second operand  has 4 states, 4 states have (on average 135.75) internal successors, (543), 3 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:56:08,996 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 10:56:08,997 INFO  L93              Difference]: Finished difference Result 21062 states and 23245 transitions.
[2025-03-03 10:56:08,997 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 10:56:08,997 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 135.75) internal successors, (543), 3 states have internal predecessors, (543), 0 states have call successors, (0), 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 543
[2025-03-03 10:56:08,998 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 10:56:09,016 INFO  L225             Difference]: With dead ends: 21062
[2025-03-03 10:56:09,016 INFO  L226             Difference]: Without dead ends: 11190
[2025-03-03 10:56:09,025 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-03 10:56:09,026 INFO  L435           NwaCegarLoop]: 58 mSDtfsCounter, 185 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 1235 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 1336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 1235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time
[2025-03-03 10:56:09,026 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 67 Invalid, 1336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 1235 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2025-03-03 10:56:09,034 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 11190 states.
[2025-03-03 10:56:09,101 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 11190 to 11190.
[2025-03-03 10:56:09,113 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 11190 states, 11189 states have (on average 1.100455804808294) internal successors, (12313), 11189 states have internal predecessors, (12313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:56:09,123 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11190 states to 11190 states and 12313 transitions.
[2025-03-03 10:56:09,123 INFO  L78                 Accepts]: Start accepts. Automaton has 11190 states and 12313 transitions. Word has length 543
[2025-03-03 10:56:09,124 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 10:56:09,124 INFO  L471      AbstractCegarLoop]: Abstraction has 11190 states and 12313 transitions.
[2025-03-03 10:56:09,124 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 135.75) internal successors, (543), 3 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:56:09,124 INFO  L276                IsEmpty]: Start isEmpty. Operand 11190 states and 12313 transitions.
[2025-03-03 10:56:09,152 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 567
[2025-03-03 10:56:09,152 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 10:56:09,153 INFO  L218           NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-03-03 10:56:09,153 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-03-03 10:56:09,153 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 10:56:09,154 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 10:56:09,154 INFO  L85        PathProgramCache]: Analyzing trace with hash 956661057, now seen corresponding path program 1 times
[2025-03-03 10:56:09,154 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 10:56:09,154 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255950334]
[2025-03-03 10:56:09,154 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:56:09,154 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 10:56:09,191 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 566 statements into 1 equivalence classes.
[2025-03-03 10:56:09,209 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 566 of 566 statements.
[2025-03-03 10:56:09,209 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:56:09,209 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:56:09,611 INFO  L134       CoverageAnalysis]: Checked inductivity of 418 backedges. 166 proven. 0 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked.
[2025-03-03 10:56:09,611 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 10:56:09,611 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255950334]
[2025-03-03 10:56:09,611 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255950334] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 10:56:09,611 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 10:56:09,611 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-03 10:56:09,611 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860097913]
[2025-03-03 10:56:09,611 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 10:56:09,612 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 10:56:09,612 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 10:56:09,612 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 10:56:09,612 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 10:56:09,612 INFO  L87              Difference]: Start difference. First operand 11190 states and 12313 transitions. Second operand  has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 2 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:56:10,222 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 10:56:10,223 INFO  L93              Difference]: Finished difference Result 22378 states and 24627 transitions.
[2025-03-03 10:56:10,223 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 10:56:10,223 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 2 states have internal predecessors, (316), 0 states have call successors, (0), 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 566
[2025-03-03 10:56:10,223 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 10:56:10,241 INFO  L225             Difference]: With dead ends: 22378
[2025-03-03 10:56:10,241 INFO  L226             Difference]: Without dead ends: 11519
[2025-03-03 10:56:10,252 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 10:56:10,253 INFO  L435           NwaCegarLoop]: 108 mSDtfsCounter, 85 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 759 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-03 10:56:10,253 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 113 Invalid, 759 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 759 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-03 10:56:10,262 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 11519 states.
[2025-03-03 10:56:10,331 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 11519 to 11519.
[2025-03-03 10:56:10,343 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 11519 states, 11518 states have (on average 1.0979336690397639) internal successors, (12646), 11518 states have internal predecessors, (12646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:56:10,352 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11519 states to 11519 states and 12646 transitions.
[2025-03-03 10:56:10,353 INFO  L78                 Accepts]: Start accepts. Automaton has 11519 states and 12646 transitions. Word has length 566
[2025-03-03 10:56:10,354 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 10:56:10,354 INFO  L471      AbstractCegarLoop]: Abstraction has 11519 states and 12646 transitions.
[2025-03-03 10:56:10,355 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 2 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:56:10,355 INFO  L276                IsEmpty]: Start isEmpty. Operand 11519 states and 12646 transitions.
[2025-03-03 10:56:10,358 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 575
[2025-03-03 10:56:10,358 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 10:56:10,359 INFO  L218           NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-03-03 10:56:10,359 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-03-03 10:56:10,359 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 10:56:10,360 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 10:56:10,360 INFO  L85        PathProgramCache]: Analyzing trace with hash 621669333, now seen corresponding path program 1 times
[2025-03-03 10:56:10,360 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 10:56:10,360 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648287430]
[2025-03-03 10:56:10,360 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:56:10,360 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 10:56:10,393 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 574 statements into 1 equivalence classes.
[2025-03-03 10:56:10,411 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 574 of 574 statements.
[2025-03-03 10:56:10,411 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:56:10,411 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:56:10,678 INFO  L134       CoverageAnalysis]: Checked inductivity of 426 backedges. 166 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked.
[2025-03-03 10:56:10,678 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 10:56:10,678 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648287430]
[2025-03-03 10:56:10,678 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648287430] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 10:56:10,678 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 10:56:10,678 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 10:56:10,678 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317573799]
[2025-03-03 10:56:10,679 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 10:56:10,679 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 10:56:10,679 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 10:56:10,679 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 10:56:10,679 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 10:56:10,680 INFO  L87              Difference]: Start difference. First operand 11519 states and 12646 transitions. Second operand  has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:56:11,298 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 10:56:11,298 INFO  L93              Difference]: Finished difference Result 22378 states and 24626 transitions.
[2025-03-03 10:56:11,299 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 10:56:11,299 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 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 574
[2025-03-03 10:56:11,300 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 10:56:11,316 INFO  L225             Difference]: With dead ends: 22378
[2025-03-03 10:56:11,317 INFO  L226             Difference]: Without dead ends: 11519
[2025-03-03 10:56:11,325 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 10:56:11,326 INFO  L435           NwaCegarLoop]: 421 mSDtfsCounter, 278 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 744 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-03 10:56:11,326 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 427 Invalid, 774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 744 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-03 10:56:11,335 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 11519 states.
[2025-03-03 10:56:11,398 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 11519 to 11519.
[2025-03-03 10:56:11,407 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 11519 states, 11518 states have (on average 1.0918562250390693) internal successors, (12576), 11518 states have internal predecessors, (12576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:56:11,417 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11519 states to 11519 states and 12576 transitions.
[2025-03-03 10:56:11,417 INFO  L78                 Accepts]: Start accepts. Automaton has 11519 states and 12576 transitions. Word has length 574
[2025-03-03 10:56:11,417 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 10:56:11,418 INFO  L471      AbstractCegarLoop]: Abstraction has 11519 states and 12576 transitions.
[2025-03-03 10:56:11,418 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:56:11,418 INFO  L276                IsEmpty]: Start isEmpty. Operand 11519 states and 12576 transitions.
[2025-03-03 10:56:11,422 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 648
[2025-03-03 10:56:11,422 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 10:56:11,423 INFO  L218           NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-03-03 10:56:11,423 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-03-03 10:56:11,423 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 10:56:11,424 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 10:56:11,424 INFO  L85        PathProgramCache]: Analyzing trace with hash 97417377, now seen corresponding path program 1 times
[2025-03-03 10:56:11,424 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 10:56:11,424 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461373724]
[2025-03-03 10:56:11,424 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:56:11,424 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 10:56:11,462 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 647 statements into 1 equivalence classes.
[2025-03-03 10:56:11,485 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 647 of 647 statements.
[2025-03-03 10:56:11,486 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:56:11,486 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:56:11,807 INFO  L134       CoverageAnalysis]: Checked inductivity of 486 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 427 trivial. 0 not checked.
[2025-03-03 10:56:11,807 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 10:56:11,807 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461373724]
[2025-03-03 10:56:11,807 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461373724] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 10:56:11,807 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1945055131]
[2025-03-03 10:56:11,807 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:56:11,807 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 10:56:11,807 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 10:56:11,809 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-03 10:56:11,811 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2025-03-03 10:56:11,867 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 647 statements into 1 equivalence classes.
[2025-03-03 10:56:11,934 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 647 of 647 statements.
[2025-03-03 10:56:11,934 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:56:11,934 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:56:11,937 INFO  L256         TraceCheckSpWp]: Trace formula consists of 770 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-03-03 10:56:11,942 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 10:56:12,542 INFO  L134       CoverageAnalysis]: Checked inductivity of 486 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 486 trivial. 0 not checked.
[2025-03-03 10:56:12,543 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-03 10:56:12,543 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1945055131] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 10:56:12,543 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-03 10:56:12,543 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4
[2025-03-03 10:56:12,543 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637174686]
[2025-03-03 10:56:12,543 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 10:56:12,544 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 10:56:12,544 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 10:56:12,544 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 10:56:12,544 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-03 10:56:12,545 INFO  L87              Difference]: Start difference. First operand 11519 states and 12576 transitions. Second operand  has 3 states, 3 states have (on average 98.0) internal successors, (294), 2 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:56:13,111 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 10:56:13,111 INFO  L93              Difference]: Finished difference Result 13495 states and 14612 transitions.
[2025-03-03 10:56:13,111 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 10:56:13,111 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 98.0) internal successors, (294), 2 states have internal predecessors, (294), 0 states have call successors, (0), 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 647
[2025-03-03 10:56:13,112 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 10:56:13,131 INFO  L225             Difference]: With dead ends: 13495
[2025-03-03 10:56:13,131 INFO  L226             Difference]: Without dead ends: 13493
[2025-03-03 10:56:13,136 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 649 GetRequests, 646 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-03 10:56:13,137 INFO  L435           NwaCegarLoop]: 78 mSDtfsCounter, 62 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 748 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 780 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-03 10:56:13,137 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 83 Invalid, 780 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 748 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-03 10:56:13,146 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 13493 states.
[2025-03-03 10:56:13,227 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 13493 to 11519.
[2025-03-03 10:56:13,238 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 11519 states, 11518 states have (on average 1.0918562250390693) internal successors, (12576), 11518 states have internal predecessors, (12576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:56:13,250 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11519 states to 11519 states and 12576 transitions.
[2025-03-03 10:56:13,251 INFO  L78                 Accepts]: Start accepts. Automaton has 11519 states and 12576 transitions. Word has length 647
[2025-03-03 10:56:13,251 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 10:56:13,251 INFO  L471      AbstractCegarLoop]: Abstraction has 11519 states and 12576 transitions.
[2025-03-03 10:56:13,252 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 98.0) internal successors, (294), 2 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:56:13,252 INFO  L276                IsEmpty]: Start isEmpty. Operand 11519 states and 12576 transitions.
[2025-03-03 10:56:13,263 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 898
[2025-03-03 10:56:13,264 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 10:56:13,264 INFO  L218           NwaCegarLoop]: trace histogram [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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 10:56:13,271 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0
[2025-03-03 10:56:13,468 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 10:56:13,468 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 10:56:13,469 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 10:56:13,469 INFO  L85        PathProgramCache]: Analyzing trace with hash 1148877082, now seen corresponding path program 1 times
[2025-03-03 10:56:13,469 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 10:56:13,469 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906489421]
[2025-03-03 10:56:13,469 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:56:13,469 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 10:56:13,523 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 897 statements into 1 equivalence classes.
[2025-03-03 10:56:13,554 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 897 of 897 statements.
[2025-03-03 10:56:13,554 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:56:13,554 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:56:13,849 INFO  L134       CoverageAnalysis]: Checked inductivity of 1566 backedges. 888 proven. 0 refuted. 0 times theorem prover too weak. 678 trivial. 0 not checked.
[2025-03-03 10:56:13,849 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 10:56:13,849 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906489421]
[2025-03-03 10:56:13,849 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906489421] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 10:56:13,849 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 10:56:13,849 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 10:56:13,849 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149608512]
[2025-03-03 10:56:13,849 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 10:56:13,850 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 10:56:13,850 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 10:56:13,850 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 10:56:13,850 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 10:56:13,851 INFO  L87              Difference]: Start difference. First operand 11519 states and 12576 transitions. Second operand  has 3 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:56:14,531 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 10:56:14,531 INFO  L93              Difference]: Finished difference Result 24352 states and 26524 transitions.
[2025-03-03 10:56:14,531 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 10:56:14,532 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 0 states have call successors, (0), 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 897
[2025-03-03 10:56:14,532 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 10:56:14,545 INFO  L225             Difference]: With dead ends: 24352
[2025-03-03 10:56:14,545 INFO  L226             Difference]: Without dead ends: 11519
[2025-03-03 10:56:14,553 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 10:56:14,554 INFO  L435           NwaCegarLoop]: 424 mSDtfsCounter, 270 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-03 10:56:14,554 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 430 Invalid, 833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 747 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-03 10:56:14,562 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 11519 states.
[2025-03-03 10:56:14,626 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 11519 to 11190.
[2025-03-03 10:56:14,633 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 11190 states, 11189 states have (on average 1.056305299848065) internal successors, (11819), 11189 states have internal predecessors, (11819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:56:14,642 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11190 states to 11190 states and 11819 transitions.
[2025-03-03 10:56:14,643 INFO  L78                 Accepts]: Start accepts. Automaton has 11190 states and 11819 transitions. Word has length 897
[2025-03-03 10:56:14,643 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 10:56:14,643 INFO  L471      AbstractCegarLoop]: Abstraction has 11190 states and 11819 transitions.
[2025-03-03 10:56:14,643 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:56:14,644 INFO  L276                IsEmpty]: Start isEmpty. Operand 11190 states and 11819 transitions.
[2025-03-03 10:56:14,659 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1205
[2025-03-03 10:56:14,659 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 10:56:14,660 INFO  L218           NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 10:56:14,660 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2025-03-03 10:56:14,660 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 10:56:14,660 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 10:56:14,661 INFO  L85        PathProgramCache]: Analyzing trace with hash 839039226, now seen corresponding path program 1 times
[2025-03-03 10:56:14,661 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 10:56:14,661 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123584721]
[2025-03-03 10:56:14,661 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:56:14,661 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 10:56:14,770 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1204 statements into 1 equivalence classes.
[2025-03-03 10:56:14,820 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1204 of 1204 statements.
[2025-03-03 10:56:14,820 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:56:14,820 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:56:15,211 INFO  L134       CoverageAnalysis]: Checked inductivity of 2598 backedges. 1731 proven. 0 refuted. 0 times theorem prover too weak. 867 trivial. 0 not checked.
[2025-03-03 10:56:15,211 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 10:56:15,211 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123584721]
[2025-03-03 10:56:15,211 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123584721] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 10:56:15,211 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 10:56:15,212 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 10:56:15,212 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910987794]
[2025-03-03 10:56:15,212 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 10:56:15,212 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 10:56:15,212 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 10:56:15,213 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 10:56:15,213 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 10:56:15,213 INFO  L87              Difference]: Start difference. First operand 11190 states and 11819 transitions. Second operand  has 3 states, 3 states have (on average 200.33333333333334) internal successors, (601), 3 states have internal predecessors, (601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:56:15,847 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 10:56:15,847 INFO  L93              Difference]: Finished difference Result 23036 states and 24373 transitions.
[2025-03-03 10:56:15,847 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 10:56:15,847 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 200.33333333333334) internal successors, (601), 3 states have internal predecessors, (601), 0 states have call successors, (0), 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 1204
[2025-03-03 10:56:15,847 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 10:56:15,859 INFO  L225             Difference]: With dead ends: 23036
[2025-03-03 10:56:15,860 INFO  L226             Difference]: Without dead ends: 12506
[2025-03-03 10:56:15,867 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 10:56:15,867 INFO  L435           NwaCegarLoop]: 418 mSDtfsCounter, 251 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 753 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 818 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-03 10:56:15,867 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 424 Invalid, 818 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 753 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-03 10:56:15,875 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 12506 states.
[2025-03-03 10:56:15,939 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 12506 to 12506.
[2025-03-03 10:56:15,949 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 12506 states, 12505 states have (on average 1.048060775689724) internal successors, (13106), 12505 states have internal predecessors, (13106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:56:15,959 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 12506 states to 12506 states and 13106 transitions.
[2025-03-03 10:56:15,960 INFO  L78                 Accepts]: Start accepts. Automaton has 12506 states and 13106 transitions. Word has length 1204
[2025-03-03 10:56:15,960 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 10:56:15,960 INFO  L471      AbstractCegarLoop]: Abstraction has 12506 states and 13106 transitions.
[2025-03-03 10:56:15,961 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 200.33333333333334) internal successors, (601), 3 states have internal predecessors, (601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:56:15,961 INFO  L276                IsEmpty]: Start isEmpty. Operand 12506 states and 13106 transitions.
[2025-03-03 10:56:15,975 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1209
[2025-03-03 10:56:15,975 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 10:56:15,975 INFO  L218           NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 10:56:15,975 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2025-03-03 10:56:15,976 INFO  L396      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 10:56:15,976 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 10:56:15,976 INFO  L85        PathProgramCache]: Analyzing trace with hash -806553341, now seen corresponding path program 1 times
[2025-03-03 10:56:15,977 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 10:56:15,977 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984495536]
[2025-03-03 10:56:15,977 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:56:15,977 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 10:56:16,031 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1208 statements into 1 equivalence classes.
[2025-03-03 10:56:16,070 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1208 of 1208 statements.
[2025-03-03 10:56:16,070 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:56:16,070 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:56:16,463 INFO  L134       CoverageAnalysis]: Checked inductivity of 2733 backedges. 920 proven. 0 refuted. 0 times theorem prover too weak. 1813 trivial. 0 not checked.
[2025-03-03 10:56:16,464 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 10:56:16,464 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984495536]
[2025-03-03 10:56:16,464 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984495536] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 10:56:16,464 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 10:56:16,464 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 10:56:16,464 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353722832]
[2025-03-03 10:56:16,464 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 10:56:16,465 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 10:56:16,465 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 10:56:16,465 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 10:56:16,465 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 10:56:16,465 INFO  L87              Difference]: Start difference. First operand 12506 states and 13106 transitions. Second operand  has 3 states, 3 states have (on average 147.66666666666666) internal successors, (443), 3 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:56:17,169 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 10:56:17,170 INFO  L93              Difference]: Finished difference Result 26984 states and 28326 transitions.
[2025-03-03 10:56:17,170 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 10:56:17,170 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 147.66666666666666) internal successors, (443), 3 states have internal predecessors, (443), 0 states have call successors, (0), 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 1208
[2025-03-03 10:56:17,171 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 10:56:17,183 INFO  L225             Difference]: With dead ends: 26984
[2025-03-03 10:56:17,183 INFO  L226             Difference]: Without dead ends: 13493
[2025-03-03 10:56:17,191 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 10:56:17,192 INFO  L435           NwaCegarLoop]: 405 mSDtfsCounter, 172 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-03 10:56:17,192 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 410 Invalid, 805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 756 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-03 10:56:17,200 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 13493 states.
[2025-03-03 10:56:17,271 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 13493 to 13493.
[2025-03-03 10:56:17,281 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 13493 states, 13492 states have (on average 1.036466053957901) internal successors, (13984), 13492 states have internal predecessors, (13984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:56:17,292 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 13493 states to 13493 states and 13984 transitions.
[2025-03-03 10:56:17,292 INFO  L78                 Accepts]: Start accepts. Automaton has 13493 states and 13984 transitions. Word has length 1208
[2025-03-03 10:56:17,293 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 10:56:17,294 INFO  L471      AbstractCegarLoop]: Abstraction has 13493 states and 13984 transitions.
[2025-03-03 10:56:17,294 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 147.66666666666666) internal successors, (443), 3 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:56:17,294 INFO  L276                IsEmpty]: Start isEmpty. Operand 13493 states and 13984 transitions.
[2025-03-03 10:56:17,310 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1341
[2025-03-03 10:56:17,311 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 10:56:17,311 INFO  L218           NwaCegarLoop]: trace histogram [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, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 10:56:17,311 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2025-03-03 10:56:17,311 INFO  L396      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 10:56:17,312 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 10:56:17,312 INFO  L85        PathProgramCache]: Analyzing trace with hash -1917205285, now seen corresponding path program 1 times
[2025-03-03 10:56:17,312 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 10:56:17,312 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44892785]
[2025-03-03 10:56:17,312 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:56:17,312 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 10:56:17,371 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1340 statements into 1 equivalence classes.
[2025-03-03 10:56:17,446 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1340 of 1340 statements.
[2025-03-03 10:56:17,446 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:56:17,446 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:56:17,850 INFO  L134       CoverageAnalysis]: Checked inductivity of 3662 backedges. 2452 proven. 0 refuted. 0 times theorem prover too weak. 1210 trivial. 0 not checked.
[2025-03-03 10:56:17,850 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 10:56:17,850 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44892785]
[2025-03-03 10:56:17,851 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44892785] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 10:56:17,851 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 10:56:17,851 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 10:56:17,851 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887732560]
[2025-03-03 10:56:17,851 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 10:56:17,852 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 10:56:17,852 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 10:56:17,852 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 10:56:17,852 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 10:56:17,853 INFO  L87              Difference]: Start difference. First operand 13493 states and 13984 transitions. Second operand  has 3 states, 3 states have (on average 201.66666666666666) internal successors, (605), 3 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:56:18,512 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 10:56:18,512 INFO  L93              Difference]: Finished difference Result 27313 states and 28328 transitions.
[2025-03-03 10:56:18,513 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 10:56:18,513 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 201.66666666666666) internal successors, (605), 3 states have internal predecessors, (605), 0 states have call successors, (0), 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 1340
[2025-03-03 10:56:18,514 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 10:56:18,528 INFO  L225             Difference]: With dead ends: 27313
[2025-03-03 10:56:18,529 INFO  L226             Difference]: Without dead ends: 14480
[2025-03-03 10:56:18,539 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 10:56:18,540 INFO  L435           NwaCegarLoop]: 414 mSDtfsCounter, 195 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 752 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 819 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-03 10:56:18,540 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 419 Invalid, 819 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 752 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-03 10:56:18,549 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 14480 states.
[2025-03-03 10:56:18,682 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 14480 to 14151.
[2025-03-03 10:56:18,694 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 14151 states, 14150 states have (on average 1.030600706713781) internal successors, (14583), 14150 states have internal predecessors, (14583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:56:18,711 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 14151 states to 14151 states and 14583 transitions.
[2025-03-03 10:56:18,712 INFO  L78                 Accepts]: Start accepts. Automaton has 14151 states and 14583 transitions. Word has length 1340
[2025-03-03 10:56:18,713 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 10:56:18,713 INFO  L471      AbstractCegarLoop]: Abstraction has 14151 states and 14583 transitions.
[2025-03-03 10:56:18,713 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 201.66666666666666) internal successors, (605), 3 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:56:18,713 INFO  L276                IsEmpty]: Start isEmpty. Operand 14151 states and 14583 transitions.
[2025-03-03 10:56:18,744 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1351
[2025-03-03 10:56:18,744 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 10:56:18,745 INFO  L218           NwaCegarLoop]: trace histogram [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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 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]
[2025-03-03 10:56:18,745 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2025-03-03 10:56:18,745 INFO  L396      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 10:56:18,746 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 10:56:18,746 INFO  L85        PathProgramCache]: Analyzing trace with hash -1713814331, now seen corresponding path program 1 times
[2025-03-03 10:56:18,746 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 10:56:18,746 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320680584]
[2025-03-03 10:56:18,746 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:56:18,746 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 10:56:18,815 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1350 statements into 1 equivalence classes.
[2025-03-03 10:56:18,848 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1350 of 1350 statements.
[2025-03-03 10:56:18,848 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:56:18,848 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:56:19,936 INFO  L134       CoverageAnalysis]: Checked inductivity of 3085 backedges. 2255 proven. 0 refuted. 0 times theorem prover too weak. 830 trivial. 0 not checked.
[2025-03-03 10:56:19,937 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 10:56:19,937 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320680584]
[2025-03-03 10:56:19,937 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320680584] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 10:56:19,937 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 10:56:19,937 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-03 10:56:19,937 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954492490]
[2025-03-03 10:56:19,937 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 10:56:19,938 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-03 10:56:19,938 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 10:56:19,939 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-03 10:56:19,939 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-03 10:56:19,939 INFO  L87              Difference]: Start difference. First operand 14151 states and 14583 transitions. Second operand  has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:56:20,697 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 10:56:20,697 INFO  L93              Difference]: Finished difference Result 27652 states and 28510 transitions.
[2025-03-03 10:56:20,698 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-03 10:56:20,698 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 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 1350
[2025-03-03 10:56:20,699 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 10:56:20,712 INFO  L225             Difference]: With dead ends: 27652
[2025-03-03 10:56:20,712 INFO  L226             Difference]: Without dead ends: 14161
[2025-03-03 10:56:20,722 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-03-03 10:56:20,723 INFO  L435           NwaCegarLoop]: 424 mSDtfsCounter, 217 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 1319 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 1342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-03-03 10:56:20,723 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 438 Invalid, 1342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1319 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-03-03 10:56:20,733 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 14161 states.
[2025-03-03 10:56:20,815 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 14161 to 13822.
[2025-03-03 10:56:20,826 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 13822 states, 13821 states have (on average 1.030677953838362) internal successors, (14245), 13821 states have internal predecessors, (14245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:56:20,837 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 13822 states to 13822 states and 14245 transitions.
[2025-03-03 10:56:20,838 INFO  L78                 Accepts]: Start accepts. Automaton has 13822 states and 14245 transitions. Word has length 1350
[2025-03-03 10:56:20,839 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 10:56:20,839 INFO  L471      AbstractCegarLoop]: Abstraction has 13822 states and 14245 transitions.
[2025-03-03 10:56:20,839 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:56:20,839 INFO  L276                IsEmpty]: Start isEmpty. Operand 13822 states and 14245 transitions.
[2025-03-03 10:56:20,856 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1366
[2025-03-03 10:56:20,856 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 10:56:20,856 INFO  L218           NwaCegarLoop]: trace histogram [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, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 10:56:20,856 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2025-03-03 10:56:20,856 INFO  L396      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 10:56:20,857 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 10:56:20,857 INFO  L85        PathProgramCache]: Analyzing trace with hash 161923622, now seen corresponding path program 1 times
[2025-03-03 10:56:20,857 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 10:56:20,857 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839361460]
[2025-03-03 10:56:20,857 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:56:20,857 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 10:56:20,920 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1365 statements into 1 equivalence classes.
[2025-03-03 10:56:20,952 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1365 of 1365 statements.
[2025-03-03 10:56:20,952 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:56:20,952 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:56:21,957 INFO  L134       CoverageAnalysis]: Checked inductivity of 3837 backedges. 2333 proven. 0 refuted. 0 times theorem prover too weak. 1504 trivial. 0 not checked.
[2025-03-03 10:56:21,957 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 10:56:21,957 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839361460]
[2025-03-03 10:56:21,957 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839361460] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 10:56:21,957 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 10:56:21,958 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 10:56:21,958 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202987332]
[2025-03-03 10:56:21,958 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 10:56:21,959 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 10:56:21,959 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 10:56:21,959 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 10:56:21,959 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 10:56:21,960 INFO  L87              Difference]: Start difference. First operand 13822 states and 14245 transitions. Second operand  has 3 states, 3 states have (on average 190.33333333333334) internal successors, (571), 3 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:56:22,647 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 10:56:22,647 INFO  L93              Difference]: Finished difference Result 27642 states and 28507 transitions.
[2025-03-03 10:56:22,647 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 10:56:22,647 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 190.33333333333334) internal successors, (571), 3 states have internal predecessors, (571), 0 states have call successors, (0), 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 1365
[2025-03-03 10:56:22,648 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 10:56:22,664 INFO  L225             Difference]: With dead ends: 27642
[2025-03-03 10:56:22,664 INFO  L226             Difference]: Without dead ends: 14480
[2025-03-03 10:56:22,674 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 10:56:22,675 INFO  L435           NwaCegarLoop]: 426 mSDtfsCounter, 224 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 749 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 782 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 749 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-03 10:56:22,675 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 432 Invalid, 782 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 749 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-03 10:56:22,684 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 14480 states.
[2025-03-03 10:56:22,778 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 14480 to 14480.
[2025-03-03 10:56:22,786 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 14480 states, 14479 states have (on average 1.028731265971407) internal successors, (14895), 14479 states have internal predecessors, (14895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:56:22,798 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 14480 states to 14480 states and 14895 transitions.
[2025-03-03 10:56:22,798 INFO  L78                 Accepts]: Start accepts. Automaton has 14480 states and 14895 transitions. Word has length 1365
[2025-03-03 10:56:22,799 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 10:56:22,799 INFO  L471      AbstractCegarLoop]: Abstraction has 14480 states and 14895 transitions.
[2025-03-03 10:56:22,799 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 190.33333333333334) internal successors, (571), 3 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:56:22,799 INFO  L276                IsEmpty]: Start isEmpty. Operand 14480 states and 14895 transitions.
[2025-03-03 10:56:22,813 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1391
[2025-03-03 10:56:22,813 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 10:56:22,814 INFO  L218           NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 10:56:22,814 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2025-03-03 10:56:22,814 INFO  L396      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 10:56:22,815 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 10:56:22,815 INFO  L85        PathProgramCache]: Analyzing trace with hash 1564385203, now seen corresponding path program 1 times
[2025-03-03 10:56:22,815 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 10:56:22,815 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529373827]
[2025-03-03 10:56:22,815 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:56:22,815 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 10:56:22,880 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1390 statements into 1 equivalence classes.
[2025-03-03 10:56:22,913 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1390 of 1390 statements.
[2025-03-03 10:56:22,914 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:56:22,914 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:56:23,708 INFO  L134       CoverageAnalysis]: Checked inductivity of 3413 backedges. 2413 proven. 0 refuted. 0 times theorem prover too weak. 1000 trivial. 0 not checked.
[2025-03-03 10:56:23,708 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 10:56:23,708 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529373827]
[2025-03-03 10:56:23,708 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529373827] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 10:56:23,708 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 10:56:23,709 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-03 10:56:23,709 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509502288]
[2025-03-03 10:56:23,709 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 10:56:23,709 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-03 10:56:23,709 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 10:56:23,710 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-03 10:56:23,710 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-03 10:56:23,710 INFO  L87              Difference]: Start difference. First operand 14480 states and 14895 transitions. Second operand  has 4 states, 4 states have (on average 183.25) internal successors, (733), 4 states have internal predecessors, (733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:56:24,434 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 10:56:24,434 INFO  L93              Difference]: Finished difference Result 28300 states and 29124 transitions.
[2025-03-03 10:56:24,434 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 10:56:24,434 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 183.25) internal successors, (733), 4 states have internal predecessors, (733), 0 states have call successors, (0), 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 1390
[2025-03-03 10:56:24,435 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 10:56:24,446 INFO  L225             Difference]: With dead ends: 28300
[2025-03-03 10:56:24,447 INFO  L226             Difference]: Without dead ends: 14480
[2025-03-03 10:56:24,454 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-03-03 10:56:24,454 INFO  L435           NwaCegarLoop]: 426 mSDtfsCounter, 120 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 1312 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 1321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-03-03 10:56:24,454 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 555 Invalid, 1321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1312 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-03-03 10:56:24,462 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 14480 states.
[2025-03-03 10:56:24,576 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 14480 to 14480.
[2025-03-03 10:56:24,583 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 14480 states, 14479 states have (on average 1.028040610539402) internal successors, (14885), 14479 states have internal predecessors, (14885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:56:24,593 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 14480 states to 14480 states and 14885 transitions.
[2025-03-03 10:56:24,593 INFO  L78                 Accepts]: Start accepts. Automaton has 14480 states and 14885 transitions. Word has length 1390
[2025-03-03 10:56:24,594 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 10:56:24,594 INFO  L471      AbstractCegarLoop]: Abstraction has 14480 states and 14885 transitions.
[2025-03-03 10:56:24,594 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 183.25) internal successors, (733), 4 states have internal predecessors, (733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:56:24,594 INFO  L276                IsEmpty]: Start isEmpty. Operand 14480 states and 14885 transitions.
[2025-03-03 10:56:24,608 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1420
[2025-03-03 10:56:24,608 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 10:56:24,609 INFO  L218           NwaCegarLoop]: trace histogram [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, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 10:56:24,609 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2025-03-03 10:56:24,609 INFO  L396      AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 10:56:24,609 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 10:56:24,610 INFO  L85        PathProgramCache]: Analyzing trace with hash -447552387, now seen corresponding path program 1 times
[2025-03-03 10:56:24,610 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 10:56:24,610 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630571143]
[2025-03-03 10:56:24,610 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:56:24,610 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 10:56:24,669 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1419 statements into 1 equivalence classes.
[2025-03-03 10:56:24,710 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1419 of 1419 statements.
[2025-03-03 10:56:24,710 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:56:24,710 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:56:25,173 INFO  L134       CoverageAnalysis]: Checked inductivity of 3837 backedges. 1109 proven. 0 refuted. 0 times theorem prover too weak. 2728 trivial. 0 not checked.
[2025-03-03 10:56:25,173 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 10:56:25,173 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630571143]
[2025-03-03 10:56:25,173 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630571143] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 10:56:25,173 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 10:56:25,173 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 10:56:25,173 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951045817]
[2025-03-03 10:56:25,173 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 10:56:25,174 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 10:56:25,174 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 10:56:25,174 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 10:56:25,174 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 10:56:25,175 INFO  L87              Difference]: Start difference. First operand 14480 states and 14885 transitions. Second operand  has 3 states, 3 states have (on average 148.0) internal successors, (444), 3 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:56:25,774 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 10:56:25,774 INFO  L93              Difference]: Finished difference Result 28629 states and 29437 transitions.
[2025-03-03 10:56:25,774 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 10:56:25,775 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 148.0) internal successors, (444), 3 states have internal predecessors, (444), 0 states have call successors, (0), 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 1419
[2025-03-03 10:56:25,775 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 10:56:25,786 INFO  L225             Difference]: With dead ends: 28629
[2025-03-03 10:56:25,786 INFO  L226             Difference]: Without dead ends: 14480
[2025-03-03 10:56:25,790 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 10:56:25,791 INFO  L435           NwaCegarLoop]: 407 mSDtfsCounter, 163 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 757 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-03 10:56:25,791 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 413 Invalid, 811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 757 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-03 10:56:25,799 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 14480 states.
[2025-03-03 10:56:25,862 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 14480 to 14151.
[2025-03-03 10:56:25,869 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 14151 states, 14150 states have (on average 1.0225441696113073) internal successors, (14469), 14150 states have internal predecessors, (14469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:56:25,880 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 14151 states to 14151 states and 14469 transitions.
[2025-03-03 10:56:25,880 INFO  L78                 Accepts]: Start accepts. Automaton has 14151 states and 14469 transitions. Word has length 1419
[2025-03-03 10:56:25,881 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 10:56:25,881 INFO  L471      AbstractCegarLoop]: Abstraction has 14151 states and 14469 transitions.
[2025-03-03 10:56:25,881 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 148.0) internal successors, (444), 3 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:56:25,881 INFO  L276                IsEmpty]: Start isEmpty. Operand 14151 states and 14469 transitions.
[2025-03-03 10:56:25,898 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1658
[2025-03-03 10:56:25,899 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 10:56:25,899 INFO  L218           NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 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, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 10:56:25,899 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2025-03-03 10:56:25,899 INFO  L396      AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 10:56:25,900 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 10:56:25,900 INFO  L85        PathProgramCache]: Analyzing trace with hash 1687610188, now seen corresponding path program 1 times
[2025-03-03 10:56:25,900 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 10:56:25,900 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643114272]
[2025-03-03 10:56:25,900 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:56:25,901 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 10:56:25,971 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1657 statements into 1 equivalence classes.
[2025-03-03 10:56:26,017 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1657 of 1657 statements.
[2025-03-03 10:56:26,017 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:56:26,017 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:56:26,631 INFO  L134       CoverageAnalysis]: Checked inductivity of 5203 backedges. 2878 proven. 0 refuted. 0 times theorem prover too weak. 2325 trivial. 0 not checked.
[2025-03-03 10:56:26,631 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 10:56:26,631 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643114272]
[2025-03-03 10:56:26,631 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643114272] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 10:56:26,631 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 10:56:26,632 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 10:56:26,632 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429995285]
[2025-03-03 10:56:26,632 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 10:56:26,632 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 10:56:26,632 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 10:56:26,633 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 10:56:26,633 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 10:56:26,634 INFO  L87              Difference]: Start difference. First operand 14151 states and 14469 transitions. Second operand  has 3 states, 3 states have (on average 168.0) internal successors, (504), 3 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:56:27,279 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 10:56:27,279 INFO  L93              Difference]: Finished difference Result 27971 states and 28605 transitions.
[2025-03-03 10:56:27,279 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 10:56:27,279 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 168.0) internal successors, (504), 3 states have internal predecessors, (504), 0 states have call successors, (0), 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 1657
[2025-03-03 10:56:27,281 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 10:56:27,292 INFO  L225             Difference]: With dead ends: 27971
[2025-03-03 10:56:27,292 INFO  L226             Difference]: Without dead ends: 14151
[2025-03-03 10:56:27,298 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 10:56:27,299 INFO  L435           NwaCegarLoop]: 371 mSDtfsCounter, 112 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 758 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-03 10:56:27,299 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 377 Invalid, 772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 758 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-03 10:56:27,306 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 14151 states.
[2025-03-03 10:56:27,421 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 14151 to 14151.
[2025-03-03 10:56:27,430 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 14151 states, 14150 states have (on average 1.0214134275618374) internal successors, (14453), 14150 states have internal predecessors, (14453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:56:27,446 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 14151 states to 14151 states and 14453 transitions.
[2025-03-03 10:56:27,447 INFO  L78                 Accepts]: Start accepts. Automaton has 14151 states and 14453 transitions. Word has length 1657
[2025-03-03 10:56:27,448 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 10:56:27,448 INFO  L471      AbstractCegarLoop]: Abstraction has 14151 states and 14453 transitions.
[2025-03-03 10:56:27,448 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 168.0) internal successors, (504), 3 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:56:27,448 INFO  L276                IsEmpty]: Start isEmpty. Operand 14151 states and 14453 transitions.
[2025-03-03 10:56:27,485 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1748
[2025-03-03 10:56:27,486 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 10:56:27,486 INFO  L218           NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 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, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 10:56:27,486 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2025-03-03 10:56:27,486 INFO  L396      AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 10:56:27,487 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 10:56:27,487 INFO  L85        PathProgramCache]: Analyzing trace with hash 303585405, now seen corresponding path program 1 times
[2025-03-03 10:56:27,487 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 10:56:27,487 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035654211]
[2025-03-03 10:56:27,487 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:56:27,488 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 10:56:27,567 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1747 statements into 1 equivalence classes.
[2025-03-03 10:56:27,631 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1747 of 1747 statements.
[2025-03-03 10:56:27,631 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:56:27,631 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:56:29,189 INFO  L134       CoverageAnalysis]: Checked inductivity of 5253 backedges. 4059 proven. 111 refuted. 0 times theorem prover too weak. 1083 trivial. 0 not checked.
[2025-03-03 10:56:29,189 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 10:56:29,189 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035654211]
[2025-03-03 10:56:29,190 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035654211] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 10:56:29,190 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [877806527]
[2025-03-03 10:56:29,190 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:56:29,190 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 10:56:29,190 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 10:56:29,192 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-03 10:56:29,193 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2025-03-03 10:56:29,304 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1747 statements into 1 equivalence classes.
[2025-03-03 10:56:29,507 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1747 of 1747 statements.
[2025-03-03 10:56:29,507 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:56:29,507 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:56:29,512 INFO  L256         TraceCheckSpWp]: Trace formula consists of 2007 conjuncts, 7 conjuncts are in the unsatisfiable core
[2025-03-03 10:56:29,527 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 10:56:31,646 INFO  L134       CoverageAnalysis]: Checked inductivity of 5253 backedges. 2334 proven. 201 refuted. 0 times theorem prover too weak. 2718 trivial. 0 not checked.
[2025-03-03 10:56:31,646 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-03 10:56:34,836 INFO  L134       CoverageAnalysis]: Checked inductivity of 5253 backedges. 2334 proven. 201 refuted. 0 times theorem prover too weak. 2718 trivial. 0 not checked.
[2025-03-03 10:56:34,836 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [877806527] provided 0 perfect and 2 imperfect interpolant sequences
[2025-03-03 10:56:34,836 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-03-03 10:56:34,836 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 3, 3] total 11
[2025-03-03 10:56:34,837 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437686566]
[2025-03-03 10:56:34,837 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-03-03 10:56:34,838 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2025-03-03 10:56:34,838 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 10:56:34,840 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2025-03-03 10:56:34,840 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110
[2025-03-03 10:56:34,840 INFO  L87              Difference]: Start difference. First operand 14151 states and 14453 transitions. Second operand  has 11 states, 11 states have (on average 202.8181818181818) internal successors, (2231), 11 states have internal predecessors, (2231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:56:38,718 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 10:56:38,718 INFO  L93              Difference]: Finished difference Result 28959 states and 29584 transitions.
[2025-03-03 10:56:38,721 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2025-03-03 10:56:38,722 INFO  L78                 Accepts]: Start accepts. Automaton has  has 11 states, 11 states have (on average 202.8181818181818) internal successors, (2231), 11 states have internal predecessors, (2231), 0 states have call successors, (0), 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 1747
[2025-03-03 10:56:38,722 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 10:56:38,733 INFO  L225             Difference]: With dead ends: 28959
[2025-03-03 10:56:38,733 INFO  L226             Difference]: Without dead ends: 15139
[2025-03-03 10:56:38,739 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3507 GetRequests, 3494 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210
[2025-03-03 10:56:38,741 INFO  L435           NwaCegarLoop]: 21 mSDtfsCounter, 1098 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 8809 mSolverCounterSat, 190 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1098 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 8999 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 190 IncrementalHoareTripleChecker+Valid, 8809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time
[2025-03-03 10:56:38,744 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1098 Valid, 104 Invalid, 8999 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [190 Valid, 8809 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time]
[2025-03-03 10:56:38,751 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 15139 states.
[2025-03-03 10:56:38,860 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 15139 to 14809.
[2025-03-03 10:56:38,868 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 14809 states, 14808 states have (on average 1.0185710426796326) internal successors, (15083), 14808 states have internal predecessors, (15083), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:56:38,878 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 14809 states to 14809 states and 15083 transitions.
[2025-03-03 10:56:38,879 INFO  L78                 Accepts]: Start accepts. Automaton has 14809 states and 15083 transitions. Word has length 1747
[2025-03-03 10:56:38,879 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 10:56:38,879 INFO  L471      AbstractCegarLoop]: Abstraction has 14809 states and 15083 transitions.
[2025-03-03 10:56:38,880 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 202.8181818181818) internal successors, (2231), 11 states have internal predecessors, (2231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:56:38,880 INFO  L276                IsEmpty]: Start isEmpty. Operand 14809 states and 15083 transitions.
[2025-03-03 10:56:38,904 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 2033
[2025-03-03 10:56:38,904 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 10:56:38,904 INFO  L218           NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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]
[2025-03-03 10:56:38,912 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0
[2025-03-03 10:56:39,105 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-03 10:56:39,105 INFO  L396      AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 10:56:39,106 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 10:56:39,106 INFO  L85        PathProgramCache]: Analyzing trace with hash 1167713922, now seen corresponding path program 1 times
[2025-03-03 10:56:39,106 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 10:56:39,106 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428364428]
[2025-03-03 10:56:39,106 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:56:39,106 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 10:56:39,194 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2032 statements into 1 equivalence classes.
[2025-03-03 10:56:39,291 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2032 of 2032 statements.
[2025-03-03 10:56:39,291 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:56:39,291 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:56:42,261 INFO  L134       CoverageAnalysis]: Checked inductivity of 7914 backedges. 5739 proven. 726 refuted. 0 times theorem prover too weak. 1449 trivial. 0 not checked.
[2025-03-03 10:56:42,261 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 10:56:42,261 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428364428]
[2025-03-03 10:56:42,261 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428364428] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 10:56:42,261 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [888032037]
[2025-03-03 10:56:42,261 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:56:42,261 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 10:56:42,261 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 10:56:42,263 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-03 10:56:42,264 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-03 10:56:42,399 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2032 statements into 1 equivalence classes.
[2025-03-03 10:56:42,619 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2032 of 2032 statements.
[2025-03-03 10:56:42,620 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:56:42,620 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:56:42,626 INFO  L256         TraceCheckSpWp]: Trace formula consists of 2330 conjuncts, 3 conjuncts are in the unsatisfiable core
[2025-03-03 10:56:42,639 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 10:56:42,997 INFO  L134       CoverageAnalysis]: Checked inductivity of 7914 backedges. 4874 proven. 0 refuted. 0 times theorem prover too weak. 3040 trivial. 0 not checked.
[2025-03-03 10:56:42,997 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-03 10:56:42,997 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [888032037] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 10:56:42,997 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-03 10:56:42,998 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7
[2025-03-03 10:56:42,998 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681408268]
[2025-03-03 10:56:42,998 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 10:56:42,998 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 10:56:42,999 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 10:56:42,999 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 10:56:42,999 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2025-03-03 10:56:42,999 INFO  L87              Difference]: Start difference. First operand 14809 states and 15083 transitions. Second operand  has 3 states, 3 states have (on average 250.33333333333334) internal successors, (751), 3 states have internal predecessors, (751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:56:43,577 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 10:56:43,577 INFO  L93              Difference]: Finished difference Result 29287 states and 29833 transitions.
[2025-03-03 10:56:43,577 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 10:56:43,577 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 250.33333333333334) internal successors, (751), 3 states have internal predecessors, (751), 0 states have call successors, (0), 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 2032
[2025-03-03 10:56:43,578 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 10:56:43,588 INFO  L225             Difference]: With dead ends: 29287
[2025-03-03 10:56:43,588 INFO  L226             Difference]: Without dead ends: 14809
[2025-03-03 10:56:43,596 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2040 GetRequests, 2035 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2025-03-03 10:56:43,596 INFO  L435           NwaCegarLoop]: 420 mSDtfsCounter, 120 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 744 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-03 10:56:43,596 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 426 Invalid, 755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 744 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-03 10:56:43,602 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 14809 states.
[2025-03-03 10:56:43,668 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 14809 to 14809.
[2025-03-03 10:56:43,676 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 14809 states, 14808 states have (on average 1.018030794165316) internal successors, (15075), 14808 states have internal predecessors, (15075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:56:43,686 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 14809 states to 14809 states and 15075 transitions.
[2025-03-03 10:56:43,686 INFO  L78                 Accepts]: Start accepts. Automaton has 14809 states and 15075 transitions. Word has length 2032
[2025-03-03 10:56:43,687 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 10:56:43,687 INFO  L471      AbstractCegarLoop]: Abstraction has 14809 states and 15075 transitions.
[2025-03-03 10:56:43,687 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 250.33333333333334) internal successors, (751), 3 states have internal predecessors, (751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:56:43,687 INFO  L276                IsEmpty]: Start isEmpty. Operand 14809 states and 15075 transitions.
[2025-03-03 10:56:43,739 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 2054
[2025-03-03 10:56:43,739 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 10:56:43,739 INFO  L218           NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 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, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 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, 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]
[2025-03-03 10:56:43,747 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0
[2025-03-03 10:56:43,940 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22
[2025-03-03 10:56:43,940 INFO  L396      AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 10:56:43,941 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 10:56:43,941 INFO  L85        PathProgramCache]: Analyzing trace with hash -455147169, now seen corresponding path program 1 times
[2025-03-03 10:56:43,941 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 10:56:43,941 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109128882]
[2025-03-03 10:56:43,941 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:56:43,941 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 10:56:44,023 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2053 statements into 1 equivalence classes.
[2025-03-03 10:56:44,079 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2053 of 2053 statements.
[2025-03-03 10:56:44,079 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:56:44,079 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:56:47,507 INFO  L134       CoverageAnalysis]: Checked inductivity of 7731 backedges. 2509 proven. 3969 refuted. 0 times theorem prover too weak. 1253 trivial. 0 not checked.
[2025-03-03 10:56:47,508 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 10:56:47,508 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109128882]
[2025-03-03 10:56:47,508 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109128882] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 10:56:47,508 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1488654589]
[2025-03-03 10:56:47,508 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:56:47,508 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 10:56:47,508 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 10:56:47,510 INFO  L229       MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-03 10:56:47,510 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process
[2025-03-03 10:56:47,647 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2053 statements into 1 equivalence classes.
[2025-03-03 10:56:47,877 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2053 of 2053 statements.
[2025-03-03 10:56:47,877 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:56:47,877 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:56:47,885 INFO  L256         TraceCheckSpWp]: Trace formula consists of 2345 conjuncts, 3 conjuncts are in the unsatisfiable core
[2025-03-03 10:56:47,898 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 10:56:48,013 INFO  L134       CoverageAnalysis]: Checked inductivity of 7731 backedges. 4471 proven. 0 refuted. 0 times theorem prover too weak. 3260 trivial. 0 not checked.
[2025-03-03 10:56:48,014 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-03 10:56:48,014 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1488654589] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 10:56:48,014 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-03 10:56:48,014 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9
[2025-03-03 10:56:48,014 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749773173]
[2025-03-03 10:56:48,014 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 10:56:48,016 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 10:56:48,016 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 10:56:48,017 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 10:56:48,017 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2025-03-03 10:56:48,017 INFO  L87              Difference]: Start difference. First operand 14809 states and 15075 transitions. Second operand  has 3 states, 3 states have (on average 213.33333333333334) internal successors, (640), 3 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:56:48,645 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 10:56:48,646 INFO  L93              Difference]: Finished difference Result 32577 states and 33154 transitions.
[2025-03-03 10:56:48,646 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 10:56:48,646 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 213.33333333333334) internal successors, (640), 3 states have internal predecessors, (640), 0 states have call successors, (0), 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 2053
[2025-03-03 10:56:48,646 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 10:56:48,662 INFO  L225             Difference]: With dead ends: 32577
[2025-03-03 10:56:48,662 INFO  L226             Difference]: Without dead ends: 17770
[2025-03-03 10:56:48,672 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2061 GetRequests, 2054 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2025-03-03 10:56:48,672 INFO  L435           NwaCegarLoop]: 418 mSDtfsCounter, 221 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 775 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 814 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 775 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-03 10:56:48,672 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 424 Invalid, 814 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 775 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-03 10:56:48,682 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 17770 states.
[2025-03-03 10:56:48,775 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 17770 to 17441.
[2025-03-03 10:56:48,786 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 17441 states, 17440 states have (on average 1.0162844036697247) internal successors, (17724), 17440 states have internal predecessors, (17724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:56:48,799 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 17441 states to 17441 states and 17724 transitions.
[2025-03-03 10:56:48,800 INFO  L78                 Accepts]: Start accepts. Automaton has 17441 states and 17724 transitions. Word has length 2053
[2025-03-03 10:56:48,801 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 10:56:48,801 INFO  L471      AbstractCegarLoop]: Abstraction has 17441 states and 17724 transitions.
[2025-03-03 10:56:48,801 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 213.33333333333334) internal successors, (640), 3 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:56:48,801 INFO  L276                IsEmpty]: Start isEmpty. Operand 17441 states and 17724 transitions.
[2025-03-03 10:56:48,825 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 2135
[2025-03-03 10:56:48,825 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 10:56:48,826 INFO  L218           NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 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, 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, 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, 2, 2, 2, 2, 2, 2, 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]
[2025-03-03 10:56:48,834 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0
[2025-03-03 10:56:49,026 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 10:56:49,027 INFO  L396      AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 10:56:49,027 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 10:56:49,027 INFO  L85        PathProgramCache]: Analyzing trace with hash 464350265, now seen corresponding path program 1 times
[2025-03-03 10:56:49,027 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 10:56:49,027 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459386479]
[2025-03-03 10:56:49,028 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:56:49,028 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 10:56:49,120 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2134 statements into 1 equivalence classes.
[2025-03-03 10:56:49,186 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2134 of 2134 statements.
[2025-03-03 10:56:49,186 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:56:49,186 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:56:54,313 INFO  L134       CoverageAnalysis]: Checked inductivity of 8486 backedges. 3920 proven. 1608 refuted. 0 times theorem prover too weak. 2958 trivial. 0 not checked.
[2025-03-03 10:56:54,313 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 10:56:54,313 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459386479]
[2025-03-03 10:56:54,314 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459386479] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 10:56:54,314 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1892213472]
[2025-03-03 10:56:54,314 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:56:54,314 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 10:56:54,314 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 10:56:54,317 INFO  L229       MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-03 10:56:54,318 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process
[2025-03-03 10:56:54,450 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2134 statements into 1 equivalence classes.
[2025-03-03 10:56:54,671 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2134 of 2134 statements.
[2025-03-03 10:56:54,672 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:56:54,672 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:56:54,679 INFO  L256         TraceCheckSpWp]: Trace formula consists of 2431 conjuncts, 5 conjuncts are in the unsatisfiable core
[2025-03-03 10:56:54,690 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 10:56:55,423 INFO  L134       CoverageAnalysis]: Checked inductivity of 8486 backedges. 5386 proven. 250 refuted. 0 times theorem prover too weak. 2850 trivial. 0 not checked.
[2025-03-03 10:56:55,423 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-03 10:56:56,573 INFO  L134       CoverageAnalysis]: Checked inductivity of 8486 backedges. 4496 proven. 0 refuted. 0 times theorem prover too weak. 3990 trivial. 0 not checked.
[2025-03-03 10:56:56,573 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1892213472] provided 1 perfect and 1 imperfect interpolant sequences
[2025-03-03 10:56:56,573 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences.
[2025-03-03 10:56:56,574 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9, 4] total 13
[2025-03-03 10:56:56,574 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599030697]
[2025-03-03 10:56:56,574 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 10:56:56,574 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 10:56:56,575 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 10:56:56,575 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 10:56:56,575 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156
[2025-03-03 10:56:56,575 INFO  L87              Difference]: Start difference. First operand 17441 states and 17724 transitions. Second operand  has 3 states, 3 states have (on average 274.6666666666667) internal successors, (824), 3 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:56:57,219 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 10:56:57,219 INFO  L93              Difference]: Finished difference Result 35867 states and 36466 transitions.
[2025-03-03 10:56:57,219 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 10:56:57,220 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 274.6666666666667) internal successors, (824), 3 states have internal predecessors, (824), 0 states have call successors, (0), 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 2134
[2025-03-03 10:56:57,220 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 10:56:57,237 INFO  L225             Difference]: With dead ends: 35867
[2025-03-03 10:56:57,238 INFO  L226             Difference]: Without dead ends: 18757
[2025-03-03 10:56:57,248 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 4277 GetRequests, 4266 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156
[2025-03-03 10:56:57,248 INFO  L435           NwaCegarLoop]: 14 mSDtfsCounter, 86 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 745 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-03 10:56:57,249 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 18 Invalid, 840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 745 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-03 10:56:57,260 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 18757 states.
[2025-03-03 10:56:57,366 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 18757 to 18757.
[2025-03-03 10:56:57,377 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 18757 states, 18756 states have (on average 1.0164747280870121) internal successors, (19065), 18756 states have internal predecessors, (19065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:56:57,392 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 18757 states to 18757 states and 19065 transitions.
[2025-03-03 10:56:57,393 INFO  L78                 Accepts]: Start accepts. Automaton has 18757 states and 19065 transitions. Word has length 2134
[2025-03-03 10:56:57,394 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 10:56:57,394 INFO  L471      AbstractCegarLoop]: Abstraction has 18757 states and 19065 transitions.
[2025-03-03 10:56:57,394 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 274.6666666666667) internal successors, (824), 3 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:56:57,394 INFO  L276                IsEmpty]: Start isEmpty. Operand 18757 states and 19065 transitions.
[2025-03-03 10:56:57,455 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 2147
[2025-03-03 10:56:57,456 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 10:56:57,457 INFO  L218           NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 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, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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]
[2025-03-03 10:56:57,465 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0
[2025-03-03 10:56:57,657 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 10:56:57,657 INFO  L396      AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 10:56:57,659 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 10:56:57,659 INFO  L85        PathProgramCache]: Analyzing trace with hash 8166594, now seen corresponding path program 1 times
[2025-03-03 10:56:57,659 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 10:56:57,659 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723330185]
[2025-03-03 10:56:57,659 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:56:57,659 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 10:56:57,752 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2146 statements into 1 equivalence classes.
[2025-03-03 10:56:57,814 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2146 of 2146 statements.
[2025-03-03 10:56:57,814 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:56:57,814 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:57:01,612 INFO  L134       CoverageAnalysis]: Checked inductivity of 8393 backedges. 4077 proven. 585 refuted. 0 times theorem prover too weak. 3731 trivial. 0 not checked.
[2025-03-03 10:57:01,613 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 10:57:01,613 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723330185]
[2025-03-03 10:57:01,613 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723330185] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 10:57:01,613 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1930833339]
[2025-03-03 10:57:01,613 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:57:01,613 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 10:57:01,614 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 10:57:01,616 INFO  L229       MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-03 10:57:01,618 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process
[2025-03-03 10:57:01,763 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2146 statements into 1 equivalence classes.
[2025-03-03 10:57:02,003 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2146 of 2146 statements.
[2025-03-03 10:57:02,004 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:57:02,004 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:57:02,011 INFO  L256         TraceCheckSpWp]: Trace formula consists of 2438 conjuncts, 5 conjuncts are in the unsatisfiable core
[2025-03-03 10:57:02,022 INFO  L279         TraceCheckSpWp]: Computing forward predicates...