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


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


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

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


Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1133d4e628bca1624f90bda56a6327f24f5efa9815c748be39cd9f3813ed8b8e
[2025-02-05 11:47:49,659 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-02-05 11:47:49,674 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-02-05 11:47:49,675 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-02-05 11:47:49,676 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-02-05 11:47:49,676 INFO  L274        PluginConnector]: CDTParser initialized
[2025-02-05 11:47:49,677 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem14_label00.c
[2025-02-05 11:47:50,943 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e7ba3f7a7/fd1a7eea78e040eea279f4415e30c298/FLAGed56894ee
[2025-02-05 11:47:51,231 INFO  L384              CDTParser]: Found 1 translation units.
[2025-02-05 11:47:51,231 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label00.c
[2025-02-05 11:47:51,242 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e7ba3f7a7/fd1a7eea78e040eea279f4415e30c298/FLAGed56894ee
[2025-02-05 11:47:51,255 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e7ba3f7a7/fd1a7eea78e040eea279f4415e30c298
[2025-02-05 11:47:51,257 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-02-05 11:47:51,259 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-02-05 11:47:51,260 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-02-05 11:47:51,260 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-02-05 11:47:51,263 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-02-05 11:47:51,264 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:47:51" (1/1) ...
[2025-02-05 11:47:51,265 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4259f1f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:47:51, skipping insertion in model container
[2025-02-05 11:47:51,265 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:47:51" (1/1) ...
[2025-02-05 11:47:51,323 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-02-05 11:47:51,563 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label00.c[5469,5482]
[2025-02-05 11:47:51,794 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-05 11:47:51,810 INFO  L200         MainTranslator]: Completed pre-run
[2025-02-05 11:47:51,823 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label00.c[5469,5482]
[2025-02-05 11:47:51,895 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-05 11:47:51,905 INFO  L204         MainTranslator]: Completed translation
[2025-02-05 11:47:51,905 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:47:51 WrapperNode
[2025-02-05 11:47:51,906 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-02-05 11:47:51,907 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-02-05 11:47:51,907 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-02-05 11:47:51,907 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-02-05 11:47:51,911 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:47:51" (1/1) ...
[2025-02-05 11:47:51,926 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:47:51" (1/1) ...
[2025-02-05 11:47:51,966 INFO  L138                Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 856
[2025-02-05 11:47:51,966 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-02-05 11:47:51,967 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-02-05 11:47:51,967 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-02-05 11:47:51,967 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-02-05 11:47:51,973 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:47:51" (1/1) ...
[2025-02-05 11:47:51,974 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:47:51" (1/1) ...
[2025-02-05 11:47:51,979 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:47:51" (1/1) ...
[2025-02-05 11:47:52,012 INFO  L175           MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2025-02-05 11:47:52,013 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:47:51" (1/1) ...
[2025-02-05 11:47:52,013 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:47:51" (1/1) ...
[2025-02-05 11:47:52,037 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:47:51" (1/1) ...
[2025-02-05 11:47:52,043 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:47:51" (1/1) ...
[2025-02-05 11:47:52,047 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:47:51" (1/1) ...
[2025-02-05 11:47:52,051 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:47:51" (1/1) ...
[2025-02-05 11:47:52,057 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-02-05 11:47:52,059 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-02-05 11:47:52,059 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-02-05 11:47:52,060 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-02-05 11:47:52,060 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:47:51" (1/1) ...
[2025-02-05 11:47:52,066 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-02-05 11:47:52,075 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 11:47:52,091 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2025-02-05 11:47:52,100 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2025-02-05 11:47:52,119 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-02-05 11:47:52,119 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-02-05 11:47:52,120 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-02-05 11:47:52,120 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-02-05 11:47:52,170 INFO  L257             CfgBuilder]: Building ICFG
[2025-02-05 11:47:52,171 INFO  L287             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-02-05 11:47:53,128 INFO  L?                        ?]: Removed 123 outVars from TransFormulas that were not future-live.
[2025-02-05 11:47:53,128 INFO  L308             CfgBuilder]: Performing block encoding
[2025-02-05 11:47:53,142 INFO  L332             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-02-05 11:47:53,142 INFO  L337             CfgBuilder]: Removed 0 assume(true) statements.
[2025-02-05 11:47:53,143 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:47:53 BoogieIcfgContainer
[2025-02-05 11:47:53,143 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-02-05 11:47:53,146 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-02-05 11:47:53,146 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-02-05 11:47:53,149 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-02-05 11:47:53,149 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 11:47:51" (1/3) ...
[2025-02-05 11:47:53,149 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72aa4b96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:47:53, skipping insertion in model container
[2025-02-05 11:47:53,150 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:47:51" (2/3) ...
[2025-02-05 11:47:53,150 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72aa4b96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:47:53, skipping insertion in model container
[2025-02-05 11:47:53,150 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:47:53" (3/3) ...
[2025-02-05 11:47:53,151 INFO  L128   eAbstractionObserver]: Analyzing ICFG Problem14_label00.c
[2025-02-05 11:47:53,163 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-02-05 11:47:53,164 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG Problem14_label00.c that has 1 procedures, 245 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-02-05 11:47:53,217 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-02-05 11:47:53,232 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;@561414d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-02-05 11:47:53,233 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-02-05 11:47:53,238 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 245 states, 243 states have (on average 1.7325102880658436) internal successors, (421), 244 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:47:53,243 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 54
[2025-02-05 11:47:53,247 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:47:53,247 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:47:53,248 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:47:53,255 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:47:53,255 INFO  L85        PathProgramCache]: Analyzing trace with hash -1697984915, now seen corresponding path program 1 times
[2025-02-05 11:47:53,264 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:47:53,264 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775786850]
[2025-02-05 11:47:53,264 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:47:53,264 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:47:53,329 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes.
[2025-02-05 11:47:53,363 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements.
[2025-02-05 11:47:53,367 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:47:53,367 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:47:53,586 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 11:47:53,586 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:47:53,586 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775786850]
[2025-02-05 11:47:53,587 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775786850] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:47:53,588 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:47:53,588 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-02-05 11:47:53,589 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474549751]
[2025-02-05 11:47:53,589 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:47:53,592 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:47:53,593 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:47:53,608 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:47:53,609 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:47:53,611 INFO  L87              Difference]: Start difference. First operand  has 245 states, 243 states have (on average 1.7325102880658436) internal successors, (421), 244 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand  has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 2 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:47:54,472 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:47:54,473 INFO  L93              Difference]: Finished difference Result 669 states and 1197 transitions.
[2025-02-05 11:47:54,478 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:47:54,479 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 2 states have internal predecessors, (53), 0 states have call successors, (0), 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 53
[2025-02-05 11:47:54,479 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:47:54,492 INFO  L225             Difference]: With dead ends: 669
[2025-02-05 11:47:54,492 INFO  L226             Difference]: Without dead ends: 360
[2025-02-05 11:47:54,498 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:47:54,500 INFO  L435           NwaCegarLoop]: 70 mSDtfsCounter, 153 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 615 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time
[2025-02-05 11:47:54,500 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 77 Invalid, 703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 615 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2025-02-05 11:47:54,520 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 360 states.
[2025-02-05 11:47:54,545 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 360.
[2025-02-05 11:47:54,546 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 360 states, 359 states have (on average 1.6378830083565459) internal successors, (588), 359 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:47:54,553 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 588 transitions.
[2025-02-05 11:47:54,555 INFO  L78                 Accepts]: Start accepts. Automaton has 360 states and 588 transitions. Word has length 53
[2025-02-05 11:47:54,555 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:47:54,555 INFO  L471      AbstractCegarLoop]: Abstraction has 360 states and 588 transitions.
[2025-02-05 11:47:54,556 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 2 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:47:54,556 INFO  L276                IsEmpty]: Start isEmpty. Operand 360 states and 588 transitions.
[2025-02-05 11:47:54,576 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 119
[2025-02-05 11:47:54,576 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:47:54,576 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:47:54,577 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2025-02-05 11:47:54,577 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:47:54,577 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:47:54,577 INFO  L85        PathProgramCache]: Analyzing trace with hash 1622006905, now seen corresponding path program 1 times
[2025-02-05 11:47:54,578 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:47:54,578 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28796506]
[2025-02-05 11:47:54,578 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:47:54,578 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:47:54,601 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes.
[2025-02-05 11:47:54,631 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements.
[2025-02-05 11:47:54,633 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:47:54,634 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:47:54,807 INFO  L134       CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 11:47:54,811 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:47:54,811 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28796506]
[2025-02-05 11:47:54,812 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28796506] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:47:54,812 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:47:54,812 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-02-05 11:47:54,812 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453293506]
[2025-02-05 11:47:54,812 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:47:54,813 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:47:54,813 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:47:54,813 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:47:54,813 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:47:54,813 INFO  L87              Difference]: Start difference. First operand 360 states and 588 transitions. Second operand  has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 2 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:47:55,685 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:47:55,686 INFO  L93              Difference]: Finished difference Result 1076 states and 1760 transitions.
[2025-02-05 11:47:55,687 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:47:55,688 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 2 states have internal predecessors, (118), 0 states have call successors, (0), 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 118
[2025-02-05 11:47:55,689 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:47:55,691 INFO  L225             Difference]: With dead ends: 1076
[2025-02-05 11:47:55,695 INFO  L226             Difference]: Without dead ends: 718
[2025-02-05 11:47:55,696 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:47:55,698 INFO  L435           NwaCegarLoop]: 84 mSDtfsCounter, 134 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time
[2025-02-05 11:47:55,703 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 88 Invalid, 591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2025-02-05 11:47:55,704 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 718 states.
[2025-02-05 11:47:55,762 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 716.
[2025-02-05 11:47:55,763 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 716 states, 715 states have (on average 1.4223776223776223) internal successors, (1017), 715 states have internal predecessors, (1017), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:47:55,768 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 1017 transitions.
[2025-02-05 11:47:55,769 INFO  L78                 Accepts]: Start accepts. Automaton has 716 states and 1017 transitions. Word has length 118
[2025-02-05 11:47:55,770 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:47:55,770 INFO  L471      AbstractCegarLoop]: Abstraction has 716 states and 1017 transitions.
[2025-02-05 11:47:55,771 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 2 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:47:55,773 INFO  L276                IsEmpty]: Start isEmpty. Operand 716 states and 1017 transitions.
[2025-02-05 11:47:55,774 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 120
[2025-02-05 11:47:55,774 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:47:55,774 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:47:55,775 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-02-05 11:47:55,775 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:47:55,776 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:47:55,776 INFO  L85        PathProgramCache]: Analyzing trace with hash -608976206, now seen corresponding path program 1 times
[2025-02-05 11:47:55,776 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:47:55,777 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333933790]
[2025-02-05 11:47:55,778 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:47:55,778 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:47:55,801 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes.
[2025-02-05 11:47:55,832 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements.
[2025-02-05 11:47:55,832 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:47:55,832 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:47:56,002 INFO  L134       CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 11:47:56,002 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:47:56,002 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333933790]
[2025-02-05 11:47:56,002 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333933790] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:47:56,002 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:47:56,002 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-02-05 11:47:56,002 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904391254]
[2025-02-05 11:47:56,002 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:47:56,003 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:47:56,003 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:47:56,003 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:47:56,004 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:47:56,005 INFO  L87              Difference]: Start difference. First operand 716 states and 1017 transitions. Second operand  has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:47:56,806 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:47:56,806 INFO  L93              Difference]: Finished difference Result 1608 states and 2324 transitions.
[2025-02-05 11:47:56,807 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:47:56,807 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 0 states have call successors, (0), 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 119
[2025-02-05 11:47:56,808 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:47:56,817 INFO  L225             Difference]: With dead ends: 1608
[2025-02-05 11:47:56,817 INFO  L226             Difference]: Without dead ends: 894
[2025-02-05 11:47:56,819 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:47:56,824 INFO  L435           NwaCegarLoop]: 54 mSDtfsCounter, 125 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-02-05 11:47:56,825 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 57 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-02-05 11:47:56,828 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 894 states.
[2025-02-05 11:47:56,864 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 894.
[2025-02-05 11:47:56,867 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 894 states, 893 states have (on average 1.3314669652855544) internal successors, (1189), 893 states have internal predecessors, (1189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:47:56,879 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 894 states and 1189 transitions.
[2025-02-05 11:47:56,879 INFO  L78                 Accepts]: Start accepts. Automaton has 894 states and 1189 transitions. Word has length 119
[2025-02-05 11:47:56,880 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:47:56,880 INFO  L471      AbstractCegarLoop]: Abstraction has 894 states and 1189 transitions.
[2025-02-05 11:47:56,881 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:47:56,881 INFO  L276                IsEmpty]: Start isEmpty. Operand 894 states and 1189 transitions.
[2025-02-05 11:47:56,884 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 123
[2025-02-05 11:47:56,887 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:47:56,888 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-02-05 11:47:56,888 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-02-05 11:47:56,888 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:47:56,888 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:47:56,888 INFO  L85        PathProgramCache]: Analyzing trace with hash 167019779, now seen corresponding path program 1 times
[2025-02-05 11:47:56,888 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:47:56,888 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419661280]
[2025-02-05 11:47:56,888 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:47:56,888 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:47:56,917 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes.
[2025-02-05 11:47:56,942 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements.
[2025-02-05 11:47:56,945 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:47:56,945 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:47:57,331 INFO  L134       CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 11:47:57,332 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:47:57,332 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419661280]
[2025-02-05 11:47:57,332 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419661280] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:47:57,332 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:47:57,332 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:47:57,332 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148634177]
[2025-02-05 11:47:57,332 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:47:57,332 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 11:47:57,332 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:47:57,333 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 11:47:57,333 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-05 11:47:57,333 INFO  L87              Difference]: Start difference. First operand 894 states and 1189 transitions. Second operand  has 4 states, 4 states have (on average 30.5) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:47:58,479 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:47:58,480 INFO  L93              Difference]: Finished difference Result 2144 states and 2782 transitions.
[2025-02-05 11:47:58,480 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 11:47:58,480 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 30.5) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 122
[2025-02-05 11:47:58,481 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:47:58,484 INFO  L225             Difference]: With dead ends: 2144
[2025-02-05 11:47:58,484 INFO  L226             Difference]: Without dead ends: 1252
[2025-02-05 11:47:58,485 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-02-05 11:47:58,487 INFO  L435           NwaCegarLoop]: 111 mSDtfsCounter, 441 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 943 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 970 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 943 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time
[2025-02-05 11:47:58,488 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [441 Valid, 123 Invalid, 970 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 943 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2025-02-05 11:47:58,490 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1252 states.
[2025-02-05 11:47:58,503 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1252 to 1250.
[2025-02-05 11:47:58,506 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1250 states, 1249 states have (on average 1.257005604483587) internal successors, (1570), 1249 states have internal predecessors, (1570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:47:58,510 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1250 states to 1250 states and 1570 transitions.
[2025-02-05 11:47:58,510 INFO  L78                 Accepts]: Start accepts. Automaton has 1250 states and 1570 transitions. Word has length 122
[2025-02-05 11:47:58,510 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:47:58,510 INFO  L471      AbstractCegarLoop]: Abstraction has 1250 states and 1570 transitions.
[2025-02-05 11:47:58,510 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 30.5) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:47:58,510 INFO  L276                IsEmpty]: Start isEmpty. Operand 1250 states and 1570 transitions.
[2025-02-05 11:47:58,512 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 134
[2025-02-05 11:47:58,512 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:47:58,512 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-02-05 11:47:58,512 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-02-05 11:47:58,512 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:47:58,513 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:47:58,513 INFO  L85        PathProgramCache]: Analyzing trace with hash 791569205, now seen corresponding path program 1 times
[2025-02-05 11:47:58,513 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:47:58,513 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743906231]
[2025-02-05 11:47:58,513 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:47:58,513 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:47:58,530 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes.
[2025-02-05 11:47:58,541 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements.
[2025-02-05 11:47:58,542 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:47:58,542 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:47:58,692 INFO  L134       CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 11:47:58,693 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:47:58,694 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743906231]
[2025-02-05 11:47:58,694 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743906231] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:47:58,694 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:47:58,694 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:47:58,694 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558134093]
[2025-02-05 11:47:58,694 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:47:58,694 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 11:47:58,694 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:47:58,695 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 11:47:58,695 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-02-05 11:47:58,695 INFO  L87              Difference]: Start difference. First operand 1250 states and 1570 transitions. Second operand  has 4 states, 4 states have (on average 33.25) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:47:59,528 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:47:59,528 INFO  L93              Difference]: Finished difference Result 2885 states and 3573 transitions.
[2025-02-05 11:47:59,528 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 11:47:59,529 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 33.25) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 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 133
[2025-02-05 11:47:59,529 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:47:59,537 INFO  L225             Difference]: With dead ends: 2885
[2025-02-05 11:47:59,541 INFO  L226             Difference]: Without dead ends: 1608
[2025-02-05 11:47:59,543 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-02-05 11:47:59,544 INFO  L435           NwaCegarLoop]: 112 mSDtfsCounter, 103 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 723 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 723 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time
[2025-02-05 11:47:59,544 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 123 Invalid, 784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 723 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2025-02-05 11:47:59,546 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1608 states.
[2025-02-05 11:47:59,587 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1608 to 1606.
[2025-02-05 11:47:59,593 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1606 states, 1605 states have (on average 1.1314641744548286) internal successors, (1816), 1605 states have internal predecessors, (1816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:47:59,601 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1606 states to 1606 states and 1816 transitions.
[2025-02-05 11:47:59,602 INFO  L78                 Accepts]: Start accepts. Automaton has 1606 states and 1816 transitions. Word has length 133
[2025-02-05 11:47:59,602 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:47:59,603 INFO  L471      AbstractCegarLoop]: Abstraction has 1606 states and 1816 transitions.
[2025-02-05 11:47:59,603 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 33.25) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:47:59,603 INFO  L276                IsEmpty]: Start isEmpty. Operand 1606 states and 1816 transitions.
[2025-02-05 11:47:59,605 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 228
[2025-02-05 11:47:59,605 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:47:59,605 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:47:59,608 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-02-05 11:47:59,609 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:47:59,609 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:47:59,609 INFO  L85        PathProgramCache]: Analyzing trace with hash -125855853, now seen corresponding path program 1 times
[2025-02-05 11:47:59,609 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:47:59,609 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104168062]
[2025-02-05 11:47:59,609 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:47:59,609 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:47:59,644 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes.
[2025-02-05 11:47:59,670 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements.
[2025-02-05 11:47:59,671 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:47:59,675 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:47:59,970 INFO  L134       CoverageAnalysis]: Checked inductivity of 169 backedges. 169 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 11:47:59,970 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:47:59,970 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104168062]
[2025-02-05 11:47:59,970 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104168062] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:47:59,970 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:47:59,971 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:47:59,971 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716704767]
[2025-02-05 11:47:59,971 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:47:59,971 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:47:59,971 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:47:59,971 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:47:59,972 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:47:59,972 INFO  L87              Difference]: Start difference. First operand 1606 states and 1816 transitions. Second operand  has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:48:00,454 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:48:00,454 INFO  L93              Difference]: Finished difference Result 3922 states and 4494 transitions.
[2025-02-05 11:48:00,454 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:48:00,455 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 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 227
[2025-02-05 11:48:00,455 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:48:00,461 INFO  L225             Difference]: With dead ends: 3922
[2025-02-05 11:48:00,461 INFO  L226             Difference]: Without dead ends: 2318
[2025-02-05 11:48:00,462 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:48:00,463 INFO  L435           NwaCegarLoop]: 73 mSDtfsCounter, 112 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-02-05 11:48:00,463 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 76 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-02-05 11:48:00,465 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2318 states.
[2025-02-05 11:48:00,489 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2318 to 2318.
[2025-02-05 11:48:00,492 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2318 states, 2317 states have (on average 1.1130772550712127) internal successors, (2579), 2317 states have internal predecessors, (2579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:48:00,496 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2318 states to 2318 states and 2579 transitions.
[2025-02-05 11:48:00,496 INFO  L78                 Accepts]: Start accepts. Automaton has 2318 states and 2579 transitions. Word has length 227
[2025-02-05 11:48:00,496 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:48:00,496 INFO  L471      AbstractCegarLoop]: Abstraction has 2318 states and 2579 transitions.
[2025-02-05 11:48:00,496 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:48:00,497 INFO  L276                IsEmpty]: Start isEmpty. Operand 2318 states and 2579 transitions.
[2025-02-05 11:48:00,499 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 345
[2025-02-05 11:48:00,499 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:48:00,499 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 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]
[2025-02-05 11:48:00,500 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-02-05 11:48:00,500 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:48:00,500 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:48:00,500 INFO  L85        PathProgramCache]: Analyzing trace with hash 1285800348, now seen corresponding path program 1 times
[2025-02-05 11:48:00,500 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:48:00,500 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914139959]
[2025-02-05 11:48:00,500 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:48:00,501 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:48:00,525 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 344 statements into 1 equivalence classes.
[2025-02-05 11:48:00,542 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 344 of 344 statements.
[2025-02-05 11:48:00,543 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:48:00,543 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:48:00,807 INFO  L134       CoverageAnalysis]: Checked inductivity of 415 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 263 trivial. 0 not checked.
[2025-02-05 11:48:00,808 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:48:00,809 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914139959]
[2025-02-05 11:48:00,809 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914139959] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:48:00,809 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:48:00,809 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:48:00,809 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785906381]
[2025-02-05 11:48:00,809 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:48:00,810 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 11:48:00,810 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:48:00,810 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 11:48:00,810 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-02-05 11:48:00,811 INFO  L87              Difference]: Start difference. First operand 2318 states and 2579 transitions. Second operand  has 4 states, 4 states have (on average 40.5) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:48:01,324 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:48:01,325 INFO  L93              Difference]: Finished difference Result 4692 states and 5238 transitions.
[2025-02-05 11:48:01,325 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 11:48:01,325 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 40.5) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 344
[2025-02-05 11:48:01,325 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:48:01,332 INFO  L225             Difference]: With dead ends: 4692
[2025-02-05 11:48:01,332 INFO  L226             Difference]: Without dead ends: 2496
[2025-02-05 11:48:01,334 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-02-05 11:48:01,335 INFO  L435           NwaCegarLoop]: 9 mSDtfsCounter, 141 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 685 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-02-05 11:48:01,336 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 17 Invalid, 743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 685 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-02-05 11:48:01,338 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2496 states.
[2025-02-05 11:48:01,365 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2496 to 2318.
[2025-02-05 11:48:01,368 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2318 states, 2317 states have (on average 1.0738023305999136) internal successors, (2488), 2317 states have internal predecessors, (2488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:48:01,371 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2318 states to 2318 states and 2488 transitions.
[2025-02-05 11:48:01,372 INFO  L78                 Accepts]: Start accepts. Automaton has 2318 states and 2488 transitions. Word has length 344
[2025-02-05 11:48:01,372 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:48:01,372 INFO  L471      AbstractCegarLoop]: Abstraction has 2318 states and 2488 transitions.
[2025-02-05 11:48:01,373 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 40.5) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:48:01,373 INFO  L276                IsEmpty]: Start isEmpty. Operand 2318 states and 2488 transitions.
[2025-02-05 11:48:01,378 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 440
[2025-02-05 11:48:01,378 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:48:01,378 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:48:01,379 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-02-05 11:48:01,379 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:48:01,379 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:48:01,380 INFO  L85        PathProgramCache]: Analyzing trace with hash -523750861, now seen corresponding path program 1 times
[2025-02-05 11:48:01,380 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:48:01,380 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808005272]
[2025-02-05 11:48:01,380 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:48:01,380 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:48:01,415 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 439 statements into 1 equivalence classes.
[2025-02-05 11:48:01,435 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 439 of 439 statements.
[2025-02-05 11:48:01,436 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:48:01,436 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:48:01,783 INFO  L134       CoverageAnalysis]: Checked inductivity of 723 backedges. 409 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked.
[2025-02-05 11:48:01,783 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:48:01,783 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808005272]
[2025-02-05 11:48:01,783 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808005272] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:48:01,784 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:48:01,784 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:48:01,784 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906627873]
[2025-02-05 11:48:01,784 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:48:01,784 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:48:01,784 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:48:01,785 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:48:01,785 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:48:01,785 INFO  L87              Difference]: Start difference. First operand 2318 states and 2488 transitions. Second operand  has 3 states, 3 states have (on average 77.0) internal successors, (231), 3 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:48:02,187 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:48:02,188 INFO  L93              Difference]: Finished difference Result 4812 states and 5232 transitions.
[2025-02-05 11:48:02,188 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:48:02,188 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 77.0) internal successors, (231), 3 states have internal predecessors, (231), 0 states have call successors, (0), 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 439
[2025-02-05 11:48:02,189 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:48:02,196 INFO  L225             Difference]: With dead ends: 4812
[2025-02-05 11:48:02,196 INFO  L226             Difference]: Without dead ends: 2674
[2025-02-05 11:48:02,198 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:48:02,198 INFO  L435           NwaCegarLoop]: 240 mSDtfsCounter, 110 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-02-05 11:48:02,199 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 245 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-02-05 11:48:02,200 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2674 states.
[2025-02-05 11:48:02,221 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2674 to 2140.
[2025-02-05 11:48:02,223 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2140 states, 2139 states have (on average 1.0733987844787283) internal successors, (2296), 2139 states have internal predecessors, (2296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:48:02,226 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2140 states to 2140 states and 2296 transitions.
[2025-02-05 11:48:02,226 INFO  L78                 Accepts]: Start accepts. Automaton has 2140 states and 2296 transitions. Word has length 439
[2025-02-05 11:48:02,227 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:48:02,227 INFO  L471      AbstractCegarLoop]: Abstraction has 2140 states and 2296 transitions.
[2025-02-05 11:48:02,227 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 77.0) internal successors, (231), 3 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:48:02,228 INFO  L276                IsEmpty]: Start isEmpty. Operand 2140 states and 2296 transitions.
[2025-02-05 11:48:02,234 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 447
[2025-02-05 11:48:02,234 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:48:02,235 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:48:02,235 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-02-05 11:48:02,235 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:48:02,236 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:48:02,237 INFO  L85        PathProgramCache]: Analyzing trace with hash 1430201382, now seen corresponding path program 1 times
[2025-02-05 11:48:02,237 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:48:02,237 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855341815]
[2025-02-05 11:48:02,237 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:48:02,238 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:48:02,270 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 446 statements into 1 equivalence classes.
[2025-02-05 11:48:02,309 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 446 of 446 statements.
[2025-02-05 11:48:02,309 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:48:02,309 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:48:02,624 INFO  L134       CoverageAnalysis]: Checked inductivity of 723 backedges. 409 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked.
[2025-02-05 11:48:02,624 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:48:02,624 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855341815]
[2025-02-05 11:48:02,624 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855341815] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:48:02,624 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:48:02,624 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:48:02,625 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736626558]
[2025-02-05 11:48:02,625 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:48:02,625 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:48:02,625 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:48:02,626 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:48:02,626 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:48:02,626 INFO  L87              Difference]: Start difference. First operand 2140 states and 2296 transitions. Second operand  has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:48:03,038 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:48:03,038 INFO  L93              Difference]: Finished difference Result 4634 states and 5051 transitions.
[2025-02-05 11:48:03,038 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:48:03,039 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 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 446
[2025-02-05 11:48:03,039 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:48:03,046 INFO  L225             Difference]: With dead ends: 4634
[2025-02-05 11:48:03,046 INFO  L226             Difference]: Without dead ends: 2674
[2025-02-05 11:48:03,047 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:48:03,050 INFO  L435           NwaCegarLoop]: 215 mSDtfsCounter, 113 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-02-05 11:48:03,050 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 220 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-02-05 11:48:03,052 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2674 states.
[2025-02-05 11:48:03,070 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2674 to 2318.
[2025-02-05 11:48:03,072 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2318 states, 2317 states have (on average 1.0824341821320673) internal successors, (2508), 2317 states have internal predecessors, (2508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:48:03,075 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2318 states to 2318 states and 2508 transitions.
[2025-02-05 11:48:03,075 INFO  L78                 Accepts]: Start accepts. Automaton has 2318 states and 2508 transitions. Word has length 446
[2025-02-05 11:48:03,076 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:48:03,076 INFO  L471      AbstractCegarLoop]: Abstraction has 2318 states and 2508 transitions.
[2025-02-05 11:48:03,076 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:48:03,076 INFO  L276                IsEmpty]: Start isEmpty. Operand 2318 states and 2508 transitions.
[2025-02-05 11:48:03,081 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 488
[2025-02-05 11:48:03,081 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:48:03,081 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:48:03,081 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-02-05 11:48:03,082 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:48:03,082 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:48:03,082 INFO  L85        PathProgramCache]: Analyzing trace with hash -1530056419, now seen corresponding path program 1 times
[2025-02-05 11:48:03,082 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:48:03,082 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448810503]
[2025-02-05 11:48:03,082 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:48:03,083 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:48:03,118 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 487 statements into 1 equivalence classes.
[2025-02-05 11:48:03,138 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 487 of 487 statements.
[2025-02-05 11:48:03,138 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:48:03,138 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:48:03,281 INFO  L134       CoverageAnalysis]: Checked inductivity of 837 backedges. 523 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked.
[2025-02-05 11:48:03,281 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:48:03,282 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448810503]
[2025-02-05 11:48:03,282 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448810503] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:48:03,282 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:48:03,282 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:48:03,282 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202323234]
[2025-02-05 11:48:03,282 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:48:03,282 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:48:03,282 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:48:03,283 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:48:03,283 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:48:03,283 INFO  L87              Difference]: Start difference. First operand 2318 states and 2508 transitions. Second operand  has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:48:03,714 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:48:03,714 INFO  L93              Difference]: Finished difference Result 5168 states and 5662 transitions.
[2025-02-05 11:48:03,714 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:48:03,714 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 487
[2025-02-05 11:48:03,715 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:48:03,721 INFO  L225             Difference]: With dead ends: 5168
[2025-02-05 11:48:03,721 INFO  L226             Difference]: Without dead ends: 3030
[2025-02-05 11:48:03,723 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:48:03,723 INFO  L435           NwaCegarLoop]: 47 mSDtfsCounter, 74 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-02-05 11:48:03,723 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 50 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-02-05 11:48:03,725 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3030 states.
[2025-02-05 11:48:03,751 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3030 to 3030.
[2025-02-05 11:48:03,755 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3030 states, 3029 states have (on average 1.0825354902608122) internal successors, (3279), 3029 states have internal predecessors, (3279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:48:03,758 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3030 states to 3030 states and 3279 transitions.
[2025-02-05 11:48:03,758 INFO  L78                 Accepts]: Start accepts. Automaton has 3030 states and 3279 transitions. Word has length 487
[2025-02-05 11:48:03,758 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:48:03,759 INFO  L471      AbstractCegarLoop]: Abstraction has 3030 states and 3279 transitions.
[2025-02-05 11:48:03,759 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:48:03,759 INFO  L276                IsEmpty]: Start isEmpty. Operand 3030 states and 3279 transitions.
[2025-02-05 11:48:03,761 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 524
[2025-02-05 11:48:03,761 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:48:03,761 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:48:03,762 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-02-05 11:48:03,762 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:48:03,762 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:48:03,762 INFO  L85        PathProgramCache]: Analyzing trace with hash 1047945558, now seen corresponding path program 1 times
[2025-02-05 11:48:03,762 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:48:03,762 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312754132]
[2025-02-05 11:48:03,762 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:48:03,763 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:48:03,791 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 523 statements into 1 equivalence classes.
[2025-02-05 11:48:03,807 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 523 of 523 statements.
[2025-02-05 11:48:03,807 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:48:03,807 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:48:04,081 INFO  L134       CoverageAnalysis]: Checked inductivity of 1073 backedges. 759 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked.
[2025-02-05 11:48:04,082 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:48:04,082 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312754132]
[2025-02-05 11:48:04,082 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312754132] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:48:04,082 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:48:04,082 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-05 11:48:04,082 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230692935]
[2025-02-05 11:48:04,082 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:48:04,083 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 11:48:04,083 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:48:04,083 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 11:48:04,083 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-02-05 11:48:04,083 INFO  L87              Difference]: Start difference. First operand 3030 states and 3279 transitions. Second operand  has 4 states, 4 states have (on average 78.75) internal successors, (315), 4 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:48:04,693 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:48:04,693 INFO  L93              Difference]: Finished difference Result 6414 states and 6954 transitions.
[2025-02-05 11:48:04,693 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 11:48:04,694 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 78.75) internal successors, (315), 4 states have internal predecessors, (315), 0 states have call successors, (0), 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 523
[2025-02-05 11:48:04,694 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:48:04,701 INFO  L225             Difference]: With dead ends: 6414
[2025-02-05 11:48:04,701 INFO  L226             Difference]: Without dead ends: 3564
[2025-02-05 11:48:04,704 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-02-05 11:48:04,704 INFO  L435           NwaCegarLoop]: 60 mSDtfsCounter, 215 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 808 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 808 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-02-05 11:48:04,704 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 68 Invalid, 852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 808 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-02-05 11:48:04,707 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3564 states.
[2025-02-05 11:48:04,731 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3564 to 3208.
[2025-02-05 11:48:04,734 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3208 states, 3207 states have (on average 1.0763953850951045) internal successors, (3452), 3207 states have internal predecessors, (3452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:48:04,738 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3208 states to 3208 states and 3452 transitions.
[2025-02-05 11:48:04,738 INFO  L78                 Accepts]: Start accepts. Automaton has 3208 states and 3452 transitions. Word has length 523
[2025-02-05 11:48:04,738 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:48:04,738 INFO  L471      AbstractCegarLoop]: Abstraction has 3208 states and 3452 transitions.
[2025-02-05 11:48:04,739 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 78.75) internal successors, (315), 4 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:48:04,739 INFO  L276                IsEmpty]: Start isEmpty. Operand 3208 states and 3452 transitions.
[2025-02-05 11:48:04,741 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 602
[2025-02-05 11:48:04,741 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:48:04,741 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 3, 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]
[2025-02-05 11:48:04,742 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-02-05 11:48:04,742 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:48:04,742 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:48:04,742 INFO  L85        PathProgramCache]: Analyzing trace with hash 915610611, now seen corresponding path program 1 times
[2025-02-05 11:48:04,742 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:48:04,742 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813257717]
[2025-02-05 11:48:04,743 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:48:04,743 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:48:04,792 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 601 statements into 1 equivalence classes.
[2025-02-05 11:48:04,814 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 601 of 601 statements.
[2025-02-05 11:48:04,815 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:48:04,815 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:48:05,115 INFO  L134       CoverageAnalysis]: Checked inductivity of 1166 backedges. 529 proven. 0 refuted. 0 times theorem prover too weak. 637 trivial. 0 not checked.
[2025-02-05 11:48:05,116 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:48:05,116 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813257717]
[2025-02-05 11:48:05,116 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813257717] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:48:05,116 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:48:05,116 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:48:05,117 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771160993]
[2025-02-05 11:48:05,117 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:48:05,117 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:48:05,117 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:48:05,118 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:48:05,118 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:48:05,118 INFO  L87              Difference]: Start difference. First operand 3208 states and 3452 transitions. Second operand  has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:48:05,566 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:48:05,567 INFO  L93              Difference]: Finished difference Result 6770 states and 7363 transitions.
[2025-02-05 11:48:05,567 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:48:05,567 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 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 601
[2025-02-05 11:48:05,568 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:48:05,576 INFO  L225             Difference]: With dead ends: 6770
[2025-02-05 11:48:05,576 INFO  L226             Difference]: Without dead ends: 3742
[2025-02-05 11:48:05,579 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:48:05,580 INFO  L435           NwaCegarLoop]: 222 mSDtfsCounter, 110 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-02-05 11:48:05,580 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 227 Invalid, 470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-02-05 11:48:05,583 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3742 states.
[2025-02-05 11:48:05,611 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3742 to 3564.
[2025-02-05 11:48:05,615 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3564 states, 3563 states have (on average 1.0712882402469828) internal successors, (3817), 3563 states have internal predecessors, (3817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:48:05,618 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3564 states to 3564 states and 3817 transitions.
[2025-02-05 11:48:05,618 INFO  L78                 Accepts]: Start accepts. Automaton has 3564 states and 3817 transitions. Word has length 601
[2025-02-05 11:48:05,618 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:48:05,618 INFO  L471      AbstractCegarLoop]: Abstraction has 3564 states and 3817 transitions.
[2025-02-05 11:48:05,618 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:48:05,619 INFO  L276                IsEmpty]: Start isEmpty. Operand 3564 states and 3817 transitions.
[2025-02-05 11:48:05,621 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 643
[2025-02-05 11:48:05,621 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:48:05,621 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 3, 3, 3, 3, 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]
[2025-02-05 11:48:05,622 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2025-02-05 11:48:05,623 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:48:05,623 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:48:05,623 INFO  L85        PathProgramCache]: Analyzing trace with hash -1356422160, now seen corresponding path program 1 times
[2025-02-05 11:48:05,623 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:48:05,623 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659477248]
[2025-02-05 11:48:05,623 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:48:05,624 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:48:05,661 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 642 statements into 1 equivalence classes.
[2025-02-05 11:48:05,683 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 642 of 642 statements.
[2025-02-05 11:48:05,683 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:48:05,683 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:48:05,951 INFO  L134       CoverageAnalysis]: Checked inductivity of 1321 backedges. 897 proven. 110 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked.
[2025-02-05 11:48:05,951 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:48:05,952 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659477248]
[2025-02-05 11:48:05,952 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659477248] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-05 11:48:05,952 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1083802002]
[2025-02-05 11:48:05,952 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:48:05,952 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 11:48:05,952 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 11:48:05,954 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-02-05 11:48:05,956 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2025-02-05 11:48:06,023 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 642 statements into 1 equivalence classes.
[2025-02-05 11:48:06,116 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 642 of 642 statements.
[2025-02-05 11:48:06,116 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:48:06,116 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:48:06,119 INFO  L256         TraceCheckSpWp]: Trace formula consists of 801 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-02-05 11:48:06,134 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-05 11:48:06,230 INFO  L134       CoverageAnalysis]: Checked inductivity of 1321 backedges. 254 proven. 0 refuted. 0 times theorem prover too weak. 1067 trivial. 0 not checked.
[2025-02-05 11:48:06,230 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-02-05 11:48:06,230 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1083802002] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:48:06,230 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-02-05 11:48:06,231 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5
[2025-02-05 11:48:06,231 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284284063]
[2025-02-05 11:48:06,231 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:48:06,232 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:48:06,232 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:48:06,232 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:48:06,232 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-05 11:48:06,232 INFO  L87              Difference]: Start difference. First operand 3564 states and 3817 transitions. Second operand  has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:48:06,634 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:48:06,634 INFO  L93              Difference]: Finished difference Result 7482 states and 8093 transitions.
[2025-02-05 11:48:06,635 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:48:06,635 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 0 states have call successors, (0), 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 642
[2025-02-05 11:48:06,635 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:48:06,642 INFO  L225             Difference]: With dead ends: 7482
[2025-02-05 11:48:06,642 INFO  L226             Difference]: Without dead ends: 4098
[2025-02-05 11:48:06,644 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 645 GetRequests, 642 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-05 11:48:06,645 INFO  L435           NwaCegarLoop]: 231 mSDtfsCounter, 128 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-02-05 11:48:06,645 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 236 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-02-05 11:48:06,647 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 4098 states.
[2025-02-05 11:48:06,670 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 4098 to 3920.
[2025-02-05 11:48:06,678 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3920 states, 3919 states have (on average 1.0719571319214085) internal successors, (4201), 3919 states have internal predecessors, (4201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:48:06,683 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3920 states to 3920 states and 4201 transitions.
[2025-02-05 11:48:06,683 INFO  L78                 Accepts]: Start accepts. Automaton has 3920 states and 4201 transitions. Word has length 642
[2025-02-05 11:48:06,684 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:48:06,684 INFO  L471      AbstractCegarLoop]: Abstraction has 3920 states and 4201 transitions.
[2025-02-05 11:48:06,685 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:48:06,685 INFO  L276                IsEmpty]: Start isEmpty. Operand 3920 states and 4201 transitions.
[2025-02-05 11:48:06,689 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 790
[2025-02-05 11:48:06,689 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:48:06,690 INFO  L218           NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:48:06,697 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2025-02-05 11:48:06,893 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12
[2025-02-05 11:48:06,893 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:48:06,893 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:48:06,893 INFO  L85        PathProgramCache]: Analyzing trace with hash 682512361, now seen corresponding path program 1 times
[2025-02-05 11:48:06,893 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:48:06,893 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174578557]
[2025-02-05 11:48:06,894 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:48:06,894 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:48:06,986 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 789 statements into 1 equivalence classes.
[2025-02-05 11:48:07,045 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 789 of 789 statements.
[2025-02-05 11:48:07,046 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:48:07,046 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:48:07,497 INFO  L134       CoverageAnalysis]: Checked inductivity of 1829 backedges. 1309 proven. 155 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked.
[2025-02-05 11:48:07,497 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:48:07,498 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174578557]
[2025-02-05 11:48:07,499 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174578557] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-05 11:48:07,499 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [405987410]
[2025-02-05 11:48:07,499 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:48:07,499 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 11:48:07,499 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 11:48:07,501 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-02-05 11:48:07,503 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2025-02-05 11:48:07,593 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 789 statements into 1 equivalence classes.
[2025-02-05 11:48:07,708 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 789 of 789 statements.
[2025-02-05 11:48:07,708 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:48:07,708 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:48:07,711 INFO  L256         TraceCheckSpWp]: Trace formula consists of 971 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-02-05 11:48:07,721 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-05 11:48:07,805 INFO  L134       CoverageAnalysis]: Checked inductivity of 1829 backedges. 305 proven. 0 refuted. 0 times theorem prover too weak. 1524 trivial. 0 not checked.
[2025-02-05 11:48:07,805 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-02-05 11:48:07,805 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [405987410] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:48:07,805 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-02-05 11:48:07,806 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5
[2025-02-05 11:48:07,806 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887227522]
[2025-02-05 11:48:07,806 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:48:07,806 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:48:07,806 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:48:07,807 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:48:07,807 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-05 11:48:07,807 INFO  L87              Difference]: Start difference. First operand 3920 states and 4201 transitions. Second operand  has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:48:08,212 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:48:08,213 INFO  L93              Difference]: Finished difference Result 5524 states and 5882 transitions.
[2025-02-05 11:48:08,213 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:48:08,214 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 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 789
[2025-02-05 11:48:08,215 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:48:08,232 INFO  L225             Difference]: With dead ends: 5524
[2025-02-05 11:48:08,232 INFO  L226             Difference]: Without dead ends: 5522
[2025-02-05 11:48:08,234 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 792 GetRequests, 789 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-05 11:48:08,234 INFO  L435           NwaCegarLoop]: 18 mSDtfsCounter, 148 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-02-05 11:48:08,234 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 22 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-02-05 11:48:08,237 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 5522 states.
[2025-02-05 11:48:08,283 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 5522 to 4098.
[2025-02-05 11:48:08,291 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 4098 states, 4097 states have (on average 1.0698071759824261) internal successors, (4383), 4097 states have internal predecessors, (4383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:48:08,298 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4098 states to 4098 states and 4383 transitions.
[2025-02-05 11:48:08,298 INFO  L78                 Accepts]: Start accepts. Automaton has 4098 states and 4383 transitions. Word has length 789
[2025-02-05 11:48:08,299 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:48:08,299 INFO  L471      AbstractCegarLoop]: Abstraction has 4098 states and 4383 transitions.
[2025-02-05 11:48:08,300 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:48:08,300 INFO  L276                IsEmpty]: Start isEmpty. Operand 4098 states and 4383 transitions.
[2025-02-05 11:48:08,307 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 808
[2025-02-05 11:48:08,307 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:48:08,308 INFO  L218           NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:48:08,319 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2025-02-05 11:48:08,508 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 11:48:08,509 INFO  L396      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:48:08,509 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:48:08,510 INFO  L85        PathProgramCache]: Analyzing trace with hash 988620790, now seen corresponding path program 1 times
[2025-02-05 11:48:08,510 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:48:08,510 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356528463]
[2025-02-05 11:48:08,510 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:48:08,510 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:48:08,548 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 807 statements into 1 equivalence classes.
[2025-02-05 11:48:08,576 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 807 of 807 statements.
[2025-02-05 11:48:08,576 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:48:08,576 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:48:08,862 INFO  L134       CoverageAnalysis]: Checked inductivity of 1919 backedges. 1399 proven. 155 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked.
[2025-02-05 11:48:08,862 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:48:08,862 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356528463]
[2025-02-05 11:48:08,862 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356528463] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-05 11:48:08,862 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1982448634]
[2025-02-05 11:48:08,862 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:48:08,862 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 11:48:08,862 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 11:48:08,865 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-02-05 11:48:08,871 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2025-02-05 11:48:08,930 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 807 statements into 1 equivalence classes.
[2025-02-05 11:48:09,030 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 807 of 807 statements.
[2025-02-05 11:48:09,031 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:48:09,031 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:48:09,033 INFO  L256         TraceCheckSpWp]: Trace formula consists of 988 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-02-05 11:48:09,039 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-05 11:48:09,140 INFO  L134       CoverageAnalysis]: Checked inductivity of 1919 backedges. 305 proven. 0 refuted. 0 times theorem prover too weak. 1614 trivial. 0 not checked.
[2025-02-05 11:48:09,141 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-02-05 11:48:09,141 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1982448634] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:48:09,141 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-02-05 11:48:09,141 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5
[2025-02-05 11:48:09,141 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857385164]
[2025-02-05 11:48:09,141 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:48:09,141 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:48:09,141 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:48:09,142 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:48:09,142 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-05 11:48:09,142 INFO  L87              Difference]: Start difference. First operand 4098 states and 4383 transitions. Second operand  has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:48:09,571 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:48:09,571 INFO  L93              Difference]: Finished difference Result 8726 states and 9363 transitions.
[2025-02-05 11:48:09,571 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:48:09,571 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 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 807
[2025-02-05 11:48:09,572 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:48:09,572 INFO  L225             Difference]: With dead ends: 8726
[2025-02-05 11:48:09,572 INFO  L226             Difference]: Without dead ends: 0
[2025-02-05 11:48:09,577 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 810 GetRequests, 807 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-05 11:48:09,577 INFO  L435           NwaCegarLoop]: 221 mSDtfsCounter, 132 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-02-05 11:48:09,577 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 225 Invalid, 473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-02-05 11:48:09,578 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2025-02-05 11:48:09,578 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2025-02-05 11:48:09,578 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:48:09,578 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2025-02-05 11:48:09,578 INFO  L78                 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 807
[2025-02-05 11:48:09,578 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:48:09,578 INFO  L471      AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2025-02-05 11:48:09,578 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:48:09,578 INFO  L276                IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2025-02-05 11:48:09,579 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2025-02-05 11:48:09,580 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2025-02-05 11:48:09,587 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0
[2025-02-05 11:48:09,781 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 11:48:09,785 INFO  L422         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:48:09,786 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.
[2025-02-05 11:48:10,122 INFO  L170   ceAbstractionStarter]: Computing trace abstraction results
[2025-02-05 11:48:10,135 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 11:48:10 BoogieIcfgContainer
[2025-02-05 11:48:10,137 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2025-02-05 11:48:10,137 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2025-02-05 11:48:10,137 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2025-02-05 11:48:10,137 INFO  L274        PluginConnector]: Witness Printer initialized
[2025-02-05 11:48:10,138 INFO  L184        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:47:53" (3/4) ...
[2025-02-05 11:48:10,139 INFO  L146         WitnessPrinter]: Generating witness for correct program
[2025-02-05 11:48:10,157 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges
[2025-02-05 11:48:10,158 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges
[2025-02-05 11:48:10,159 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges
[2025-02-05 11:48:10,160 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges
[2025-02-05 11:48:10,265 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml
[2025-02-05 11:48:10,265 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml
[2025-02-05 11:48:10,266 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2025-02-05 11:48:10,266 INFO  L158              Benchmark]: Toolchain (without parser) took 19007.43ms. Allocated memory was 142.6MB in the beginning and 587.2MB in the end (delta: 444.6MB). Free memory was 111.2MB in the beginning and 511.5MB in the end (delta: -400.3MB). Peak memory consumption was 44.6MB. Max. memory is 16.1GB.
[2025-02-05 11:48:10,266 INFO  L158              Benchmark]: CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 124.7MB. There was no memory consumed. Max. memory is 16.1GB.
[2025-02-05 11:48:10,266 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 646.73ms. Allocated memory is still 142.6MB. Free memory was 110.7MB in the beginning and 79.2MB in the end (delta: 31.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB.
[2025-02-05 11:48:10,267 INFO  L158              Benchmark]: Boogie Procedure Inliner took 59.50ms. Allocated memory is still 142.6MB. Free memory was 79.2MB in the beginning and 69.8MB in the end (delta: 9.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2025-02-05 11:48:10,267 INFO  L158              Benchmark]: Boogie Preprocessor took 91.56ms. Allocated memory is still 142.6MB. Free memory was 69.8MB in the beginning and 59.0MB in the end (delta: 10.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2025-02-05 11:48:10,267 INFO  L158              Benchmark]: IcfgBuilder took 1083.39ms. Allocated memory is still 142.6MB. Free memory was 59.0MB in the beginning and 69.9MB in the end (delta: -10.9MB). Peak memory consumption was 42.0MB. Max. memory is 16.1GB.
[2025-02-05 11:48:10,267 INFO  L158              Benchmark]: TraceAbstraction took 16991.07ms. Allocated memory was 142.6MB in the beginning and 587.2MB in the end (delta: 444.6MB). Free memory was 69.0MB in the beginning and 524.1MB in the end (delta: -455.1MB). Peak memory consumption was 313.7MB. Max. memory is 16.1GB.
[2025-02-05 11:48:10,268 INFO  L158              Benchmark]: Witness Printer took 128.50ms. Allocated memory is still 587.2MB. Free memory was 524.1MB in the beginning and 511.5MB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2025-02-05 11:48:10,269 INFO  L338   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 124.7MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 646.73ms. Allocated memory is still 142.6MB. Free memory was 110.7MB in the beginning and 79.2MB in the end (delta: 31.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 59.50ms. Allocated memory is still 142.6MB. Free memory was 79.2MB in the beginning and 69.8MB in the end (delta: 9.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
 * Boogie Preprocessor took 91.56ms. Allocated memory is still 142.6MB. Free memory was 69.8MB in the beginning and 59.0MB in the end (delta: 10.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
 * IcfgBuilder took 1083.39ms. Allocated memory is still 142.6MB. Free memory was 59.0MB in the beginning and 69.9MB in the end (delta: -10.9MB). Peak memory consumption was 42.0MB. Max. memory is 16.1GB.
 * TraceAbstraction took 16991.07ms. Allocated memory was 142.6MB in the beginning and 587.2MB in the end (delta: 444.6MB). Free memory was 69.0MB in the beginning and 524.1MB in the end (delta: -455.1MB). Peak memory consumption was 313.7MB. Max. memory is 16.1GB.
 * Witness Printer took 128.50ms. Allocated memory is still 587.2MB. Free memory was 524.1MB in the beginning and 511.5MB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: ErrorAutomatonStatistics
    NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0
  - PositiveResult [Line: 173]: a call to reach_error is unreachable
    For all program executions holds that a call to reach_error is unreachable at this location
  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 1 procedures, 245 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 16.6s, OverallIterations: 15, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 9.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2239 SdHoareTripleChecker+Valid, 8.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2239 mSDsluCounter, 1854 SdHoareTripleChecker+Invalid, 6.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 87 mSDsCounter, 979 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8114 IncrementalHoareTripleChecker+Invalid, 9093 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 979 mSolverCounterUnsat, 1767 mSDtfsCounter, 8114 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2282 GetRequests, 2256 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4098occurred in iteration=14, InterpolantAutomatonStates: 49, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 15 MinimizatonAttempts, 3210 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 8088 NumberOfCodeBlocks, 8088 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 8070 ConstructedInterpolants, 0 QuantifiedInterpolants, 15205 SizeOfPredicates, 0 NumberOfNonLiveVariables, 2760 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 18 InterpolantComputations, 15 PerfectInterpolantSequences, 15024/15444 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available
  - AllSpecificationsHoldResult: All specifications hold
    1 specifications checked. All of them hold
  - InvariantResult [Line: 890]: Location Invariant
    Derived location invariant: ((((((((a24 == 1) && (10 <= a21)) || ((a21 == 8) && (a24 == 1))) || ((a24 == 1) && (12 <= a12))) || (((a24 == 1) && (a15 <= 8)) && (a21 <= 6))) || (((7 <= a15) && (a24 == 1)) && (a15 <= 8))) || (((a15 <= 8) && (a21 <= 6)) && (((long long) 49 + a12) <= 0))) || (((a24 == 1) && (a15 <= 8)) && (a21 == 9)))
RESULT: Ultimate proved your program to be correct!
[2025-02-05 11:48:10,283 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0
Received shutdown request...
--- End real Ultimate output ---

Execution finished normally
Writing output log to file Ultimate.log
Result:
TRUE