./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_vMiim_p1.c --full-output --architecture 64bit


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


Checking for ERROR reachability
Using default analysis
Version 48c9605d
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/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_vMiim_p1.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash c13079d4927c37ef7c4e12e861d352aca7538cf90caea314288bdceb904b4d72
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-48c9605-m
[2025-02-08 00:11:49,376 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-02-08 00:11:49,430 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf
[2025-02-08 00:11:49,434 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-02-08 00:11:49,434 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-02-08 00:11:49,448 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-02-08 00:11:49,449 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-02-08 00:11:49,449 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-02-08 00:11:49,449 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-02-08 00:11:49,449 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-02-08 00:11:49,449 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-02-08 00:11:49,449 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-02-08 00:11:49,449 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-02-08 00:11:49,450 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-02-08 00:11:49,450 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-02-08 00:11:49,450 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-02-08 00:11:49,450 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-02-08 00:11:49,450 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-02-08 00:11:49,450 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-02-08 00:11:49,450 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-02-08 00:11:49,450 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-02-08 00:11:49,450 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-02-08 00:11:49,452 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-02-08 00:11:49,452 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-02-08 00:11:49,452 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-02-08 00:11:49,452 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-02-08 00:11:49,452 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-02-08 00:11:49,452 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-02-08 00:11:49,452 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-02-08 00:11:49,453 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-02-08 00:11:49,453 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-02-08 00:11:49,453 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-02-08 00:11:49,453 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-02-08 00:11:49,453 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-02-08 00:11:49,453 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-02-08 00:11:49,453 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-02-08 00:11:49,453 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-02-08 00:11:49,453 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-02-08 00:11:49,453 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-02-08 00:11:49,453 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-02-08 00:11:49,454 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 -> 64bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c13079d4927c37ef7c4e12e861d352aca7538cf90caea314288bdceb904b4d72
[2025-02-08 00:11:49,705 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-02-08 00:11:49,721 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-02-08 00:11:49,724 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-02-08 00:11:49,725 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-02-08 00:11:49,725 INFO  L274        PluginConnector]: CDTParser initialized
[2025-02-08 00:11:49,727 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_vMiim_p1.c
[2025-02-08 00:11:51,027 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/077618c09/ace5f9a82c5d407fa88c65d087729a52/FLAG9f2f82d04
[2025-02-08 00:11:51,307 INFO  L384              CDTParser]: Found 1 translation units.
[2025-02-08 00:11:51,308 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_vMiim_p1.c
[2025-02-08 00:11:51,316 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/077618c09/ace5f9a82c5d407fa88c65d087729a52/FLAG9f2f82d04
[2025-02-08 00:11:51,607 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/077618c09/ace5f9a82c5d407fa88c65d087729a52
[2025-02-08 00:11:51,608 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-02-08 00:11:51,609 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-02-08 00:11:51,610 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-02-08 00:11:51,610 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-02-08 00:11:51,613 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-02-08 00:11:51,614 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 12:11:51" (1/1) ...
[2025-02-08 00:11:51,614 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@368dfe1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:11:51, skipping insertion in model container
[2025-02-08 00:11:51,614 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 12:11:51" (1/1) ...
[2025-02-08 00:11:51,634 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-02-08 00:11:51,723 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/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_vMiim_p1.c[1258,1271]
[2025-02-08 00:11:51,827 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-08 00:11:51,834 INFO  L200         MainTranslator]: Completed pre-run
[2025-02-08 00:11:51,840 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/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_vMiim_p1.c[1258,1271]
[2025-02-08 00:11:51,903 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-08 00:11:51,911 INFO  L204         MainTranslator]: Completed translation
[2025-02-08 00:11:51,911 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:11:51 WrapperNode
[2025-02-08 00:11:51,912 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-02-08 00:11:51,912 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-02-08 00:11:51,912 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-02-08 00:11:51,912 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-02-08 00:11:51,916 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:11:51" (1/1) ...
[2025-02-08 00:11:51,931 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:11:51" (1/1) ...
[2025-02-08 00:11:52,009 INFO  L138                Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1475
[2025-02-08 00:11:52,010 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-02-08 00:11:52,010 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-02-08 00:11:52,011 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-02-08 00:11:52,011 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-02-08 00:11:52,016 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:11:51" (1/1) ...
[2025-02-08 00:11:52,017 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:11:51" (1/1) ...
[2025-02-08 00:11:52,031 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:11:51" (1/1) ...
[2025-02-08 00:11:52,064 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-08 00:11:52,064 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:11:51" (1/1) ...
[2025-02-08 00:11:52,064 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:11:51" (1/1) ...
[2025-02-08 00:11:52,150 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:11:51" (1/1) ...
[2025-02-08 00:11:52,160 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:11:51" (1/1) ...
[2025-02-08 00:11:52,178 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:11:51" (1/1) ...
[2025-02-08 00:11:52,195 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:11:51" (1/1) ...
[2025-02-08 00:11:52,234 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-02-08 00:11:52,235 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-02-08 00:11:52,235 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-02-08 00:11:52,235 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-02-08 00:11:52,236 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:11:51" (1/1) ...
[2025-02-08 00:11:52,241 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-02-08 00:11:52,249 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-08 00:11:52,262 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-08 00:11:52,266 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-08 00:11:52,281 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-02-08 00:11:52,281 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-02-08 00:11:52,281 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-02-08 00:11:52,282 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-02-08 00:11:52,445 INFO  L257             CfgBuilder]: Building ICFG
[2025-02-08 00:11:52,446 INFO  L287             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-02-08 00:11:53,702 INFO  L?                        ?]: Removed 721 outVars from TransFormulas that were not future-live.
[2025-02-08 00:11:53,702 INFO  L308             CfgBuilder]: Performing block encoding
[2025-02-08 00:11:53,771 INFO  L332             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-02-08 00:11:53,771 INFO  L337             CfgBuilder]: Removed 0 assume(true) statements.
[2025-02-08 00:11:53,771 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:11:53 BoogieIcfgContainer
[2025-02-08 00:11:53,772 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-02-08 00:11:53,773 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-02-08 00:11:53,773 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-02-08 00:11:53,777 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-02-08 00:11:53,777 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 12:11:51" (1/3) ...
[2025-02-08 00:11:53,779 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@217af934 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 12:11:53, skipping insertion in model container
[2025-02-08 00:11:53,779 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:11:51" (2/3) ...
[2025-02-08 00:11:53,779 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@217af934 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 12:11:53, skipping insertion in model container
[2025-02-08 00:11:53,779 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:11:53" (3/3) ...
[2025-02-08 00:11:53,780 INFO  L128   eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_QF_BV_vMiim_p1.c
[2025-02-08 00:11:53,801 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-02-08 00:11:53,804 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vis_QF_BV_vMiim_p1.c that has 1 procedures, 344 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-02-08 00:11:53,891 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-02-08 00:11:53,916 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;@78160ee4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-02-08 00:11:53,917 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-02-08 00:11:53,923 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 344 states, 342 states have (on average 1.5) internal successors, (513), 343 states have internal predecessors, (513), 0 states have call successors, (0), 0 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-08 00:11:53,931 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 85
[2025-02-08 00:11:53,932 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-08 00:11:53,932 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, 1, 1, 1, 1, 1, 1, 1, 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-08 00:11:53,933 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-08 00:11:53,938 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 00:11:53,938 INFO  L85        PathProgramCache]: Analyzing trace with hash -205512100, now seen corresponding path program 1 times
[2025-02-08 00:11:53,946 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 00:11:53,947 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492082367]
[2025-02-08 00:11:53,947 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-08 00:11:53,947 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 00:11:54,034 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes.
[2025-02-08 00:11:54,189 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements.
[2025-02-08 00:11:54,191 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 00:11:54,191 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-08 00:11:55,131 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-08 00:11:55,132 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-08 00:11:55,132 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492082367]
[2025-02-08 00:11:55,132 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492082367] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-08 00:11:55,133 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-08 00:11:55,133 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-02-08 00:11:55,134 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239474844]
[2025-02-08 00:11:55,135 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-08 00:11:55,137 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-02-08 00:11:55,138 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-08 00:11:55,158 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-02-08 00:11:55,160 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2025-02-08 00:11:55,162 INFO  L87              Difference]: Start difference. First operand  has 344 states, 342 states have (on average 1.5) internal successors, (513), 343 states have internal predecessors, (513), 0 states have call successors, (0), 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 8 states, 8 states have (on average 10.5) internal successors, (84), 7 states have internal predecessors, (84), 0 states have call successors, (0), 0 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-08 00:11:55,745 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-08 00:11:55,746 INFO  L93              Difference]: Finished difference Result 588 states and 880 transitions.
[2025-02-08 00:11:55,749 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-02-08 00:11:55,751 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 10.5) internal successors, (84), 7 states have internal predecessors, (84), 0 states have call successors, (0), 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 84
[2025-02-08 00:11:55,751 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-08 00:11:55,760 INFO  L225             Difference]: With dead ends: 588
[2025-02-08 00:11:55,760 INFO  L226             Difference]: Without dead ends: 369
[2025-02-08 00:11:55,762 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156
[2025-02-08 00:11:55,764 INFO  L435           NwaCegarLoop]: 408 mSDtfsCounter, 512 mSDsluCounter, 2035 mSDsCounter, 0 mSdLazyCounter, 616 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 512 SdHoareTripleChecker+Valid, 2443 SdHoareTripleChecker+Invalid, 618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-02-08 00:11:55,765 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [512 Valid, 2443 Invalid, 618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 616 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-02-08 00:11:55,777 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 369 states.
[2025-02-08 00:11:55,805 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 368.
[2025-02-08 00:11:55,807 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 368 states, 367 states have (on average 1.4904632152588555) internal successors, (547), 367 states have internal predecessors, (547), 0 states have call successors, (0), 0 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-08 00:11:55,812 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 547 transitions.
[2025-02-08 00:11:55,814 INFO  L78                 Accepts]: Start accepts. Automaton has 368 states and 547 transitions. Word has length 84
[2025-02-08 00:11:55,814 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-08 00:11:55,814 INFO  L471      AbstractCegarLoop]: Abstraction has 368 states and 547 transitions.
[2025-02-08 00:11:55,815 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.5) internal successors, (84), 7 states have internal predecessors, (84), 0 states have call successors, (0), 0 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-08 00:11:55,815 INFO  L276                IsEmpty]: Start isEmpty. Operand 368 states and 547 transitions.
[2025-02-08 00:11:55,817 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 86
[2025-02-08 00:11:55,817 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-08 00:11:55,817 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, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 00:11:55,818 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2025-02-08 00:11:55,818 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-08 00:11:55,818 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 00:11:55,818 INFO  L85        PathProgramCache]: Analyzing trace with hash 2026632265, now seen corresponding path program 1 times
[2025-02-08 00:11:55,819 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 00:11:55,819 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635569228]
[2025-02-08 00:11:55,819 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-08 00:11:55,819 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 00:11:55,856 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes.
[2025-02-08 00:11:55,876 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements.
[2025-02-08 00:11:55,877 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 00:11:55,877 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-08 00:11:56,139 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-08 00:11:56,140 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-08 00:11:56,140 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635569228]
[2025-02-08 00:11:56,140 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635569228] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-08 00:11:56,140 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-08 00:11:56,140 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-08 00:11:56,140 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815245164]
[2025-02-08 00:11:56,140 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-08 00:11:56,141 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-08 00:11:56,142 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-08 00:11:56,142 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-08 00:11:56,142 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-08 00:11:56,142 INFO  L87              Difference]: Start difference. First operand 368 states and 547 transitions. Second operand  has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 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-08 00:11:56,292 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-08 00:11:56,292 INFO  L93              Difference]: Finished difference Result 372 states and 551 transitions.
[2025-02-08 00:11:56,292 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-08 00:11:56,292 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 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 85
[2025-02-08 00:11:56,293 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-08 00:11:56,294 INFO  L225             Difference]: With dead ends: 372
[2025-02-08 00:11:56,297 INFO  L226             Difference]: Without dead ends: 370
[2025-02-08 00:11:56,297 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-08 00:11:56,298 INFO  L435           NwaCegarLoop]: 424 mSDtfsCounter, 0 mSDsluCounter, 843 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1267 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-02-08 00:11:56,299 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1267 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-02-08 00:11:56,300 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 370 states.
[2025-02-08 00:11:56,315 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 370.
[2025-02-08 00:11:56,316 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 370 states, 369 states have (on average 1.4878048780487805) internal successors, (549), 369 states have internal predecessors, (549), 0 states have call successors, (0), 0 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-08 00:11:56,318 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 549 transitions.
[2025-02-08 00:11:56,319 INFO  L78                 Accepts]: Start accepts. Automaton has 370 states and 549 transitions. Word has length 85
[2025-02-08 00:11:56,320 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-08 00:11:56,320 INFO  L471      AbstractCegarLoop]: Abstraction has 370 states and 549 transitions.
[2025-02-08 00:11:56,320 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 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-08 00:11:56,320 INFO  L276                IsEmpty]: Start isEmpty. Operand 370 states and 549 transitions.
[2025-02-08 00:11:56,321 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 87
[2025-02-08 00:11:56,323 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-08 00:11:56,324 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 00:11:56,324 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-02-08 00:11:56,324 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-08 00:11:56,324 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 00:11:56,324 INFO  L85        PathProgramCache]: Analyzing trace with hash -1594229774, now seen corresponding path program 1 times
[2025-02-08 00:11:56,324 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 00:11:56,324 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480577101]
[2025-02-08 00:11:56,324 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-08 00:11:56,325 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 00:11:56,355 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes.
[2025-02-08 00:11:56,402 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements.
[2025-02-08 00:11:56,402 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 00:11:56,402 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-08 00:11:56,533 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-08 00:11:56,533 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-08 00:11:56,533 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480577101]
[2025-02-08 00:11:56,534 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480577101] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-08 00:11:56,534 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-08 00:11:56,534 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-08 00:11:56,534 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394164631]
[2025-02-08 00:11:56,534 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-08 00:11:56,534 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-08 00:11:56,535 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-08 00:11:56,535 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-08 00:11:56,535 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-08 00:11:56,535 INFO  L87              Difference]: Start difference. First operand 370 states and 549 transitions. Second operand  has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-08 00:11:56,702 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-08 00:11:56,702 INFO  L93              Difference]: Finished difference Result 591 states and 877 transitions.
[2025-02-08 00:11:56,703 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-08 00:11:56,703 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86
[2025-02-08 00:11:56,703 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-08 00:11:56,704 INFO  L225             Difference]: With dead ends: 591
[2025-02-08 00:11:56,704 INFO  L226             Difference]: Without dead ends: 372
[2025-02-08 00:11:56,705 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-08 00:11:56,705 INFO  L435           NwaCegarLoop]: 424 mSDtfsCounter, 0 mSDsluCounter, 840 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1264 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-02-08 00:11:56,705 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1264 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-02-08 00:11:56,706 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 372 states.
[2025-02-08 00:11:56,723 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 372.
[2025-02-08 00:11:56,724 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 372 states, 371 states have (on average 1.4851752021563343) internal successors, (551), 371 states have internal predecessors, (551), 0 states have call successors, (0), 0 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-08 00:11:56,725 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 551 transitions.
[2025-02-08 00:11:56,725 INFO  L78                 Accepts]: Start accepts. Automaton has 372 states and 551 transitions. Word has length 86
[2025-02-08 00:11:56,729 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-08 00:11:56,730 INFO  L471      AbstractCegarLoop]: Abstraction has 372 states and 551 transitions.
[2025-02-08 00:11:56,730 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-08 00:11:56,730 INFO  L276                IsEmpty]: Start isEmpty. Operand 372 states and 551 transitions.
[2025-02-08 00:11:56,731 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 88
[2025-02-08 00:11:56,731 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-08 00:11:56,731 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 00:11:56,731 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-02-08 00:11:56,731 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-08 00:11:56,731 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 00:11:56,732 INFO  L85        PathProgramCache]: Analyzing trace with hash -244973212, now seen corresponding path program 1 times
[2025-02-08 00:11:56,732 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 00:11:56,732 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074348559]
[2025-02-08 00:11:56,732 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-08 00:11:56,732 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 00:11:56,768 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes.
[2025-02-08 00:11:56,800 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements.
[2025-02-08 00:11:56,803 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 00:11:56,804 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-08 00:11:57,184 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-08 00:11:57,184 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-08 00:11:57,184 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074348559]
[2025-02-08 00:11:57,184 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074348559] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-08 00:11:57,184 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-08 00:11:57,184 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-02-08 00:11:57,185 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967150780]
[2025-02-08 00:11:57,185 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-08 00:11:57,185 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-02-08 00:11:57,185 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-08 00:11:57,185 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-02-08 00:11:57,185 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2025-02-08 00:11:57,186 INFO  L87              Difference]: Start difference. First operand 372 states and 551 transitions. Second operand  has 8 states, 8 states have (on average 10.875) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 0 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-08 00:11:57,593 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-08 00:11:57,594 INFO  L93              Difference]: Finished difference Result 601 states and 890 transitions.
[2025-02-08 00:11:57,594 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-02-08 00:11:57,594 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 10.875) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 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 87
[2025-02-08 00:11:57,594 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-08 00:11:57,596 INFO  L225             Difference]: With dead ends: 601
[2025-02-08 00:11:57,596 INFO  L226             Difference]: Without dead ends: 380
[2025-02-08 00:11:57,596 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156
[2025-02-08 00:11:57,597 INFO  L435           NwaCegarLoop]: 406 mSDtfsCounter, 517 mSDsluCounter, 2024 mSDsCounter, 0 mSdLazyCounter, 629 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 517 SdHoareTripleChecker+Valid, 2430 SdHoareTripleChecker+Invalid, 630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-02-08 00:11:57,597 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [517 Valid, 2430 Invalid, 630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 629 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-02-08 00:11:57,598 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 380 states.
[2025-02-08 00:11:57,602 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 378.
[2025-02-08 00:11:57,602 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 378 states, 377 states have (on average 1.4854111405835544) internal successors, (560), 377 states have internal predecessors, (560), 0 states have call successors, (0), 0 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-08 00:11:57,603 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 560 transitions.
[2025-02-08 00:11:57,603 INFO  L78                 Accepts]: Start accepts. Automaton has 378 states and 560 transitions. Word has length 87
[2025-02-08 00:11:57,604 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-08 00:11:57,604 INFO  L471      AbstractCegarLoop]: Abstraction has 378 states and 560 transitions.
[2025-02-08 00:11:57,604 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.875) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 0 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-08 00:11:57,604 INFO  L276                IsEmpty]: Start isEmpty. Operand 378 states and 560 transitions.
[2025-02-08 00:11:57,604 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 89
[2025-02-08 00:11:57,605 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-08 00:11:57,605 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 00:11:57,605 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-02-08 00:11:57,605 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-08 00:11:57,605 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 00:11:57,605 INFO  L85        PathProgramCache]: Analyzing trace with hash 894690968, now seen corresponding path program 1 times
[2025-02-08 00:11:57,606 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 00:11:57,606 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901650442]
[2025-02-08 00:11:57,606 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-08 00:11:57,606 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 00:11:57,625 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes.
[2025-02-08 00:11:57,639 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements.
[2025-02-08 00:11:57,639 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 00:11:57,639 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-08 00:11:57,897 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-08 00:11:57,897 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-08 00:11:57,897 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901650442]
[2025-02-08 00:11:57,898 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901650442] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-08 00:11:57,898 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-08 00:11:57,898 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-02-08 00:11:57,898 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283616268]
[2025-02-08 00:11:57,898 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-08 00:11:57,898 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-02-08 00:11:57,898 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-08 00:11:57,899 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-02-08 00:11:57,899 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2025-02-08 00:11:57,899 INFO  L87              Difference]: Start difference. First operand 378 states and 560 transitions. Second operand  has 8 states, 8 states have (on average 11.0) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 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-08 00:11:58,259 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-08 00:11:58,259 INFO  L93              Difference]: Finished difference Result 600 states and 888 transitions.
[2025-02-08 00:11:58,260 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-02-08 00:11:58,260 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 11.0) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 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 88
[2025-02-08 00:11:58,260 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-08 00:11:58,262 INFO  L225             Difference]: With dead ends: 600
[2025-02-08 00:11:58,262 INFO  L226             Difference]: Without dead ends: 378
[2025-02-08 00:11:58,262 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156
[2025-02-08 00:11:58,267 INFO  L435           NwaCegarLoop]: 409 mSDtfsCounter, 513 mSDsluCounter, 2037 mSDsCounter, 0 mSdLazyCounter, 613 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 513 SdHoareTripleChecker+Valid, 2446 SdHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-02-08 00:11:58,267 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [513 Valid, 2446 Invalid, 614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 613 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-02-08 00:11:58,268 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 378 states.
[2025-02-08 00:11:58,272 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 377.
[2025-02-08 00:11:58,273 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 377 states, 376 states have (on average 1.4840425531914894) internal successors, (558), 376 states have internal predecessors, (558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-08 00:11:58,274 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 558 transitions.
[2025-02-08 00:11:58,274 INFO  L78                 Accepts]: Start accepts. Automaton has 377 states and 558 transitions. Word has length 88
[2025-02-08 00:11:58,274 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-08 00:11:58,274 INFO  L471      AbstractCegarLoop]: Abstraction has 377 states and 558 transitions.
[2025-02-08 00:11:58,274 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 11.0) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 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-08 00:11:58,275 INFO  L276                IsEmpty]: Start isEmpty. Operand 377 states and 558 transitions.
[2025-02-08 00:11:58,275 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 90
[2025-02-08 00:11:58,275 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-08 00:11:58,275 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 00:11:58,275 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-02-08 00:11:58,276 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-08 00:11:58,276 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 00:11:58,276 INFO  L85        PathProgramCache]: Analyzing trace with hash -94956267, now seen corresponding path program 1 times
[2025-02-08 00:11:58,276 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 00:11:58,276 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296063501]
[2025-02-08 00:11:58,276 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-08 00:11:58,276 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 00:11:58,298 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes.
[2025-02-08 00:11:58,320 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements.
[2025-02-08 00:11:58,320 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 00:11:58,320 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-08 00:11:58,995 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-08 00:11:58,996 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-08 00:11:58,996 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296063501]
[2025-02-08 00:11:58,996 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296063501] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-08 00:11:58,996 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-08 00:11:58,996 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2025-02-08 00:11:58,996 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621596127]
[2025-02-08 00:11:58,996 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-08 00:11:58,996 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2025-02-08 00:11:58,999 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-08 00:11:58,999 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2025-02-08 00:11:59,000 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110
[2025-02-08 00:11:59,000 INFO  L87              Difference]: Start difference. First operand 377 states and 558 transitions. Second operand  has 11 states, 11 states have (on average 8.090909090909092) internal successors, (89), 10 states have internal predecessors, (89), 0 states have call successors, (0), 0 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-08 00:11:59,618 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-08 00:11:59,619 INFO  L93              Difference]: Finished difference Result 604 states and 893 transitions.
[2025-02-08 00:11:59,619 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2025-02-08 00:11:59,619 INFO  L78                 Accepts]: Start accepts. Automaton has  has 11 states, 11 states have (on average 8.090909090909092) internal successors, (89), 10 states have internal predecessors, (89), 0 states have call successors, (0), 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 89
[2025-02-08 00:11:59,619 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-08 00:11:59,621 INFO  L225             Difference]: With dead ends: 604
[2025-02-08 00:11:59,621 INFO  L226             Difference]: Without dead ends: 383
[2025-02-08 00:11:59,621 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306
[2025-02-08 00:11:59,622 INFO  L435           NwaCegarLoop]: 405 mSDtfsCounter, 536 mSDsluCounter, 2821 mSDsCounter, 0 mSdLazyCounter, 852 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 536 SdHoareTripleChecker+Valid, 3226 SdHoareTripleChecker+Invalid, 855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 852 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-02-08 00:11:59,622 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [536 Valid, 3226 Invalid, 855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 852 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-02-08 00:11:59,623 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 383 states.
[2025-02-08 00:11:59,627 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 381.
[2025-02-08 00:11:59,628 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 381 states, 380 states have (on average 1.481578947368421) internal successors, (563), 380 states have internal predecessors, (563), 0 states have call successors, (0), 0 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-08 00:11:59,629 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 563 transitions.
[2025-02-08 00:11:59,629 INFO  L78                 Accepts]: Start accepts. Automaton has 381 states and 563 transitions. Word has length 89
[2025-02-08 00:11:59,629 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-08 00:11:59,629 INFO  L471      AbstractCegarLoop]: Abstraction has 381 states and 563 transitions.
[2025-02-08 00:11:59,629 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 8.090909090909092) internal successors, (89), 10 states have internal predecessors, (89), 0 states have call successors, (0), 0 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-08 00:11:59,629 INFO  L276                IsEmpty]: Start isEmpty. Operand 381 states and 563 transitions.
[2025-02-08 00:11:59,630 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 91
[2025-02-08 00:11:59,630 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-08 00:11:59,630 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 00:11:59,630 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-02-08 00:11:59,630 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-08 00:11:59,630 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 00:11:59,631 INFO  L85        PathProgramCache]: Analyzing trace with hash 1250248967, now seen corresponding path program 1 times
[2025-02-08 00:11:59,631 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 00:11:59,631 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457562927]
[2025-02-08 00:11:59,631 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-08 00:11:59,631 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 00:11:59,653 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes.
[2025-02-08 00:11:59,668 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements.
[2025-02-08 00:11:59,668 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 00:11:59,668 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-08 00:11:59,831 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-08 00:11:59,831 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-08 00:11:59,831 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457562927]
[2025-02-08 00:11:59,831 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457562927] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-08 00:11:59,831 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-08 00:11:59,831 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-02-08 00:11:59,831 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705781882]
[2025-02-08 00:11:59,831 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-08 00:11:59,831 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-02-08 00:11:59,831 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-08 00:11:59,832 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-02-08 00:11:59,832 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2025-02-08 00:11:59,832 INFO  L87              Difference]: Start difference. First operand 381 states and 563 transitions. Second operand  has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 6 states have internal predecessors, (90), 0 states have call successors, (0), 0 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-08 00:12:00,178 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-08 00:12:00,178 INFO  L93              Difference]: Finished difference Result 805 states and 1186 transitions.
[2025-02-08 00:12:00,179 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-02-08 00:12:00,179 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 6 states have internal predecessors, (90), 0 states have call successors, (0), 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 90
[2025-02-08 00:12:00,179 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-08 00:12:00,181 INFO  L225             Difference]: With dead ends: 805
[2025-02-08 00:12:00,181 INFO  L226             Difference]: Without dead ends: 568
[2025-02-08 00:12:00,181 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110
[2025-02-08 00:12:00,182 INFO  L435           NwaCegarLoop]: 407 mSDtfsCounter, 1068 mSDsluCounter, 1626 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1068 SdHoareTripleChecker+Valid, 2033 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-02-08 00:12:00,182 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1068 Valid, 2033 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 516 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-02-08 00:12:00,183 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 568 states.
[2025-02-08 00:12:00,189 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 382.
[2025-02-08 00:12:00,189 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 382 states, 381 states have (on average 1.4776902887139107) internal successors, (563), 381 states have internal predecessors, (563), 0 states have call successors, (0), 0 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-08 00:12:00,191 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 563 transitions.
[2025-02-08 00:12:00,191 INFO  L78                 Accepts]: Start accepts. Automaton has 382 states and 563 transitions. Word has length 90
[2025-02-08 00:12:00,192 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-08 00:12:00,192 INFO  L471      AbstractCegarLoop]: Abstraction has 382 states and 563 transitions.
[2025-02-08 00:12:00,192 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 6 states have internal predecessors, (90), 0 states have call successors, (0), 0 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-08 00:12:00,192 INFO  L276                IsEmpty]: Start isEmpty. Operand 382 states and 563 transitions.
[2025-02-08 00:12:00,193 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 92
[2025-02-08 00:12:00,193 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-08 00:12:00,193 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 00:12:00,193 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-02-08 00:12:00,193 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-08 00:12:00,193 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 00:12:00,193 INFO  L85        PathProgramCache]: Analyzing trace with hash 1440191678, now seen corresponding path program 1 times
[2025-02-08 00:12:00,193 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 00:12:00,194 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237210341]
[2025-02-08 00:12:00,194 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-08 00:12:00,194 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 00:12:00,212 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes.
[2025-02-08 00:12:00,223 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements.
[2025-02-08 00:12:00,223 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 00:12:00,223 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-08 00:12:00,397 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-08 00:12:00,397 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-08 00:12:00,397 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237210341]
[2025-02-08 00:12:00,398 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237210341] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-08 00:12:00,398 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-08 00:12:00,398 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-02-08 00:12:00,398 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250061134]
[2025-02-08 00:12:00,398 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-08 00:12:00,398 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-02-08 00:12:00,398 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-08 00:12:00,398 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-02-08 00:12:00,398 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2025-02-08 00:12:00,399 INFO  L87              Difference]: Start difference. First operand 382 states and 563 transitions. Second operand  has 7 states, 7 states have (on average 13.0) internal successors, (91), 6 states have internal predecessors, (91), 0 states have call successors, (0), 0 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-08 00:12:00,685 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-08 00:12:00,685 INFO  L93              Difference]: Finished difference Result 655 states and 958 transitions.
[2025-02-08 00:12:00,685 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-02-08 00:12:00,685 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 13.0) internal successors, (91), 6 states have internal predecessors, (91), 0 states have call successors, (0), 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 91
[2025-02-08 00:12:00,685 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-08 00:12:00,687 INFO  L225             Difference]: With dead ends: 655
[2025-02-08 00:12:00,687 INFO  L226             Difference]: Without dead ends: 413
[2025-02-08 00:12:00,688 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110
[2025-02-08 00:12:00,689 INFO  L435           NwaCegarLoop]: 410 mSDtfsCounter, 598 mSDsluCounter, 1638 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 598 SdHoareTripleChecker+Valid, 2048 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-02-08 00:12:00,689 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [598 Valid, 2048 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 501 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-02-08 00:12:00,691 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 413 states.
[2025-02-08 00:12:00,696 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 383.
[2025-02-08 00:12:00,696 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 383 states, 382 states have (on average 1.4738219895287958) internal successors, (563), 382 states have internal predecessors, (563), 0 states have call successors, (0), 0 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-08 00:12:00,698 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 563 transitions.
[2025-02-08 00:12:00,698 INFO  L78                 Accepts]: Start accepts. Automaton has 383 states and 563 transitions. Word has length 91
[2025-02-08 00:12:00,698 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-08 00:12:00,698 INFO  L471      AbstractCegarLoop]: Abstraction has 383 states and 563 transitions.
[2025-02-08 00:12:00,698 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 13.0) internal successors, (91), 6 states have internal predecessors, (91), 0 states have call successors, (0), 0 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-08 00:12:00,698 INFO  L276                IsEmpty]: Start isEmpty. Operand 383 states and 563 transitions.
[2025-02-08 00:12:00,699 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 93
[2025-02-08 00:12:00,699 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-08 00:12:00,700 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 00:12:00,700 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-02-08 00:12:00,701 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-08 00:12:00,702 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 00:12:00,702 INFO  L85        PathProgramCache]: Analyzing trace with hash -2003516254, now seen corresponding path program 1 times
[2025-02-08 00:12:00,702 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 00:12:00,702 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140401805]
[2025-02-08 00:12:00,702 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-08 00:12:00,702 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 00:12:00,724 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes.
[2025-02-08 00:12:00,743 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements.
[2025-02-08 00:12:00,744 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 00:12:00,744 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-08 00:12:00,934 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-08 00:12:00,935 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-08 00:12:00,935 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140401805]
[2025-02-08 00:12:00,935 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140401805] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-08 00:12:00,935 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-08 00:12:00,935 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-02-08 00:12:00,935 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817087350]
[2025-02-08 00:12:00,935 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-08 00:12:00,936 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-02-08 00:12:00,936 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-08 00:12:00,936 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-02-08 00:12:00,936 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2025-02-08 00:12:00,936 INFO  L87              Difference]: Start difference. First operand 383 states and 563 transitions. Second operand  has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 6 states have internal predecessors, (92), 0 states have call successors, (0), 0 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-08 00:12:01,317 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-08 00:12:01,317 INFO  L93              Difference]: Finished difference Result 685 states and 1000 transitions.
[2025-02-08 00:12:01,318 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-02-08 00:12:01,318 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 6 states have internal predecessors, (92), 0 states have call successors, (0), 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 92
[2025-02-08 00:12:01,318 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-08 00:12:01,319 INFO  L225             Difference]: With dead ends: 685
[2025-02-08 00:12:01,320 INFO  L226             Difference]: Without dead ends: 438
[2025-02-08 00:12:01,320 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110
[2025-02-08 00:12:01,320 INFO  L435           NwaCegarLoop]: 409 mSDtfsCounter, 668 mSDsluCounter, 1634 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 668 SdHoareTripleChecker+Valid, 2043 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-02-08 00:12:01,321 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [668 Valid, 2043 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-02-08 00:12:01,321 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 438 states.
[2025-02-08 00:12:01,328 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 384.
[2025-02-08 00:12:01,328 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 384 states, 383 states have (on average 1.4699738903394255) internal successors, (563), 383 states have internal predecessors, (563), 0 states have call successors, (0), 0 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-08 00:12:01,330 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 563 transitions.
[2025-02-08 00:12:01,330 INFO  L78                 Accepts]: Start accepts. Automaton has 384 states and 563 transitions. Word has length 92
[2025-02-08 00:12:01,330 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-08 00:12:01,330 INFO  L471      AbstractCegarLoop]: Abstraction has 384 states and 563 transitions.
[2025-02-08 00:12:01,330 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 6 states have internal predecessors, (92), 0 states have call successors, (0), 0 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-08 00:12:01,330 INFO  L276                IsEmpty]: Start isEmpty. Operand 384 states and 563 transitions.
[2025-02-08 00:12:01,331 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 94
[2025-02-08 00:12:01,331 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-08 00:12:01,331 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 00:12:01,331 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-02-08 00:12:01,331 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-08 00:12:01,334 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 00:12:01,334 INFO  L85        PathProgramCache]: Analyzing trace with hash -31584605, now seen corresponding path program 1 times
[2025-02-08 00:12:01,335 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 00:12:01,335 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554508272]
[2025-02-08 00:12:01,335 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-08 00:12:01,335 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 00:12:01,358 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes.
[2025-02-08 00:12:01,373 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements.
[2025-02-08 00:12:01,374 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 00:12:01,374 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-08 00:12:01,546 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-08 00:12:01,546 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-08 00:12:01,546 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554508272]
[2025-02-08 00:12:01,546 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554508272] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-08 00:12:01,546 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-08 00:12:01,547 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-02-08 00:12:01,547 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416474138]
[2025-02-08 00:12:01,547 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-08 00:12:01,547 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-02-08 00:12:01,547 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-08 00:12:01,548 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-02-08 00:12:01,548 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2025-02-08 00:12:01,548 INFO  L87              Difference]: Start difference. First operand 384 states and 563 transitions. Second operand  has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 6 states have internal predecessors, (93), 0 states have call successors, (0), 0 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-08 00:12:01,883 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-08 00:12:01,884 INFO  L93              Difference]: Finished difference Result 827 states and 1210 transitions.
[2025-02-08 00:12:01,884 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-02-08 00:12:01,884 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 6 states have internal predecessors, (93), 0 states have call successors, (0), 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 93
[2025-02-08 00:12:01,884 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-08 00:12:01,886 INFO  L225             Difference]: With dead ends: 827
[2025-02-08 00:12:01,886 INFO  L226             Difference]: Without dead ends: 575
[2025-02-08 00:12:01,887 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110
[2025-02-08 00:12:01,887 INFO  L435           NwaCegarLoop]: 410 mSDtfsCounter, 1074 mSDsluCounter, 1638 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1074 SdHoareTripleChecker+Valid, 2048 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-02-08 00:12:01,887 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1074 Valid, 2048 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 501 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-02-08 00:12:01,888 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 575 states.
[2025-02-08 00:12:01,893 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 385.
[2025-02-08 00:12:01,894 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 385 states, 384 states have (on average 1.4661458333333333) internal successors, (563), 384 states have internal predecessors, (563), 0 states have call successors, (0), 0 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-08 00:12:01,895 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 563 transitions.
[2025-02-08 00:12:01,895 INFO  L78                 Accepts]: Start accepts. Automaton has 385 states and 563 transitions. Word has length 93
[2025-02-08 00:12:01,895 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-08 00:12:01,895 INFO  L471      AbstractCegarLoop]: Abstraction has 385 states and 563 transitions.
[2025-02-08 00:12:01,895 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 6 states have internal predecessors, (93), 0 states have call successors, (0), 0 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-08 00:12:01,896 INFO  L276                IsEmpty]: Start isEmpty. Operand 385 states and 563 transitions.
[2025-02-08 00:12:01,896 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 95
[2025-02-08 00:12:01,896 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-08 00:12:01,896 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 00:12:01,896 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-02-08 00:12:01,896 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-08 00:12:01,897 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 00:12:01,897 INFO  L85        PathProgramCache]: Analyzing trace with hash -568438467, now seen corresponding path program 1 times
[2025-02-08 00:12:01,897 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 00:12:01,897 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830495315]
[2025-02-08 00:12:01,897 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-08 00:12:01,897 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 00:12:01,919 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes.
[2025-02-08 00:12:01,931 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements.
[2025-02-08 00:12:01,932 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 00:12:01,932 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-08 00:12:02,081 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-08 00:12:02,082 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-08 00:12:02,082 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830495315]
[2025-02-08 00:12:02,083 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830495315] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-08 00:12:02,083 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-08 00:12:02,083 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-08 00:12:02,083 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933155373]
[2025-02-08 00:12:02,083 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-08 00:12:02,084 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-08 00:12:02,084 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-08 00:12:02,084 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-08 00:12:02,084 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-02-08 00:12:02,084 INFO  L87              Difference]: Start difference. First operand 385 states and 563 transitions. Second operand  has 5 states, 5 states have (on average 18.8) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 0 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-08 00:12:02,296 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-08 00:12:02,296 INFO  L93              Difference]: Finished difference Result 798 states and 1170 transitions.
[2025-02-08 00:12:02,296 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-08 00:12:02,297 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 18.8) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 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 94
[2025-02-08 00:12:02,297 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-08 00:12:02,299 INFO  L225             Difference]: With dead ends: 798
[2025-02-08 00:12:02,299 INFO  L226             Difference]: Without dead ends: 546
[2025-02-08 00:12:02,299 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2025-02-08 00:12:02,300 INFO  L435           NwaCegarLoop]: 414 mSDtfsCounter, 1025 mSDsluCounter, 825 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1025 SdHoareTripleChecker+Valid, 1239 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-02-08 00:12:02,300 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1025 Valid, 1239 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-02-08 00:12:02,302 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 546 states.
[2025-02-08 00:12:02,308 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 365.
[2025-02-08 00:12:02,308 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 365 states, 364 states have (on average 1.4697802197802199) internal successors, (535), 364 states have internal predecessors, (535), 0 states have call successors, (0), 0 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-08 00:12:02,310 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 535 transitions.
[2025-02-08 00:12:02,310 INFO  L78                 Accepts]: Start accepts. Automaton has 365 states and 535 transitions. Word has length 94
[2025-02-08 00:12:02,310 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-08 00:12:02,310 INFO  L471      AbstractCegarLoop]: Abstraction has 365 states and 535 transitions.
[2025-02-08 00:12:02,310 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 18.8) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 0 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-08 00:12:02,311 INFO  L276                IsEmpty]: Start isEmpty. Operand 365 states and 535 transitions.
[2025-02-08 00:12:02,316 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 197
[2025-02-08 00:12:02,316 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-08 00:12:02,316 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 00:12:02,316 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-02-08 00:12:02,316 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-08 00:12:02,317 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 00:12:02,317 INFO  L85        PathProgramCache]: Analyzing trace with hash -2075185168, now seen corresponding path program 1 times
[2025-02-08 00:12:02,317 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 00:12:02,317 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892806616]
[2025-02-08 00:12:02,317 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-08 00:12:02,317 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 00:12:02,382 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes.
[2025-02-08 00:12:02,481 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements.
[2025-02-08 00:12:02,481 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 00:12:02,481 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-08 00:12:02,859 INFO  L134       CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-08 00:12:02,860 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-08 00:12:02,860 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892806616]
[2025-02-08 00:12:02,860 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892806616] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-08 00:12:02,860 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [565767312]
[2025-02-08 00:12:02,861 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-08 00:12:02,861 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-08 00:12:02,861 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-08 00:12:02,867 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-08 00:12:02,868 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-08 00:12:03,112 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes.
[2025-02-08 00:12:03,244 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements.
[2025-02-08 00:12:03,244 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 00:12:03,244 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-08 00:12:03,252 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1425 conjuncts, 8 conjuncts are in the unsatisfiable core
[2025-02-08 00:12:03,260 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-08 00:12:03,597 INFO  L134       CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-08 00:12:03,597 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-02-08 00:12:03,597 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [565767312] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-08 00:12:03,597 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-02-08 00:12:03,597 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6
[2025-02-08 00:12:03,597 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551679020]
[2025-02-08 00:12:03,597 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-08 00:12:03,598 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-08 00:12:03,598 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-08 00:12:03,598 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-08 00:12:03,598 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2025-02-08 00:12:03,599 INFO  L87              Difference]: Start difference. First operand 365 states and 535 transitions. Second operand  has 4 states, 4 states have (on average 49.0) internal successors, (196), 3 states have internal predecessors, (196), 0 states have call successors, (0), 0 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-08 00:12:03,939 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-08 00:12:03,939 INFO  L93              Difference]: Finished difference Result 585 states and 861 transitions.
[2025-02-08 00:12:03,941 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-08 00:12:03,942 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 49.0) internal successors, (196), 3 states have internal predecessors, (196), 0 states have call successors, (0), 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 196
[2025-02-08 00:12:03,942 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-08 00:12:03,943 INFO  L225             Difference]: With dead ends: 585
[2025-02-08 00:12:03,943 INFO  L226             Difference]: Without dead ends: 364
[2025-02-08 00:12:03,944 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56
[2025-02-08 00:12:03,944 INFO  L435           NwaCegarLoop]: 257 mSDtfsCounter, 388 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 500 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 388 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-02-08 00:12:03,944 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [388 Valid, 512 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 500 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-02-08 00:12:03,945 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 364 states.
[2025-02-08 00:12:03,949 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 364.
[2025-02-08 00:12:03,949 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 364 states, 363 states have (on average 1.465564738292011) internal successors, (532), 363 states have internal predecessors, (532), 0 states have call successors, (0), 0 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-08 00:12:03,950 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 532 transitions.
[2025-02-08 00:12:03,950 INFO  L78                 Accepts]: Start accepts. Automaton has 364 states and 532 transitions. Word has length 196
[2025-02-08 00:12:03,952 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-08 00:12:03,952 INFO  L471      AbstractCegarLoop]: Abstraction has 364 states and 532 transitions.
[2025-02-08 00:12:03,952 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 49.0) internal successors, (196), 3 states have internal predecessors, (196), 0 states have call successors, (0), 0 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-08 00:12:03,952 INFO  L276                IsEmpty]: Start isEmpty. Operand 364 states and 532 transitions.
[2025-02-08 00:12:03,953 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 198
[2025-02-08 00:12:03,953 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-08 00:12:03,954 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 00:12:03,964 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2025-02-08 00:12:04,156 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,SelfDestructingSolverStorable11
[2025-02-08 00:12:04,158 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-08 00:12:04,158 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 00:12:04,159 INFO  L85        PathProgramCache]: Analyzing trace with hash 877727139, now seen corresponding path program 1 times
[2025-02-08 00:12:04,159 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 00:12:04,159 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348073758]
[2025-02-08 00:12:04,159 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-08 00:12:04,159 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 00:12:04,228 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes.
[2025-02-08 00:12:04,787 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements.
[2025-02-08 00:12:04,788 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 00:12:04,788 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-08 00:12:05,133 INFO  L134       CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-08 00:12:05,133 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-08 00:12:05,133 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348073758]
[2025-02-08 00:12:05,133 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348073758] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-08 00:12:05,133 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-08 00:12:05,133 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-08 00:12:05,133 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489663146]
[2025-02-08 00:12:05,133 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-08 00:12:05,133 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-02-08 00:12:05,133 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-08 00:12:05,134 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-02-08 00:12:05,134 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-02-08 00:12:05,134 INFO  L87              Difference]: Start difference. First operand 364 states and 532 transitions. Second operand  has 6 states, 6 states have (on average 32.833333333333336) internal successors, (197), 5 states have internal predecessors, (197), 0 states have call successors, (0), 0 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-08 00:12:05,522 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-08 00:12:05,522 INFO  L93              Difference]: Finished difference Result 704 states and 1031 transitions.
[2025-02-08 00:12:05,522 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-02-08 00:12:05,523 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 32.833333333333336) internal successors, (197), 5 states have internal predecessors, (197), 0 states have call successors, (0), 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 197
[2025-02-08 00:12:05,524 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-08 00:12:05,525 INFO  L225             Difference]: With dead ends: 704
[2025-02-08 00:12:05,525 INFO  L226             Difference]: Without dead ends: 476
[2025-02-08 00:12:05,526 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72
[2025-02-08 00:12:05,526 INFO  L435           NwaCegarLoop]: 408 mSDtfsCounter, 787 mSDsluCounter, 1067 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 787 SdHoareTripleChecker+Valid, 1475 SdHoareTripleChecker+Invalid, 553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-02-08 00:12:05,526 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [787 Valid, 1475 Invalid, 553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 552 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-02-08 00:12:05,527 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 476 states.
[2025-02-08 00:12:05,532 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 430.
[2025-02-08 00:12:05,532 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 430 states, 429 states have (on average 1.4638694638694638) internal successors, (628), 429 states have internal predecessors, (628), 0 states have call successors, (0), 0 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-08 00:12:05,534 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 628 transitions.
[2025-02-08 00:12:05,534 INFO  L78                 Accepts]: Start accepts. Automaton has 430 states and 628 transitions. Word has length 197
[2025-02-08 00:12:05,534 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-08 00:12:05,534 INFO  L471      AbstractCegarLoop]: Abstraction has 430 states and 628 transitions.
[2025-02-08 00:12:05,534 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 32.833333333333336) internal successors, (197), 5 states have internal predecessors, (197), 0 states have call successors, (0), 0 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-08 00:12:05,534 INFO  L276                IsEmpty]: Start isEmpty. Operand 430 states and 628 transitions.
[2025-02-08 00:12:05,535 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 199
[2025-02-08 00:12:05,535 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-08 00:12:05,536 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 00:12:05,536 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2025-02-08 00:12:05,536 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-08 00:12:05,536 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 00:12:05,536 INFO  L85        PathProgramCache]: Analyzing trace with hash 1255298431, now seen corresponding path program 1 times
[2025-02-08 00:12:05,537 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 00:12:05,537 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417990415]
[2025-02-08 00:12:05,537 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-08 00:12:05,537 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 00:12:05,604 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes.
[2025-02-08 00:12:05,843 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements.
[2025-02-08 00:12:05,843 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 00:12:05,843 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-08 00:12:06,164 INFO  L134       CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-08 00:12:06,164 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-08 00:12:06,164 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417990415]
[2025-02-08 00:12:06,165 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417990415] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-08 00:12:06,165 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-08 00:12:06,165 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-08 00:12:06,165 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652982103]
[2025-02-08 00:12:06,165 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-08 00:12:06,166 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-02-08 00:12:06,166 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-08 00:12:06,166 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-02-08 00:12:06,166 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2025-02-08 00:12:06,167 INFO  L87              Difference]: Start difference. First operand 430 states and 628 transitions. Second operand  has 6 states, 6 states have (on average 33.0) internal successors, (198), 5 states have internal predecessors, (198), 0 states have call successors, (0), 0 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-08 00:12:06,767 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-08 00:12:06,767 INFO  L93              Difference]: Finished difference Result 834 states and 1216 transitions.
[2025-02-08 00:12:06,768 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-02-08 00:12:06,769 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 33.0) internal successors, (198), 5 states have internal predecessors, (198), 0 states have call successors, (0), 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 198
[2025-02-08 00:12:06,769 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-08 00:12:06,771 INFO  L225             Difference]: With dead ends: 834
[2025-02-08 00:12:06,771 INFO  L226             Difference]: Without dead ends: 614
[2025-02-08 00:12:06,771 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2025-02-08 00:12:06,772 INFO  L435           NwaCegarLoop]: 450 mSDtfsCounter, 985 mSDsluCounter, 967 mSDsCounter, 0 mSdLazyCounter, 802 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 985 SdHoareTripleChecker+Valid, 1417 SdHoareTripleChecker+Invalid, 808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 802 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-02-08 00:12:06,772 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [985 Valid, 1417 Invalid, 808 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 802 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-02-08 00:12:06,773 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 614 states.
[2025-02-08 00:12:06,779 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 541.
[2025-02-08 00:12:06,780 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 541 states, 540 states have (on average 1.4666666666666666) internal successors, (792), 540 states have internal predecessors, (792), 0 states have call successors, (0), 0 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-08 00:12:06,782 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 792 transitions.
[2025-02-08 00:12:06,782 INFO  L78                 Accepts]: Start accepts. Automaton has 541 states and 792 transitions. Word has length 198
[2025-02-08 00:12:06,782 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-08 00:12:06,782 INFO  L471      AbstractCegarLoop]: Abstraction has 541 states and 792 transitions.
[2025-02-08 00:12:06,782 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 33.0) internal successors, (198), 5 states have internal predecessors, (198), 0 states have call successors, (0), 0 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-08 00:12:06,783 INFO  L276                IsEmpty]: Start isEmpty. Operand 541 states and 792 transitions.
[2025-02-08 00:12:06,784 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 200
[2025-02-08 00:12:06,784 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-08 00:12:06,784 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 00:12:06,784 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2025-02-08 00:12:06,784 INFO  L396      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-08 00:12:06,785 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 00:12:06,785 INFO  L85        PathProgramCache]: Analyzing trace with hash 2126600945, now seen corresponding path program 1 times
[2025-02-08 00:12:06,785 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 00:12:06,785 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259270707]
[2025-02-08 00:12:06,785 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-08 00:12:06,785 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 00:12:06,835 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes.
[2025-02-08 00:12:07,060 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements.
[2025-02-08 00:12:07,060 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 00:12:07,060 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-08 00:12:07,544 INFO  L134       CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-08 00:12:07,544 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-08 00:12:07,544 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259270707]
[2025-02-08 00:12:07,545 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259270707] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-08 00:12:07,545 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-08 00:12:07,545 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-08 00:12:07,546 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717786507]
[2025-02-08 00:12:07,546 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-08 00:12:07,546 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-08 00:12:07,546 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-08 00:12:07,547 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-08 00:12:07,547 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-02-08 00:12:07,547 INFO  L87              Difference]: Start difference. First operand 541 states and 792 transitions. Second operand  has 5 states, 5 states have (on average 39.8) internal successors, (199), 4 states have internal predecessors, (199), 0 states have call successors, (0), 0 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-08 00:12:08,034 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-08 00:12:08,034 INFO  L93              Difference]: Finished difference Result 763 states and 1119 transitions.
[2025-02-08 00:12:08,035 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-08 00:12:08,035 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 39.8) internal successors, (199), 4 states have internal predecessors, (199), 0 states have call successors, (0), 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 199
[2025-02-08 00:12:08,035 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-08 00:12:08,037 INFO  L225             Difference]: With dead ends: 763
[2025-02-08 00:12:08,037 INFO  L226             Difference]: Without dead ends: 543
[2025-02-08 00:12:08,039 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2025-02-08 00:12:08,039 INFO  L435           NwaCegarLoop]: 248 mSDtfsCounter, 899 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 778 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 899 SdHoareTripleChecker+Valid, 742 SdHoareTripleChecker+Invalid, 778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-02-08 00:12:08,039 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [899 Valid, 742 Invalid, 778 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 778 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-02-08 00:12:08,040 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 543 states.
[2025-02-08 00:12:08,046 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 542.
[2025-02-08 00:12:08,047 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 542 states, 541 states have (on average 1.465804066543438) internal successors, (793), 541 states have internal predecessors, (793), 0 states have call successors, (0), 0 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-08 00:12:08,048 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 793 transitions.
[2025-02-08 00:12:08,048 INFO  L78                 Accepts]: Start accepts. Automaton has 542 states and 793 transitions. Word has length 199
[2025-02-08 00:12:08,048 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-08 00:12:08,049 INFO  L471      AbstractCegarLoop]: Abstraction has 542 states and 793 transitions.
[2025-02-08 00:12:08,049 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 39.8) internal successors, (199), 4 states have internal predecessors, (199), 0 states have call successors, (0), 0 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-08 00:12:08,049 INFO  L276                IsEmpty]: Start isEmpty. Operand 542 states and 793 transitions.
[2025-02-08 00:12:08,050 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 201
[2025-02-08 00:12:08,050 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-08 00:12:08,050 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 00:12:08,050 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2025-02-08 00:12:08,050 INFO  L396      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-08 00:12:08,051 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 00:12:08,051 INFO  L85        PathProgramCache]: Analyzing trace with hash 2019890703, now seen corresponding path program 1 times
[2025-02-08 00:12:08,051 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 00:12:08,051 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12509312]
[2025-02-08 00:12:08,051 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-08 00:12:08,051 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 00:12:08,110 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes.
[2025-02-08 00:12:08,402 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements.
[2025-02-08 00:12:08,403 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 00:12:08,403 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-08 00:12:08,688 INFO  L134       CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-08 00:12:08,688 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-08 00:12:08,688 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12509312]
[2025-02-08 00:12:08,689 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12509312] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-08 00:12:08,689 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-08 00:12:08,689 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-08 00:12:08,689 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532602287]
[2025-02-08 00:12:08,689 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-08 00:12:08,689 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-08 00:12:08,689 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-08 00:12:08,690 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-08 00:12:08,690 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-02-08 00:12:08,690 INFO  L87              Difference]: Start difference. First operand 542 states and 793 transitions. Second operand  has 5 states, 5 states have (on average 40.0) internal successors, (200), 4 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-08 00:12:09,236 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-08 00:12:09,237 INFO  L93              Difference]: Finished difference Result 872 states and 1279 transitions.
[2025-02-08 00:12:09,237 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-08 00:12:09,237 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 40.0) internal successors, (200), 4 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 200
[2025-02-08 00:12:09,238 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-08 00:12:09,239 INFO  L225             Difference]: With dead ends: 872
[2025-02-08 00:12:09,239 INFO  L226             Difference]: Without dead ends: 542
[2025-02-08 00:12:09,240 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2025-02-08 00:12:09,241 INFO  L435           NwaCegarLoop]: 251 mSDtfsCounter, 760 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 771 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 760 SdHoareTripleChecker+Valid, 749 SdHoareTripleChecker+Invalid, 771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 771 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-02-08 00:12:09,241 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [760 Valid, 749 Invalid, 771 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 771 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-02-08 00:12:09,242 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 542 states.
[2025-02-08 00:12:09,249 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 542.
[2025-02-08 00:12:09,250 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 542 states, 541 states have (on average 1.4639556377079483) internal successors, (792), 541 states have internal predecessors, (792), 0 states have call successors, (0), 0 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-08 00:12:09,251 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 792 transitions.
[2025-02-08 00:12:09,252 INFO  L78                 Accepts]: Start accepts. Automaton has 542 states and 792 transitions. Word has length 200
[2025-02-08 00:12:09,252 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-08 00:12:09,252 INFO  L471      AbstractCegarLoop]: Abstraction has 542 states and 792 transitions.
[2025-02-08 00:12:09,252 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 40.0) internal successors, (200), 4 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-08 00:12:09,252 INFO  L276                IsEmpty]: Start isEmpty. Operand 542 states and 792 transitions.
[2025-02-08 00:12:09,254 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 202
[2025-02-08 00:12:09,254 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-08 00:12:09,254 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 00:12:09,254 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2025-02-08 00:12:09,254 INFO  L396      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-08 00:12:09,255 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 00:12:09,255 INFO  L85        PathProgramCache]: Analyzing trace with hash 906617609, now seen corresponding path program 1 times
[2025-02-08 00:12:09,255 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 00:12:09,255 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329463490]
[2025-02-08 00:12:09,255 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-08 00:12:09,255 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 00:12:09,313 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes.
[2025-02-08 00:12:09,655 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements.
[2025-02-08 00:12:09,655 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 00:12:09,655 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-08 00:12:11,421 INFO  L134       CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-08 00:12:11,422 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-08 00:12:11,422 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329463490]
[2025-02-08 00:12:11,422 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329463490] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-08 00:12:11,423 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-08 00:12:11,423 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2025-02-08 00:12:11,423 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088729708]
[2025-02-08 00:12:11,423 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-08 00:12:11,423 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2025-02-08 00:12:11,423 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-08 00:12:11,424 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2025-02-08 00:12:11,425 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90
[2025-02-08 00:12:11,425 INFO  L87              Difference]: Start difference. First operand 542 states and 792 transitions. Second operand  has 10 states, 10 states have (on average 20.1) internal successors, (201), 9 states have internal predecessors, (201), 0 states have call successors, (0), 0 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-08 00:12:11,856 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-08 00:12:11,856 INFO  L93              Difference]: Finished difference Result 962 states and 1401 transitions.
[2025-02-08 00:12:11,856 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2025-02-08 00:12:11,857 INFO  L78                 Accepts]: Start accepts. Automaton has  has 10 states, 10 states have (on average 20.1) internal successors, (201), 9 states have internal predecessors, (201), 0 states have call successors, (0), 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 201
[2025-02-08 00:12:11,857 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-08 00:12:11,859 INFO  L225             Difference]: With dead ends: 962
[2025-02-08 00:12:11,859 INFO  L226             Difference]: Without dead ends: 658
[2025-02-08 00:12:11,860 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272
[2025-02-08 00:12:11,861 INFO  L435           NwaCegarLoop]: 399 mSDtfsCounter, 1097 mSDsluCounter, 1657 mSDsCounter, 0 mSdLazyCounter, 604 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1097 SdHoareTripleChecker+Valid, 2056 SdHoareTripleChecker+Invalid, 606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-02-08 00:12:11,861 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1097 Valid, 2056 Invalid, 606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 604 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-02-08 00:12:11,862 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 658 states.
[2025-02-08 00:12:11,869 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 651.
[2025-02-08 00:12:11,870 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 651 states, 650 states have (on average 1.4476923076923076) internal successors, (941), 650 states have internal predecessors, (941), 0 states have call successors, (0), 0 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-08 00:12:11,872 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 941 transitions.
[2025-02-08 00:12:11,872 INFO  L78                 Accepts]: Start accepts. Automaton has 651 states and 941 transitions. Word has length 201
[2025-02-08 00:12:11,872 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-08 00:12:11,872 INFO  L471      AbstractCegarLoop]: Abstraction has 651 states and 941 transitions.
[2025-02-08 00:12:11,872 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 20.1) internal successors, (201), 9 states have internal predecessors, (201), 0 states have call successors, (0), 0 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-08 00:12:11,873 INFO  L276                IsEmpty]: Start isEmpty. Operand 651 states and 941 transitions.
[2025-02-08 00:12:11,874 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 203
[2025-02-08 00:12:11,874 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-08 00:12:11,874 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 00:12:11,875 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2025-02-08 00:12:11,875 INFO  L396      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-08 00:12:11,875 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 00:12:11,876 INFO  L85        PathProgramCache]: Analyzing trace with hash -938650599, now seen corresponding path program 1 times
[2025-02-08 00:12:11,876 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 00:12:11,876 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332808640]
[2025-02-08 00:12:11,876 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-08 00:12:11,876 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 00:12:11,919 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes.
[2025-02-08 00:12:12,230 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements.
[2025-02-08 00:12:12,231 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 00:12:12,231 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-08 00:12:14,135 INFO  L134       CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-08 00:12:14,136 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-08 00:12:14,136 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332808640]
[2025-02-08 00:12:14,136 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332808640] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-08 00:12:14,136 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-08 00:12:14,136 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-02-08 00:12:14,136 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754406591]
[2025-02-08 00:12:14,136 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-08 00:12:14,137 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2025-02-08 00:12:14,137 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-08 00:12:14,137 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2025-02-08 00:12:14,138 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72
[2025-02-08 00:12:14,138 INFO  L87              Difference]: Start difference. First operand 651 states and 941 transitions. Second operand  has 9 states, 9 states have (on average 22.444444444444443) internal successors, (202), 8 states have internal predecessors, (202), 0 states have call successors, (0), 0 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-08 00:12:14,633 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-08 00:12:14,634 INFO  L93              Difference]: Finished difference Result 1035 states and 1504 transitions.
[2025-02-08 00:12:14,634 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2025-02-08 00:12:14,634 INFO  L78                 Accepts]: Start accepts. Automaton has  has 9 states, 9 states have (on average 22.444444444444443) internal successors, (202), 8 states have internal predecessors, (202), 0 states have call successors, (0), 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 202
[2025-02-08 00:12:14,634 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-08 00:12:14,636 INFO  L225             Difference]: With dead ends: 1035
[2025-02-08 00:12:14,637 INFO  L226             Difference]: Without dead ends: 736
[2025-02-08 00:12:14,637 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210
[2025-02-08 00:12:14,638 INFO  L435           NwaCegarLoop]: 395 mSDtfsCounter, 1537 mSDsluCounter, 1809 mSDsCounter, 0 mSdLazyCounter, 647 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1537 SdHoareTripleChecker+Valid, 2204 SdHoareTripleChecker+Invalid, 648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 647 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-02-08 00:12:14,638 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1537 Valid, 2204 Invalid, 648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 647 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-02-08 00:12:14,639 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 736 states.
[2025-02-08 00:12:14,645 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 725.
[2025-02-08 00:12:14,646 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 725 states, 724 states have (on average 1.4475138121546962) internal successors, (1048), 724 states have internal predecessors, (1048), 0 states have call successors, (0), 0 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-08 00:12:14,648 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 725 states and 1048 transitions.
[2025-02-08 00:12:14,648 INFO  L78                 Accepts]: Start accepts. Automaton has 725 states and 1048 transitions. Word has length 202
[2025-02-08 00:12:14,648 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-08 00:12:14,648 INFO  L471      AbstractCegarLoop]: Abstraction has 725 states and 1048 transitions.
[2025-02-08 00:12:14,648 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 22.444444444444443) internal successors, (202), 8 states have internal predecessors, (202), 0 states have call successors, (0), 0 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-08 00:12:14,648 INFO  L276                IsEmpty]: Start isEmpty. Operand 725 states and 1048 transitions.
[2025-02-08 00:12:14,650 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 203
[2025-02-08 00:12:14,650 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-08 00:12:14,650 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 00:12:14,650 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2025-02-08 00:12:14,650 INFO  L396      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-08 00:12:14,650 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 00:12:14,650 INFO  L85        PathProgramCache]: Analyzing trace with hash 1862275427, now seen corresponding path program 1 times
[2025-02-08 00:12:14,650 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 00:12:14,650 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272619028]
[2025-02-08 00:12:14,650 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-08 00:12:14,651 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 00:12:14,694 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes.
[2025-02-08 00:12:15,092 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements.
[2025-02-08 00:12:15,092 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 00:12:15,093 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-08 00:12:17,231 INFO  L134       CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-08 00:12:17,231 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-08 00:12:17,231 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272619028]
[2025-02-08 00:12:17,231 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272619028] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-08 00:12:17,231 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [608357048]
[2025-02-08 00:12:17,231 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-08 00:12:17,231 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-08 00:12:17,232 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-08 00:12:17,233 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-08 00:12:17,238 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-08 00:12:17,601 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes.
[2025-02-08 00:12:17,887 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements.
[2025-02-08 00:12:17,887 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 00:12:17,887 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-08 00:12:17,895 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1439 conjuncts, 32 conjuncts are in the unsatisfiable core
[2025-02-08 00:12:17,904 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-08 00:12:18,638 INFO  L134       CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-08 00:12:18,638 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-02-08 00:12:18,638 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [608357048] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-08 00:12:18,638 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-02-08 00:12:18,639 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [16] total 19
[2025-02-08 00:12:18,639 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99318782]
[2025-02-08 00:12:18,640 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-08 00:12:18,640 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-08 00:12:18,640 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-08 00:12:18,641 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-08 00:12:18,641 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380
[2025-02-08 00:12:18,641 INFO  L87              Difference]: Start difference. First operand 725 states and 1048 transitions. Second operand  has 5 states, 5 states have (on average 40.4) internal successors, (202), 4 states have internal predecessors, (202), 0 states have call successors, (0), 0 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-08 00:12:19,118 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-08 00:12:19,118 INFO  L93              Difference]: Finished difference Result 1169 states and 1698 transitions.
[2025-02-08 00:12:19,119 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-08 00:12:19,119 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 40.4) internal successors, (202), 4 states have internal predecessors, (202), 0 states have call successors, (0), 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 202
[2025-02-08 00:12:19,119 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-08 00:12:19,121 INFO  L225             Difference]: With dead ends: 1169
[2025-02-08 00:12:19,121 INFO  L226             Difference]: Without dead ends: 651
[2025-02-08 00:12:19,122 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462
[2025-02-08 00:12:19,122 INFO  L435           NwaCegarLoop]: 249 mSDtfsCounter, 731 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 776 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 731 SdHoareTripleChecker+Valid, 744 SdHoareTripleChecker+Invalid, 777 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 776 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-02-08 00:12:19,122 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [731 Valid, 744 Invalid, 777 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 776 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-02-08 00:12:19,123 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 651 states.
[2025-02-08 00:12:19,130 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 651.
[2025-02-08 00:12:19,130 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 651 states, 650 states have (on average 1.4415384615384614) internal successors, (937), 650 states have internal predecessors, (937), 0 states have call successors, (0), 0 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-08 00:12:19,132 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 937 transitions.
[2025-02-08 00:12:19,132 INFO  L78                 Accepts]: Start accepts. Automaton has 651 states and 937 transitions. Word has length 202
[2025-02-08 00:12:19,132 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-08 00:12:19,132 INFO  L471      AbstractCegarLoop]: Abstraction has 651 states and 937 transitions.
[2025-02-08 00:12:19,132 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 40.4) internal successors, (202), 4 states have internal predecessors, (202), 0 states have call successors, (0), 0 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-08 00:12:19,132 INFO  L276                IsEmpty]: Start isEmpty. Operand 651 states and 937 transitions.
[2025-02-08 00:12:19,134 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 205
[2025-02-08 00:12:19,134 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-08 00:12:19,134 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 00:12:19,144 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0
[2025-02-08 00:12:19,338 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-08 00:12:19,338 INFO  L396      AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-08 00:12:19,339 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 00:12:19,339 INFO  L85        PathProgramCache]: Analyzing trace with hash -1230445049, now seen corresponding path program 1 times
[2025-02-08 00:12:19,339 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 00:12:19,339 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498091755]
[2025-02-08 00:12:19,340 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-08 00:12:19,340 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 00:12:19,402 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes.
[2025-02-08 00:12:19,814 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements.
[2025-02-08 00:12:19,814 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 00:12:19,814 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-08 00:12:21,891 INFO  L134       CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-08 00:12:21,892 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-08 00:12:21,892 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498091755]
[2025-02-08 00:12:21,892 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498091755] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-08 00:12:21,892 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-08 00:12:21,892 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2025-02-08 00:12:21,893 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090767951]
[2025-02-08 00:12:21,893 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-08 00:12:21,893 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2025-02-08 00:12:21,893 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-08 00:12:21,894 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2025-02-08 00:12:21,894 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110
[2025-02-08 00:12:21,894 INFO  L87              Difference]: Start difference. First operand 651 states and 937 transitions. Second operand  has 11 states, 11 states have (on average 18.545454545454547) internal successors, (204), 10 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-08 00:12:22,547 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-08 00:12:22,547 INFO  L93              Difference]: Finished difference Result 969 states and 1406 transitions.
[2025-02-08 00:12:22,548 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2025-02-08 00:12:22,548 INFO  L78                 Accepts]: Start accepts. Automaton has  has 11 states, 11 states have (on average 18.545454545454547) internal successors, (204), 10 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 204
[2025-02-08 00:12:22,548 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-08 00:12:22,550 INFO  L225             Difference]: With dead ends: 969
[2025-02-08 00:12:22,550 INFO  L226             Difference]: Without dead ends: 666
[2025-02-08 00:12:22,550 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210
[2025-02-08 00:12:22,551 INFO  L435           NwaCegarLoop]: 398 mSDtfsCounter, 883 mSDsluCounter, 3128 mSDsCounter, 0 mSdLazyCounter, 1094 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 883 SdHoareTripleChecker+Valid, 3526 SdHoareTripleChecker+Invalid, 1095 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1094 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-02-08 00:12:22,551 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [883 Valid, 3526 Invalid, 1095 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1094 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-02-08 00:12:22,552 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 666 states.
[2025-02-08 00:12:22,558 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 655.
[2025-02-08 00:12:22,559 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 655 states, 654 states have (on average 1.4418960244648318) internal successors, (943), 654 states have internal predecessors, (943), 0 states have call successors, (0), 0 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-08 00:12:22,560 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 943 transitions.
[2025-02-08 00:12:22,560 INFO  L78                 Accepts]: Start accepts. Automaton has 655 states and 943 transitions. Word has length 204
[2025-02-08 00:12:22,560 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-08 00:12:22,560 INFO  L471      AbstractCegarLoop]: Abstraction has 655 states and 943 transitions.
[2025-02-08 00:12:22,560 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 18.545454545454547) internal successors, (204), 10 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-08 00:12:22,561 INFO  L276                IsEmpty]: Start isEmpty. Operand 655 states and 943 transitions.
[2025-02-08 00:12:22,562 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 205
[2025-02-08 00:12:22,562 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-08 00:12:22,562 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 00:12:22,562 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2025-02-08 00:12:22,562 INFO  L396      AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-08 00:12:22,563 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 00:12:22,563 INFO  L85        PathProgramCache]: Analyzing trace with hash 1570480977, now seen corresponding path program 1 times
[2025-02-08 00:12:22,563 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 00:12:22,563 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231247372]
[2025-02-08 00:12:22,563 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-08 00:12:22,563 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 00:12:22,622 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes.
[2025-02-08 00:12:23,033 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements.
[2025-02-08 00:12:23,034 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 00:12:23,034 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-08 00:12:24,503 INFO  L134       CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-08 00:12:24,504 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-08 00:12:24,504 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231247372]
[2025-02-08 00:12:24,504 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231247372] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-08 00:12:24,504 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1025355512]
[2025-02-08 00:12:24,504 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-08 00:12:24,504 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-08 00:12:24,505 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-08 00:12:24,512 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-08 00:12:24,513 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-08 00:12:24,901 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes.
[2025-02-08 00:12:25,360 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements.
[2025-02-08 00:12:25,361 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 00:12:25,361 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-08 00:12:25,369 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1443 conjuncts, 174 conjuncts are in the unsatisfiable core
[2025-02-08 00:12:25,383 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-08 00:12:28,408 INFO  L134       CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-08 00:12:28,408 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-02-08 00:12:33,517 INFO  L134       CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-08 00:12:33,517 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1025355512] provided 0 perfect and 2 imperfect interpolant sequences
[2025-02-08 00:12:33,517 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-02-08 00:12:33,517 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 29, 27] total 66
[2025-02-08 00:12:33,518 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381659648]
[2025-02-08 00:12:33,518 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-02-08 00:12:33,518 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 67 states
[2025-02-08 00:12:33,518 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-08 00:12:33,519 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants.
[2025-02-08 00:12:33,520 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=377, Invalid=4045, Unknown=0, NotChecked=0, Total=4422
[2025-02-08 00:12:33,520 INFO  L87              Difference]: Start difference. First operand 655 states and 943 transitions. Second operand  has 67 states, 67 states have (on average 9.0) internal successors, (603), 66 states have internal predecessors, (603), 0 states have call successors, (0), 0 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-08 00:12:41,201 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-08 00:12:41,202 INFO  L93              Difference]: Finished difference Result 1192 states and 1732 transitions.
[2025-02-08 00:12:41,202 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. 
[2025-02-08 00:12:41,202 INFO  L78                 Accepts]: Start accepts. Automaton has  has 67 states, 67 states have (on average 9.0) internal successors, (603), 66 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 204
[2025-02-08 00:12:41,203 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-08 00:12:41,206 INFO  L225             Difference]: With dead ends: 1192
[2025-02-08 00:12:41,206 INFO  L226             Difference]: Without dead ends: 820
[2025-02-08 00:12:41,217 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 486 GetRequests, 352 SyntacticMatches, 1 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5363 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=1571, Invalid=16519, Unknown=0, NotChecked=0, Total=18090
[2025-02-08 00:12:41,218 INFO  L435           NwaCegarLoop]: 213 mSDtfsCounter, 4019 mSDsluCounter, 7066 mSDsCounter, 0 mSdLazyCounter, 9193 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4019 SdHoareTripleChecker+Valid, 7279 SdHoareTripleChecker+Invalid, 9232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 9193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time
[2025-02-08 00:12:41,218 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [4019 Valid, 7279 Invalid, 9232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 9193 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time]
[2025-02-08 00:12:41,219 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 820 states.
[2025-02-08 00:12:41,233 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 820 to 692.
[2025-02-08 00:12:41,234 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 692 states, 691 states have (on average 1.4413892908827786) internal successors, (996), 691 states have internal predecessors, (996), 0 states have call successors, (0), 0 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-08 00:12:41,234 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 692 states and 996 transitions.
[2025-02-08 00:12:41,234 INFO  L78                 Accepts]: Start accepts. Automaton has 692 states and 996 transitions. Word has length 204
[2025-02-08 00:12:41,239 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-08 00:12:41,239 INFO  L471      AbstractCegarLoop]: Abstraction has 692 states and 996 transitions.
[2025-02-08 00:12:41,239 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 67 states, 67 states have (on average 9.0) internal successors, (603), 66 states have internal predecessors, (603), 0 states have call successors, (0), 0 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-08 00:12:41,239 INFO  L276                IsEmpty]: Start isEmpty. Operand 692 states and 996 transitions.
[2025-02-08 00:12:41,240 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 207
[2025-02-08 00:12:41,240 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-08 00:12:41,240 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-08 00:12:41,265 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2025-02-08 00:12:41,440 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-08 00:12:41,441 INFO  L396      AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-08 00:12:41,441 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 00:12:41,441 INFO  L85        PathProgramCache]: Analyzing trace with hash -1009391587, now seen corresponding path program 1 times
[2025-02-08 00:12:41,441 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 00:12:41,441 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939655862]
[2025-02-08 00:12:41,441 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-08 00:12:41,441 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 00:12:41,487 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes.
[2025-02-08 00:12:41,829 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements.
[2025-02-08 00:12:41,829 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 00:12:41,829 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-08 00:12:42,701 INFO  L134       CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-08 00:12:42,701 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-08 00:12:42,701 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939655862]
[2025-02-08 00:12:42,701 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939655862] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-08 00:12:42,701 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-08 00:12:42,701 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-08 00:12:42,701 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752871609]
[2025-02-08 00:12:42,701 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-08 00:12:42,702 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-08 00:12:42,702 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-08 00:12:42,702 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-08 00:12:42,702 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-08 00:12:42,703 INFO  L87              Difference]: Start difference. First operand 692 states and 996 transitions. Second operand  has 5 states, 5 states have (on average 41.2) internal successors, (206), 4 states have internal predecessors, (206), 0 states have call successors, (0), 0 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-08 00:12:42,872 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-08 00:12:42,874 INFO  L93              Difference]: Finished difference Result 1054 states and 1529 transitions.
[2025-02-08 00:12:42,875 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-08 00:12:42,875 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 41.2) internal successors, (206), 4 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 206
[2025-02-08 00:12:42,875 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-08 00:12:42,877 INFO  L225             Difference]: With dead ends: 1054
[2025-02-08 00:12:42,877 INFO  L226             Difference]: Without dead ends: 703
[2025-02-08 00:12:42,877 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2025-02-08 00:12:42,879 INFO  L435           NwaCegarLoop]: 419 mSDtfsCounter, 383 mSDsluCounter, 833 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 1252 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-02-08 00:12:42,880 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [383 Valid, 1252 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-02-08 00:12:42,881 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 703 states.
[2025-02-08 00:12:42,889 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 703 to 698.
[2025-02-08 00:12:42,890 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 698 states, 697 states have (on average 1.4375896700143471) internal successors, (1002), 697 states have internal predecessors, (1002), 0 states have call successors, (0), 0 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-08 00:12:42,890 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 1002 transitions.
[2025-02-08 00:12:42,891 INFO  L78                 Accepts]: Start accepts. Automaton has 698 states and 1002 transitions. Word has length 206
[2025-02-08 00:12:42,891 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-08 00:12:42,891 INFO  L471      AbstractCegarLoop]: Abstraction has 698 states and 1002 transitions.
[2025-02-08 00:12:42,892 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 41.2) internal successors, (206), 4 states have internal predecessors, (206), 0 states have call successors, (0), 0 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-08 00:12:42,892 INFO  L276                IsEmpty]: Start isEmpty. Operand 698 states and 1002 transitions.
[2025-02-08 00:12:42,893 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 208
[2025-02-08 00:12:42,893 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-08 00:12:42,893 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-08 00:12:42,893 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2025-02-08 00:12:42,893 INFO  L396      AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-08 00:12:42,894 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 00:12:42,894 INFO  L85        PathProgramCache]: Analyzing trace with hash 1040557526, now seen corresponding path program 1 times
[2025-02-08 00:12:42,894 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 00:12:42,894 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446395989]
[2025-02-08 00:12:42,894 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-08 00:12:42,894 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 00:12:42,932 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes.
[2025-02-08 00:12:43,332 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements.
[2025-02-08 00:12:43,332 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 00:12:43,332 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-08 00:12:45,184 INFO  L134       CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-08 00:12:45,184 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-08 00:12:45,184 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446395989]
[2025-02-08 00:12:45,184 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446395989] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-08 00:12:45,184 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1750150382]
[2025-02-08 00:12:45,184 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-08 00:12:45,184 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-08 00:12:45,184 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-08 00:12:45,187 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-02-08 00:12:45,188 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2025-02-08 00:12:45,551 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes.
[2025-02-08 00:12:45,910 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements.
[2025-02-08 00:12:45,910 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 00:12:45,910 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-08 00:12:45,917 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1448 conjuncts, 71 conjuncts are in the unsatisfiable core
[2025-02-08 00:12:45,922 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-08 00:12:46,571 INFO  L134       CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-08 00:12:46,571 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-02-08 00:12:47,614 INFO  L134       CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2025-02-08 00:12:47,614 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1750150382] provided 0 perfect and 2 imperfect interpolant sequences
[2025-02-08 00:12:47,614 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-02-08 00:12:47,614 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 14] total 42
[2025-02-08 00:12:47,614 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738716809]
[2025-02-08 00:12:47,614 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-02-08 00:12:47,615 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 43 states
[2025-02-08 00:12:47,615 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-08 00:12:47,616 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants.
[2025-02-08 00:12:47,616 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=1543, Unknown=0, NotChecked=0, Total=1806
[2025-02-08 00:12:47,616 INFO  L87              Difference]: Start difference. First operand 698 states and 1002 transitions. Second operand  has 43 states, 43 states have (on average 12.44186046511628) internal successors, (535), 42 states have internal predecessors, (535), 0 states have call successors, (0), 0 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-08 00:12:51,818 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-08 00:12:51,818 INFO  L93              Difference]: Finished difference Result 2624 states and 3817 transitions.
[2025-02-08 00:12:51,818 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. 
[2025-02-08 00:12:51,819 INFO  L78                 Accepts]: Start accepts. Automaton has  has 43 states, 43 states have (on average 12.44186046511628) internal successors, (535), 42 states have internal predecessors, (535), 0 states have call successors, (0), 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 207
[2025-02-08 00:12:51,819 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-08 00:12:51,825 INFO  L225             Difference]: With dead ends: 2624
[2025-02-08 00:12:51,825 INFO  L226             Difference]: Without dead ends: 2229
[2025-02-08 00:12:51,829 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 518 GetRequests, 389 SyntacticMatches, 2 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5515 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=2048, Invalid=14464, Unknown=0, NotChecked=0, Total=16512
[2025-02-08 00:12:51,830 INFO  L435           NwaCegarLoop]: 398 mSDtfsCounter, 9193 mSDsluCounter, 8072 mSDsCounter, 0 mSdLazyCounter, 2853 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9193 SdHoareTripleChecker+Valid, 8470 SdHoareTripleChecker+Invalid, 2895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 2853 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time
[2025-02-08 00:12:51,830 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [9193 Valid, 8470 Invalid, 2895 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 2853 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time]
[2025-02-08 00:12:51,834 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2229 states.
[2025-02-08 00:12:51,874 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2229 to 1443.
[2025-02-08 00:12:51,876 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1443 states, 1442 states have (on average 1.4466019417475728) internal successors, (2086), 1442 states have internal predecessors, (2086), 0 states have call successors, (0), 0 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-08 00:12:51,879 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1443 states to 1443 states and 2086 transitions.
[2025-02-08 00:12:51,883 INFO  L78                 Accepts]: Start accepts. Automaton has 1443 states and 2086 transitions. Word has length 207
[2025-02-08 00:12:51,883 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-08 00:12:51,883 INFO  L471      AbstractCegarLoop]: Abstraction has 1443 states and 2086 transitions.
[2025-02-08 00:12:51,883 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 43 states, 43 states have (on average 12.44186046511628) internal successors, (535), 42 states have internal predecessors, (535), 0 states have call successors, (0), 0 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-08 00:12:51,883 INFO  L276                IsEmpty]: Start isEmpty. Operand 1443 states and 2086 transitions.
[2025-02-08 00:12:51,884 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 209
[2025-02-08 00:12:51,885 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-08 00:12:51,885 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 00:12:51,897 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0
[2025-02-08 00:12:52,086 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22
[2025-02-08 00:12:52,086 INFO  L396      AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-08 00:12:52,087 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 00:12:52,087 INFO  L85        PathProgramCache]: Analyzing trace with hash 1585505186, now seen corresponding path program 1 times
[2025-02-08 00:12:52,087 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 00:12:52,087 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115320869]
[2025-02-08 00:12:52,087 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-08 00:12:52,087 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 00:12:52,149 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes.
[2025-02-08 00:12:52,425 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements.
[2025-02-08 00:12:52,425 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 00:12:52,425 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-08 00:12:53,548 INFO  L134       CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-08 00:12:53,548 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-08 00:12:53,548 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115320869]
[2025-02-08 00:12:53,548 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115320869] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-08 00:12:53,548 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [249944285]
[2025-02-08 00:12:53,548 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-08 00:12:53,548 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-08 00:12:53,549 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-08 00:12:53,551 INFO  L229       MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-02-08 00:12:53,552 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2025-02-08 00:12:53,953 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes.
[2025-02-08 00:12:54,372 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements.
[2025-02-08 00:12:54,372 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 00:12:54,372 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-08 00:12:54,380 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1451 conjuncts, 51 conjuncts are in the unsatisfiable core
[2025-02-08 00:12:54,384 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-08 00:12:54,861 INFO  L134       CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-08 00:12:54,861 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-02-08 00:13:11,382 INFO  L134       CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-08 00:13:11,382 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [249944285] provided 0 perfect and 2 imperfect interpolant sequences
[2025-02-08 00:13:11,382 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-02-08 00:13:11,382 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 12] total 29
[2025-02-08 00:13:11,382 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530015439]
[2025-02-08 00:13:11,382 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-02-08 00:13:11,383 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 29 states
[2025-02-08 00:13:11,383 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-08 00:13:11,383 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants.
[2025-02-08 00:13:11,383 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=692, Unknown=4, NotChecked=0, Total=812
[2025-02-08 00:13:11,384 INFO  L87              Difference]: Start difference. First operand 1443 states and 2086 transitions. Second operand  has 29 states, 29 states have (on average 16.75862068965517) internal successors, (486), 29 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)