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


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


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

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


Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 42b374d0017cdae74eebab609ba5393370e8c987522e66a98f57a11c3f33505a
[2025-02-05 11:52:36,877 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-02-05 11:52:36,887 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-02-05 11:52:36,888 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-02-05 11:52:36,890 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-02-05 11:52:36,890 INFO  L274        PluginConnector]: CDTParser initialized
[2025-02-05 11:52:36,891 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem15_label17.c
[2025-02-05 11:52:38,064 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f4584e057/a9fbcff38d2d492f87f7cac31e490f4b/FLAG43dedf6be
[2025-02-05 11:52:38,422 INFO  L384              CDTParser]: Found 1 translation units.
[2025-02-05 11:52:38,423 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label17.c
[2025-02-05 11:52:38,441 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f4584e057/a9fbcff38d2d492f87f7cac31e490f4b/FLAG43dedf6be
[2025-02-05 11:52:38,456 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f4584e057/a9fbcff38d2d492f87f7cac31e490f4b
[2025-02-05 11:52:38,460 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-02-05 11:52:38,461 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-02-05 11:52:38,462 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-02-05 11:52:38,462 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-02-05 11:52:38,465 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-02-05 11:52:38,468 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:52:38" (1/1) ...
[2025-02-05 11:52:38,469 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1cfdea61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:52:38, skipping insertion in model container
[2025-02-05 11:52:38,469 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:52:38" (1/1) ...
[2025-02-05 11:52:38,518 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-02-05 11:52:38,699 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label17.c[7664,7677]
[2025-02-05 11:52:38,978 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-05 11:52:38,984 INFO  L200         MainTranslator]: Completed pre-run
[2025-02-05 11:52:39,004 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label17.c[7664,7677]
[2025-02-05 11:52:39,149 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-05 11:52:39,161 INFO  L204         MainTranslator]: Completed translation
[2025-02-05 11:52:39,162 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:52:39 WrapperNode
[2025-02-05 11:52:39,163 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-02-05 11:52:39,163 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-02-05 11:52:39,164 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-02-05 11:52:39,164 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-02-05 11:52:39,168 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:52:39" (1/1) ...
[2025-02-05 11:52:39,195 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:52:39" (1/1) ...
[2025-02-05 11:52:39,299 INFO  L138                Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1757
[2025-02-05 11:52:39,300 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-02-05 11:52:39,301 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-02-05 11:52:39,301 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-02-05 11:52:39,301 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-02-05 11:52:39,307 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:52:39" (1/1) ...
[2025-02-05 11:52:39,307 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:52:39" (1/1) ...
[2025-02-05 11:52:39,330 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:52:39" (1/1) ...
[2025-02-05 11:52:39,426 INFO  L175           MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2025-02-05 11:52:39,427 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:52:39" (1/1) ...
[2025-02-05 11:52:39,427 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:52:39" (1/1) ...
[2025-02-05 11:52:39,477 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:52:39" (1/1) ...
[2025-02-05 11:52:39,485 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:52:39" (1/1) ...
[2025-02-05 11:52:39,495 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:52:39" (1/1) ...
[2025-02-05 11:52:39,502 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:52:39" (1/1) ...
[2025-02-05 11:52:39,521 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-02-05 11:52:39,522 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-02-05 11:52:39,522 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-02-05 11:52:39,523 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-02-05 11:52:39,541 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:52:39" (1/1) ...
[2025-02-05 11:52:39,549 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-02-05 11:52:39,558 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 11:52:39,570 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2025-02-05 11:52:39,575 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2025-02-05 11:52:39,591 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-02-05 11:52:39,591 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-02-05 11:52:39,591 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-02-05 11:52:39,591 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-02-05 11:52:39,634 INFO  L257             CfgBuilder]: Building ICFG
[2025-02-05 11:52:39,635 INFO  L287             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-02-05 11:52:41,558 INFO  L1309  $ProcedureCfgBuilder]: dead code at ProgramPoint L1665: havoc calculate_output_#t~ret7#1;
[2025-02-05 11:52:41,634 INFO  L?                        ?]: Removed 246 outVars from TransFormulas that were not future-live.
[2025-02-05 11:52:41,634 INFO  L308             CfgBuilder]: Performing block encoding
[2025-02-05 11:52:41,654 INFO  L332             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-02-05 11:52:41,657 INFO  L337             CfgBuilder]: Removed 0 assume(true) statements.
[2025-02-05 11:52:41,657 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:52:41 BoogieIcfgContainer
[2025-02-05 11:52:41,657 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-02-05 11:52:41,659 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-02-05 11:52:41,659 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-02-05 11:52:41,663 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-02-05 11:52:41,663 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 11:52:38" (1/3) ...
[2025-02-05 11:52:41,663 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50463485 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:52:41, skipping insertion in model container
[2025-02-05 11:52:41,664 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:52:39" (2/3) ...
[2025-02-05 11:52:41,664 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50463485 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:52:41, skipping insertion in model container
[2025-02-05 11:52:41,664 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:52:41" (3/3) ...
[2025-02-05 11:52:41,665 INFO  L128   eAbstractionObserver]: Analyzing ICFG Problem15_label17.c
[2025-02-05 11:52:41,676 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-02-05 11:52:41,678 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG Problem15_label17.c that has 1 procedures, 424 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-02-05 11:52:41,735 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-02-05 11:52:41,744 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;@1db7fd72, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-02-05 11:52:41,744 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-02-05 11:52:41,749 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 424 states, 422 states have (on average 1.7748815165876777) internal successors, (749), 423 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:52:41,756 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 64
[2025-02-05 11:52:41,757 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:52:41,757 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]
[2025-02-05 11:52:41,758 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:52:41,762 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:52:41,762 INFO  L85        PathProgramCache]: Analyzing trace with hash -117809598, now seen corresponding path program 1 times
[2025-02-05 11:52:41,767 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:52:41,768 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361879086]
[2025-02-05 11:52:41,768 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:52:41,769 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:52:41,829 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes.
[2025-02-05 11:52:41,860 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements.
[2025-02-05 11:52:41,861 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:52:41,861 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:52:42,045 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 11:52:42,046 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:52:42,046 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361879086]
[2025-02-05 11:52:42,047 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361879086] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:52:42,047 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:52:42,047 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-02-05 11:52:42,048 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433922478]
[2025-02-05 11:52:42,048 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:52:42,050 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:52:42,051 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:52:42,064 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:52:42,065 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:52:42,068 INFO  L87              Difference]: Start difference. First operand  has 424 states, 422 states have (on average 1.7748815165876777) internal successors, (749), 423 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand  has 3 states, 3 states have (on average 21.0) internal successors, (63), 2 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:52:43,619 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:52:43,620 INFO  L93              Difference]: Finished difference Result 1191 states and 2154 transitions.
[2025-02-05 11:52:43,621 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:52:43,622 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 21.0) internal successors, (63), 2 states have internal predecessors, (63), 0 states have call successors, (0), 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 63
[2025-02-05 11:52:43,622 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:52:43,630 INFO  L225             Difference]: With dead ends: 1191
[2025-02-05 11:52:43,631 INFO  L226             Difference]: Without dead ends: 688
[2025-02-05 11:52:43,633 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:52:43,635 INFO  L435           NwaCegarLoop]: 188 mSDtfsCounter, 308 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 1047 mSolverCounterSat, 286 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 1333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 286 IncrementalHoareTripleChecker+Valid, 1047 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time
[2025-02-05 11:52:43,635 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 229 Invalid, 1333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [286 Valid, 1047 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time]
[2025-02-05 11:52:43,647 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 688 states.
[2025-02-05 11:52:43,679 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 680.
[2025-02-05 11:52:43,680 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 680 states, 679 states have (on average 1.609720176730486) internal successors, (1093), 679 states have internal predecessors, (1093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:52:43,684 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 1093 transitions.
[2025-02-05 11:52:43,686 INFO  L78                 Accepts]: Start accepts. Automaton has 680 states and 1093 transitions. Word has length 63
[2025-02-05 11:52:43,686 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:52:43,686 INFO  L471      AbstractCegarLoop]: Abstraction has 680 states and 1093 transitions.
[2025-02-05 11:52:43,687 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 21.0) internal successors, (63), 2 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:52:43,687 INFO  L276                IsEmpty]: Start isEmpty. Operand 680 states and 1093 transitions.
[2025-02-05 11:52:43,689 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 132
[2025-02-05 11:52:43,689 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:52:43,689 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:52:43,691 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2025-02-05 11:52:43,692 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:52:43,692 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:52:43,692 INFO  L85        PathProgramCache]: Analyzing trace with hash 36610947, now seen corresponding path program 1 times
[2025-02-05 11:52:43,692 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:52:43,692 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272102153]
[2025-02-05 11:52:43,693 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:52:43,693 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:52:43,712 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes.
[2025-02-05 11:52:43,748 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements.
[2025-02-05 11:52:43,751 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:52:43,752 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:52:43,910 INFO  L134       CoverageAnalysis]: Checked inductivity of 60 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 11:52:43,911 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:52:43,911 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272102153]
[2025-02-05 11:52:43,911 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272102153] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:52:43,911 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:52:43,911 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-02-05 11:52:43,911 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369580210]
[2025-02-05 11:52:43,911 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:52:43,912 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:52:43,912 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:52:43,912 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:52:43,912 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:52:43,912 INFO  L87              Difference]: Start difference. First operand 680 states and 1093 transitions. Second operand  has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 2 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:52:45,083 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:52:45,083 INFO  L93              Difference]: Finished difference Result 1964 states and 3171 transitions.
[2025-02-05 11:52:45,083 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:52:45,083 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 2 states have internal predecessors, (131), 0 states have call successors, (0), 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 131
[2025-02-05 11:52:45,083 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:52:45,087 INFO  L225             Difference]: With dead ends: 1964
[2025-02-05 11:52:45,087 INFO  L226             Difference]: Without dead ends: 1286
[2025-02-05 11:52:45,088 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:52:45,089 INFO  L435           NwaCegarLoop]: 294 mSDtfsCounter, 282 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 799 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 1097 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 799 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time
[2025-02-05 11:52:45,089 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 361 Invalid, 1097 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 799 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2025-02-05 11:52:45,091 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1286 states.
[2025-02-05 11:52:45,112 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1286 to 1281.
[2025-02-05 11:52:45,114 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1281 states, 1280 states have (on average 1.3953125) internal successors, (1786), 1280 states have internal predecessors, (1786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:52:45,117 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1281 states to 1281 states and 1786 transitions.
[2025-02-05 11:52:45,117 INFO  L78                 Accepts]: Start accepts. Automaton has 1281 states and 1786 transitions. Word has length 131
[2025-02-05 11:52:45,117 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:52:45,117 INFO  L471      AbstractCegarLoop]: Abstraction has 1281 states and 1786 transitions.
[2025-02-05 11:52:45,118 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 2 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:52:45,118 INFO  L276                IsEmpty]: Start isEmpty. Operand 1281 states and 1786 transitions.
[2025-02-05 11:52:45,120 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 140
[2025-02-05 11:52:45,121 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:52:45,121 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:52:45,121 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-02-05 11:52:45,121 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:52:45,121 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:52:45,121 INFO  L85        PathProgramCache]: Analyzing trace with hash -446479465, now seen corresponding path program 1 times
[2025-02-05 11:52:45,122 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:52:45,122 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677417990]
[2025-02-05 11:52:45,122 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:52:45,122 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:52:45,138 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes.
[2025-02-05 11:52:45,161 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements.
[2025-02-05 11:52:45,161 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:52:45,162 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:52:45,465 INFO  L134       CoverageAnalysis]: Checked inductivity of 60 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 11:52:45,466 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:52:45,466 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677417990]
[2025-02-05 11:52:45,466 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677417990] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:52:45,466 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:52:45,467 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-02-05 11:52:45,468 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640614347]
[2025-02-05 11:52:45,468 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:52:45,468 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:52:45,468 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:52:45,469 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:52:45,469 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:52:45,469 INFO  L87              Difference]: Start difference. First operand 1281 states and 1786 transitions. Second operand  has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 2 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:52:46,617 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:52:46,618 INFO  L93              Difference]: Finished difference Result 2859 states and 3905 transitions.
[2025-02-05 11:52:46,619 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:52:46,619 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 2 states have internal predecessors, (139), 0 states have call successors, (0), 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 139
[2025-02-05 11:52:46,619 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:52:46,626 INFO  L225             Difference]: With dead ends: 2859
[2025-02-05 11:52:46,626 INFO  L226             Difference]: Without dead ends: 1580
[2025-02-05 11:52:46,631 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:52:46,631 INFO  L435           NwaCegarLoop]: 324 mSDtfsCounter, 225 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 917 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time
[2025-02-05 11:52:46,632 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 359 Invalid, 917 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 888 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2025-02-05 11:52:46,634 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1580 states.
[2025-02-05 11:52:46,652 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1580 to 1580.
[2025-02-05 11:52:46,654 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1580 states, 1579 states have (on average 1.3242558581380621) internal successors, (2091), 1579 states have internal predecessors, (2091), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:52:46,658 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 2091 transitions.
[2025-02-05 11:52:46,658 INFO  L78                 Accepts]: Start accepts. Automaton has 1580 states and 2091 transitions. Word has length 139
[2025-02-05 11:52:46,658 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:52:46,659 INFO  L471      AbstractCegarLoop]: Abstraction has 1580 states and 2091 transitions.
[2025-02-05 11:52:46,659 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 2 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:52:46,659 INFO  L276                IsEmpty]: Start isEmpty. Operand 1580 states and 2091 transitions.
[2025-02-05 11:52:46,664 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 231
[2025-02-05 11:52:46,666 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:52:46,667 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:52:46,667 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-02-05 11:52:46,667 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:52:46,668 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:52:46,669 INFO  L85        PathProgramCache]: Analyzing trace with hash 1814630781, now seen corresponding path program 1 times
[2025-02-05 11:52:46,669 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:52:46,669 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918475920]
[2025-02-05 11:52:46,669 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:52:46,670 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:52:46,696 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes.
[2025-02-05 11:52:46,716 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements.
[2025-02-05 11:52:46,716 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:52:46,716 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:52:46,864 INFO  L134       CoverageAnalysis]: Checked inductivity of 196 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked.
[2025-02-05 11:52:46,865 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:52:46,865 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918475920]
[2025-02-05 11:52:46,865 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918475920] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:52:46,865 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:52:46,865 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:52:46,865 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696551827]
[2025-02-05 11:52:46,865 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:52:46,865 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:52:46,865 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:52:46,866 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:52:46,866 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:52:46,866 INFO  L87              Difference]: Start difference. First operand 1580 states and 2091 transitions. Second operand  has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:52:48,105 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:52:48,106 INFO  L93              Difference]: Finished difference Result 4065 states and 5551 transitions.
[2025-02-05 11:52:48,106 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:52:48,106 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 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 230
[2025-02-05 11:52:48,107 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:52:48,116 INFO  L225             Difference]: With dead ends: 4065
[2025-02-05 11:52:48,117 INFO  L226             Difference]: Without dead ends: 2786
[2025-02-05 11:52:48,119 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:52:48,121 INFO  L435           NwaCegarLoop]: 599 mSDtfsCounter, 265 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 896 mSolverCounterSat, 227 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 636 SdHoareTripleChecker+Invalid, 1123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 227 IncrementalHoareTripleChecker+Valid, 896 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time
[2025-02-05 11:52:48,122 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 636 Invalid, 1123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [227 Valid, 896 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time]
[2025-02-05 11:52:48,124 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2786 states.
[2025-02-05 11:52:48,154 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2786 to 2786.
[2025-02-05 11:52:48,157 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2786 states, 2785 states have (on average 1.2204667863554757) internal successors, (3399), 2785 states have internal predecessors, (3399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:52:48,162 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2786 states to 2786 states and 3399 transitions.
[2025-02-05 11:52:48,162 INFO  L78                 Accepts]: Start accepts. Automaton has 2786 states and 3399 transitions. Word has length 230
[2025-02-05 11:52:48,163 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:52:48,163 INFO  L471      AbstractCegarLoop]: Abstraction has 2786 states and 3399 transitions.
[2025-02-05 11:52:48,164 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:52:48,164 INFO  L276                IsEmpty]: Start isEmpty. Operand 2786 states and 3399 transitions.
[2025-02-05 11:52:48,166 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 237
[2025-02-05 11:52:48,166 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:52:48,166 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:52:48,166 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-02-05 11:52:48,166 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:52:48,167 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:52:48,167 INFO  L85        PathProgramCache]: Analyzing trace with hash -620825929, now seen corresponding path program 1 times
[2025-02-05 11:52:48,167 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:52:48,167 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129808008]
[2025-02-05 11:52:48,167 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:52:48,167 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:52:48,184 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 236 statements into 1 equivalence classes.
[2025-02-05 11:52:48,198 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 236 of 236 statements.
[2025-02-05 11:52:48,198 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:52:48,198 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:52:48,334 INFO  L134       CoverageAnalysis]: Checked inductivity of 200 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked.
[2025-02-05 11:52:48,334 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:52:48,334 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129808008]
[2025-02-05 11:52:48,334 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129808008] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:52:48,334 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:52:48,334 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-02-05 11:52:48,335 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779543845]
[2025-02-05 11:52:48,335 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:52:48,335 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:52:48,335 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:52:48,335 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:52:48,335 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:52:48,335 INFO  L87              Difference]: Start difference. First operand 2786 states and 3399 transitions. Second operand  has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 2 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:52:49,493 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:52:49,493 INFO  L93              Difference]: Finished difference Result 6472 states and 8164 transitions.
[2025-02-05 11:52:49,494 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:52:49,494 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 2 states have internal predecessors, (158), 0 states have call successors, (0), 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 236
[2025-02-05 11:52:49,494 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:52:49,504 INFO  L225             Difference]: With dead ends: 6472
[2025-02-05 11:52:49,504 INFO  L226             Difference]: Without dead ends: 3987
[2025-02-05 11:52:49,507 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:52:49,508 INFO  L435           NwaCegarLoop]: 324 mSDtfsCounter, 220 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 861 mSolverCounterSat, 276 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 1137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 276 IncrementalHoareTripleChecker+Valid, 861 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time
[2025-02-05 11:52:49,508 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 363 Invalid, 1137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [276 Valid, 861 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2025-02-05 11:52:49,511 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3987 states.
[2025-02-05 11:52:49,547 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3987 to 3686.
[2025-02-05 11:52:49,551 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3686 states, 3685 states have (on average 1.1959294436906378) internal successors, (4407), 3685 states have internal predecessors, (4407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:52:49,556 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3686 states to 3686 states and 4407 transitions.
[2025-02-05 11:52:49,556 INFO  L78                 Accepts]: Start accepts. Automaton has 3686 states and 4407 transitions. Word has length 236
[2025-02-05 11:52:49,557 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:52:49,557 INFO  L471      AbstractCegarLoop]: Abstraction has 3686 states and 4407 transitions.
[2025-02-05 11:52:49,557 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 2 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:52:49,557 INFO  L276                IsEmpty]: Start isEmpty. Operand 3686 states and 4407 transitions.
[2025-02-05 11:52:49,559 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 346
[2025-02-05 11:52:49,560 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:52:49,560 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:52:49,560 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-02-05 11:52:49,560 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:52:49,560 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:52:49,561 INFO  L85        PathProgramCache]: Analyzing trace with hash 1817813114, now seen corresponding path program 1 times
[2025-02-05 11:52:49,561 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:52:49,561 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976243373]
[2025-02-05 11:52:49,561 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:52:49,561 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:52:49,592 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 345 statements into 1 equivalence classes.
[2025-02-05 11:52:49,609 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 345 of 345 statements.
[2025-02-05 11:52:49,609 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:52:49,609 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:52:49,814 INFO  L134       CoverageAnalysis]: Checked inductivity of 60 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 11:52:49,814 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:52:49,815 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976243373]
[2025-02-05 11:52:49,815 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976243373] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:52:49,815 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:52:49,815 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:52:49,815 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601243461]
[2025-02-05 11:52:49,816 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:52:49,816 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:52:49,817 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:52:49,817 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:52:49,817 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:52:49,817 INFO  L87              Difference]: Start difference. First operand 3686 states and 4407 transitions. Second operand  has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:52:51,242 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:52:51,242 INFO  L93              Difference]: Finished difference Result 8279 states and 10190 transitions.
[2025-02-05 11:52:51,242 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:52:51,243 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 345
[2025-02-05 11:52:51,243 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:52:51,253 INFO  L225             Difference]: With dead ends: 8279
[2025-02-05 11:52:51,253 INFO  L226             Difference]: Without dead ends: 4894
[2025-02-05 11:52:51,257 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:52:51,258 INFO  L435           NwaCegarLoop]: 565 mSDtfsCounter, 267 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 904 mSolverCounterSat, 223 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 1127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 223 IncrementalHoareTripleChecker+Valid, 904 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time
[2025-02-05 11:52:51,258 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 604 Invalid, 1127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [223 Valid, 904 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time]
[2025-02-05 11:52:51,263 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 4894 states.
[2025-02-05 11:52:51,306 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 4894 to 4592.
[2025-02-05 11:52:51,311 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 4592 states, 4591 states have (on average 1.184055761272054) internal successors, (5436), 4591 states have internal predecessors, (5436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:52:51,316 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4592 states to 4592 states and 5436 transitions.
[2025-02-05 11:52:51,317 INFO  L78                 Accepts]: Start accepts. Automaton has 4592 states and 5436 transitions. Word has length 345
[2025-02-05 11:52:51,317 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:52:51,317 INFO  L471      AbstractCegarLoop]: Abstraction has 4592 states and 5436 transitions.
[2025-02-05 11:52:51,317 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:52:51,317 INFO  L276                IsEmpty]: Start isEmpty. Operand 4592 states and 5436 transitions.
[2025-02-05 11:52:51,320 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 351
[2025-02-05 11:52:51,320 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:52:51,320 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:52:51,320 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-02-05 11:52:51,320 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:52:51,321 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:52:51,321 INFO  L85        PathProgramCache]: Analyzing trace with hash -830199374, now seen corresponding path program 1 times
[2025-02-05 11:52:51,321 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:52:51,321 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350315460]
[2025-02-05 11:52:51,321 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:52:51,321 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:52:51,349 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 350 statements into 1 equivalence classes.
[2025-02-05 11:52:51,400 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 350 of 350 statements.
[2025-02-05 11:52:51,401 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:52:51,401 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:52:51,592 INFO  L134       CoverageAnalysis]: Checked inductivity of 211 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked.
[2025-02-05 11:52:51,593 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:52:51,593 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350315460]
[2025-02-05 11:52:51,593 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350315460] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:52:51,593 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:52:51,593 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:52:51,593 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440757224]
[2025-02-05 11:52:51,593 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:52:51,594 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:52:51,594 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:52:51,594 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:52:51,595 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:52:51,595 INFO  L87              Difference]: Start difference. First operand 4592 states and 5436 transitions. Second operand  has 3 states, 3 states have (on average 87.0) internal successors, (261), 3 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:52:52,702 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:52:52,702 INFO  L93              Difference]: Finished difference Result 10079 states and 12234 transitions.
[2025-02-05 11:52:52,703 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:52:52,703 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 87.0) internal successors, (261), 3 states have internal predecessors, (261), 0 states have call successors, (0), 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 350
[2025-02-05 11:52:52,703 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:52:52,715 INFO  L225             Difference]: With dead ends: 10079
[2025-02-05 11:52:52,715 INFO  L226             Difference]: Without dead ends: 5788
[2025-02-05 11:52:52,718 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:52:52,719 INFO  L435           NwaCegarLoop]: 580 mSDtfsCounter, 265 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 880 mSolverCounterSat, 242 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 619 SdHoareTripleChecker+Invalid, 1122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 242 IncrementalHoareTripleChecker+Valid, 880 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time
[2025-02-05 11:52:52,719 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 619 Invalid, 1122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [242 Valid, 880 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2025-02-05 11:52:52,723 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 5788 states.
[2025-02-05 11:52:52,783 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 5788 to 5784.
[2025-02-05 11:52:52,790 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 5784 states, 5783 states have (on average 1.1663496455127096) internal successors, (6745), 5783 states have internal predecessors, (6745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:52:52,799 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5784 states to 5784 states and 6745 transitions.
[2025-02-05 11:52:52,800 INFO  L78                 Accepts]: Start accepts. Automaton has 5784 states and 6745 transitions. Word has length 350
[2025-02-05 11:52:52,800 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:52:52,800 INFO  L471      AbstractCegarLoop]: Abstraction has 5784 states and 6745 transitions.
[2025-02-05 11:52:52,801 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 87.0) internal successors, (261), 3 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:52:52,801 INFO  L276                IsEmpty]: Start isEmpty. Operand 5784 states and 6745 transitions.
[2025-02-05 11:52:52,808 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 515
[2025-02-05 11:52:52,809 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:52:52,809 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:52:52,809 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-02-05 11:52:52,809 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:52:52,809 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:52:52,810 INFO  L85        PathProgramCache]: Analyzing trace with hash 12205893, now seen corresponding path program 1 times
[2025-02-05 11:52:52,810 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:52:52,810 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775076386]
[2025-02-05 11:52:52,810 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:52:52,810 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:52:52,862 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 514 statements into 1 equivalence classes.
[2025-02-05 11:52:52,892 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 514 of 514 statements.
[2025-02-05 11:52:52,892 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:52:52,892 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:52:53,349 INFO  L134       CoverageAnalysis]: Checked inductivity of 526 backedges. 426 proven. 39 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked.
[2025-02-05 11:52:53,349 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:52:53,349 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775076386]
[2025-02-05 11:52:53,349 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775076386] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-05 11:52:53,350 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [865798020]
[2025-02-05 11:52:53,350 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:52:53,350 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 11:52:53,350 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 11:52:53,354 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-02-05 11:52:53,355 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2025-02-05 11:52:53,429 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 514 statements into 1 equivalence classes.
[2025-02-05 11:52:53,505 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 514 of 514 statements.
[2025-02-05 11:52:53,506 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:52:53,506 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:52:53,509 INFO  L256         TraceCheckSpWp]: Trace formula consists of 623 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-02-05 11:52:53,521 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-05 11:52:53,797 INFO  L134       CoverageAnalysis]: Checked inductivity of 526 backedges. 375 proven. 0 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked.
[2025-02-05 11:52:53,798 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-02-05 11:52:53,798 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [865798020] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:52:53,798 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-02-05 11:52:53,798 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6
[2025-02-05 11:52:53,798 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655736139]
[2025-02-05 11:52:53,798 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:52:53,798 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:52:53,798 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:52:53,799 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:52:53,799 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2025-02-05 11:52:53,799 INFO  L87              Difference]: Start difference. First operand 5784 states and 6745 transitions. Second operand  has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:52:54,879 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:52:54,880 INFO  L93              Difference]: Finished difference Result 14556 states and 17044 transitions.
[2025-02-05 11:52:54,880 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:52:54,880 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 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 514
[2025-02-05 11:52:54,881 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:52:54,899 INFO  L225             Difference]: With dead ends: 14556
[2025-02-05 11:52:54,899 INFO  L226             Difference]: Without dead ends: 9073
[2025-02-05 11:52:54,904 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 517 GetRequests, 513 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2025-02-05 11:52:54,904 INFO  L435           NwaCegarLoop]: 274 mSDtfsCounter, 148 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 905 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 1111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time
[2025-02-05 11:52:54,904 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 316 Invalid, 1111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 905 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time]
[2025-02-05 11:52:54,910 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 9073 states.
[2025-02-05 11:52:54,964 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 9073 to 7578.
[2025-02-05 11:52:54,973 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 7578 states, 7577 states have (on average 1.1483436716378514) internal successors, (8701), 7577 states have internal predecessors, (8701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:52:54,980 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7578 states to 7578 states and 8701 transitions.
[2025-02-05 11:52:54,980 INFO  L78                 Accepts]: Start accepts. Automaton has 7578 states and 8701 transitions. Word has length 514
[2025-02-05 11:52:54,981 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:52:54,981 INFO  L471      AbstractCegarLoop]: Abstraction has 7578 states and 8701 transitions.
[2025-02-05 11:52:54,981 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:52:54,981 INFO  L276                IsEmpty]: Start isEmpty. Operand 7578 states and 8701 transitions.
[2025-02-05 11:52:54,988 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 548
[2025-02-05 11:52:54,988 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:52:54,989 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:52:54,996 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2025-02-05 11:52:55,190 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 11:52:55,190 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:52:55,190 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:52:55,191 INFO  L85        PathProgramCache]: Analyzing trace with hash 286294996, now seen corresponding path program 1 times
[2025-02-05 11:52:55,191 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:52:55,191 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304899813]
[2025-02-05 11:52:55,191 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:52:55,191 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:52:55,228 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 547 statements into 1 equivalence classes.
[2025-02-05 11:52:55,250 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 547 of 547 statements.
[2025-02-05 11:52:55,250 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:52:55,250 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:52:55,640 INFO  L134       CoverageAnalysis]: Checked inductivity of 767 backedges. 531 proven. 39 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked.
[2025-02-05 11:52:55,640 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:52:55,640 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304899813]
[2025-02-05 11:52:55,640 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304899813] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-05 11:52:55,640 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [42414943]
[2025-02-05 11:52:55,640 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:52:55,640 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 11:52:55,641 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 11:52:55,643 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-02-05 11:52:55,644 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2025-02-05 11:52:55,696 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 547 statements into 1 equivalence classes.
[2025-02-05 11:52:55,769 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 547 of 547 statements.
[2025-02-05 11:52:55,769 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:52:55,769 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:52:55,771 INFO  L256         TraceCheckSpWp]: Trace formula consists of 679 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-02-05 11:52:55,778 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-05 11:52:55,879 INFO  L134       CoverageAnalysis]: Checked inductivity of 767 backedges. 243 proven. 0 refuted. 0 times theorem prover too weak. 524 trivial. 0 not checked.
[2025-02-05 11:52:55,880 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-02-05 11:52:55,880 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [42414943] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:52:55,880 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-02-05 11:52:55,880 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6
[2025-02-05 11:52:55,880 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660406185]
[2025-02-05 11:52:55,880 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:52:55,881 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:52:55,881 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:52:55,881 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:52:55,881 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2025-02-05 11:52:55,881 INFO  L87              Difference]: Start difference. First operand 7578 states and 8701 transitions. Second operand  has 3 states, 3 states have (on average 88.33333333333333) internal successors, (265), 3 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:52:56,843 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:52:56,843 INFO  L93              Difference]: Finished difference Result 17246 states and 20051 transitions.
[2025-02-05 11:52:56,844 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:52:56,844 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 88.33333333333333) internal successors, (265), 3 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 547
[2025-02-05 11:52:56,845 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:52:56,864 INFO  L225             Difference]: With dead ends: 17246
[2025-02-05 11:52:56,864 INFO  L226             Difference]: Without dead ends: 9969
[2025-02-05 11:52:56,871 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 550 GetRequests, 546 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2025-02-05 11:52:56,871 INFO  L435           NwaCegarLoop]: 426 mSDtfsCounter, 354 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 969 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 1096 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 969 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time
[2025-02-05 11:52:56,871 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [354 Valid, 446 Invalid, 1096 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 969 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2025-02-05 11:52:56,878 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 9969 states.
[2025-02-05 11:52:56,940 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 9969 to 9969.
[2025-02-05 11:52:56,955 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 9969 states, 9968 states have (on average 1.1498796147672552) internal successors, (11462), 9968 states have internal predecessors, (11462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:52:56,968 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9969 states to 9969 states and 11462 transitions.
[2025-02-05 11:52:56,969 INFO  L78                 Accepts]: Start accepts. Automaton has 9969 states and 11462 transitions. Word has length 547
[2025-02-05 11:52:56,969 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:52:56,969 INFO  L471      AbstractCegarLoop]: Abstraction has 9969 states and 11462 transitions.
[2025-02-05 11:52:56,970 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 88.33333333333333) internal successors, (265), 3 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:52:56,970 INFO  L276                IsEmpty]: Start isEmpty. Operand 9969 states and 11462 transitions.
[2025-02-05 11:52:56,973 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 552
[2025-02-05 11:52:56,974 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:52:56,975 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:52:56,982 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2025-02-05 11:52:57,175 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 11:52:57,176 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:52:57,176 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:52:57,176 INFO  L85        PathProgramCache]: Analyzing trace with hash -1456692194, now seen corresponding path program 1 times
[2025-02-05 11:52:57,176 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:52:57,176 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044984240]
[2025-02-05 11:52:57,176 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:52:57,176 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:52:57,216 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 551 statements into 1 equivalence classes.
[2025-02-05 11:52:57,245 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 551 of 551 statements.
[2025-02-05 11:52:57,245 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:52:57,245 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:52:57,516 INFO  L134       CoverageAnalysis]: Checked inductivity of 779 backedges. 479 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked.
[2025-02-05 11:52:57,516 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:52:57,517 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044984240]
[2025-02-05 11:52:57,517 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044984240] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:52:57,517 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:52:57,517 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:52:57,517 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810841006]
[2025-02-05 11:52:57,517 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:52:57,517 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:52:57,517 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:52:57,518 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:52:57,518 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:52:57,518 INFO  L87              Difference]: Start difference. First operand 9969 states and 11462 transitions. Second operand  has 3 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:52:58,683 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:52:58,683 INFO  L93              Difference]: Finished difference Result 24136 states and 28000 transitions.
[2025-02-05 11:52:58,683 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:52:58,684 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 0 states have call successors, (0), 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 551
[2025-02-05 11:52:58,684 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:52:58,705 INFO  L225             Difference]: With dead ends: 24136
[2025-02-05 11:52:58,705 INFO  L226             Difference]: Without dead ends: 14468
[2025-02-05 11:52:58,714 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:52:58,714 INFO  L435           NwaCegarLoop]: 590 mSDtfsCounter, 246 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 1040 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 1210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 1040 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time
[2025-02-05 11:52:58,715 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 623 Invalid, 1210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 1040 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2025-02-05 11:52:58,724 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 14468 states.
[2025-02-05 11:52:58,853 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 14468 to 14158.
[2025-02-05 11:52:58,863 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 14158 states, 14157 states have (on average 1.1347743165924984) internal successors, (16065), 14157 states have internal predecessors, (16065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:52:58,875 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 14158 states to 14158 states and 16065 transitions.
[2025-02-05 11:52:58,876 INFO  L78                 Accepts]: Start accepts. Automaton has 14158 states and 16065 transitions. Word has length 551
[2025-02-05 11:52:58,876 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:52:58,876 INFO  L471      AbstractCegarLoop]: Abstraction has 14158 states and 16065 transitions.
[2025-02-05 11:52:58,876 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:52:58,877 INFO  L276                IsEmpty]: Start isEmpty. Operand 14158 states and 16065 transitions.
[2025-02-05 11:52:58,883 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 627
[2025-02-05 11:52:58,883 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:52:58,884 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:52:58,884 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-02-05 11:52:58,884 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:52:58,884 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:52:58,885 INFO  L85        PathProgramCache]: Analyzing trace with hash -657931917, now seen corresponding path program 1 times
[2025-02-05 11:52:58,885 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:52:58,885 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110520829]
[2025-02-05 11:52:58,885 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:52:58,885 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:52:58,923 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 626 statements into 1 equivalence classes.
[2025-02-05 11:52:58,941 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 626 of 626 statements.
[2025-02-05 11:52:58,941 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:52:58,941 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:52:59,297 INFO  L134       CoverageAnalysis]: Checked inductivity of 1139 backedges. 688 proven. 39 refuted. 0 times theorem prover too weak. 412 trivial. 0 not checked.
[2025-02-05 11:52:59,297 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:52:59,297 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110520829]
[2025-02-05 11:52:59,297 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110520829] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-05 11:52:59,297 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1875727551]
[2025-02-05 11:52:59,297 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:52:59,297 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 11:52:59,298 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 11:52:59,299 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-02-05 11:52:59,301 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2025-02-05 11:52:59,356 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 626 statements into 1 equivalence classes.
[2025-02-05 11:52:59,422 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 626 of 626 statements.
[2025-02-05 11:52:59,423 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:52:59,423 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:52:59,425 INFO  L256         TraceCheckSpWp]: Trace formula consists of 784 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-02-05 11:52:59,429 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-05 11:52:59,507 INFO  L134       CoverageAnalysis]: Checked inductivity of 1139 backedges. 615 proven. 0 refuted. 0 times theorem prover too weak. 524 trivial. 0 not checked.
[2025-02-05 11:52:59,507 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-02-05 11:52:59,507 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1875727551] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:52:59,507 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-02-05 11:52:59,508 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6
[2025-02-05 11:52:59,508 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165683584]
[2025-02-05 11:52:59,508 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:52:59,508 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:52:59,508 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:52:59,509 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:52:59,509 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2025-02-05 11:52:59,509 INFO  L87              Difference]: Start difference. First operand 14158 states and 16065 transitions. Second operand  has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:53:00,443 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:53:00,443 INFO  L93              Difference]: Finished difference Result 27712 states and 31488 transitions.
[2025-02-05 11:53:00,443 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:53:00,443 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 626
[2025-02-05 11:53:00,444 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:53:00,461 INFO  L225             Difference]: With dead ends: 27712
[2025-02-05 11:53:00,461 INFO  L226             Difference]: Without dead ends: 13855
[2025-02-05 11:53:00,473 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 629 GetRequests, 625 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2025-02-05 11:53:00,475 INFO  L435           NwaCegarLoop]: 567 mSDtfsCounter, 252 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 878 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 1086 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 878 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time
[2025-02-05 11:53:00,475 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 604 Invalid, 1086 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 878 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2025-02-05 11:53:00,486 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 13855 states.
[2025-02-05 11:53:00,636 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 13855 to 13555.
[2025-02-05 11:53:00,648 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 13555 states, 13554 states have (on average 1.0829275490630073) internal successors, (14678), 13554 states have internal predecessors, (14678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:53:00,664 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 13555 states to 13555 states and 14678 transitions.
[2025-02-05 11:53:00,665 INFO  L78                 Accepts]: Start accepts. Automaton has 13555 states and 14678 transitions. Word has length 626
[2025-02-05 11:53:00,666 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:53:00,666 INFO  L471      AbstractCegarLoop]: Abstraction has 13555 states and 14678 transitions.
[2025-02-05 11:53:00,666 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:53:00,666 INFO  L276                IsEmpty]: Start isEmpty. Operand 13555 states and 14678 transitions.
[2025-02-05 11:53:00,675 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 628
[2025-02-05 11:53:00,676 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:53:00,676 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:53:00,682 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-05 11:53:00,876 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 11:53:00,877 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:53:00,877 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:53:00,877 INFO  L85        PathProgramCache]: Analyzing trace with hash 1677475494, now seen corresponding path program 1 times
[2025-02-05 11:53:00,877 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:53:00,877 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305254373]
[2025-02-05 11:53:00,877 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:53:00,877 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:53:00,935 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 627 statements into 1 equivalence classes.
[2025-02-05 11:53:00,964 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 627 of 627 statements.
[2025-02-05 11:53:00,964 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:53:00,964 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:53:01,390 INFO  L134       CoverageAnalysis]: Checked inductivity of 855 backedges. 615 proven. 39 refuted. 0 times theorem prover too weak. 201 trivial. 0 not checked.
[2025-02-05 11:53:01,390 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:53:01,390 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305254373]
[2025-02-05 11:53:01,391 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305254373] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-05 11:53:01,392 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1420683133]
[2025-02-05 11:53:01,392 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:53:01,392 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 11:53:01,392 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 11:53:01,394 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-05 11:53:01,396 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-05 11:53:01,464 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 627 statements into 1 equivalence classes.
[2025-02-05 11:53:01,547 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 627 of 627 statements.
[2025-02-05 11:53:01,547 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:53:01,547 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:53:01,550 INFO  L256         TraceCheckSpWp]: Trace formula consists of 766 conjuncts, 7 conjuncts are in the unsatisfiable core
[2025-02-05 11:53:01,556 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-05 11:53:02,123 INFO  L134       CoverageAnalysis]: Checked inductivity of 855 backedges. 615 proven. 39 refuted. 0 times theorem prover too weak. 201 trivial. 0 not checked.
[2025-02-05 11:53:02,124 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-02-05 11:53:02,656 INFO  L134       CoverageAnalysis]: Checked inductivity of 855 backedges. 615 proven. 39 refuted. 0 times theorem prover too weak. 201 trivial. 0 not checked.
[2025-02-05 11:53:02,657 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1420683133] provided 0 perfect and 2 imperfect interpolant sequences
[2025-02-05 11:53:02,657 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-02-05 11:53:02,657 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8
[2025-02-05 11:53:02,657 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84879926]
[2025-02-05 11:53:02,657 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-02-05 11:53:02,658 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2025-02-05 11:53:02,658 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:53:02,659 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2025-02-05 11:53:02,659 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72
[2025-02-05 11:53:02,659 INFO  L87              Difference]: Start difference. First operand 13555 states and 14678 transitions. Second operand  has 9 states, 9 states have (on average 86.33333333333333) internal successors, (777), 8 states have internal predecessors, (777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:53:06,475 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:53:06,475 INFO  L93              Difference]: Finished difference Result 35143 states and 38047 transitions.
[2025-02-05 11:53:06,475 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2025-02-05 11:53:06,476 INFO  L78                 Accepts]: Start accepts. Automaton has  has 9 states, 9 states have (on average 86.33333333333333) internal successors, (777), 8 states have internal predecessors, (777), 0 states have call successors, (0), 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 627
[2025-02-05 11:53:06,476 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:53:06,497 INFO  L225             Difference]: With dead ends: 35143
[2025-02-05 11:53:06,497 INFO  L226             Difference]: Without dead ends: 15948
[2025-02-05 11:53:06,510 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 1263 GetRequests, 1249 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240
[2025-02-05 11:53:06,510 INFO  L435           NwaCegarLoop]: 100 mSDtfsCounter, 3100 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 5500 mSolverCounterSat, 687 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3100 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 6187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 687 IncrementalHoareTripleChecker+Valid, 5500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time
[2025-02-05 11:53:06,511 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [3100 Valid, 229 Invalid, 6187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [687 Valid, 5500 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time]
[2025-02-05 11:53:06,520 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 15948 states.
[2025-02-05 11:53:06,603 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 15948 to 12357.
[2025-02-05 11:53:06,613 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 12357 states, 12356 states have (on average 1.0382000647458725) internal successors, (12828), 12356 states have internal predecessors, (12828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:53:06,623 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 12357 states to 12357 states and 12828 transitions.
[2025-02-05 11:53:06,623 INFO  L78                 Accepts]: Start accepts. Automaton has 12357 states and 12828 transitions. Word has length 627
[2025-02-05 11:53:06,623 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:53:06,623 INFO  L471      AbstractCegarLoop]: Abstraction has 12357 states and 12828 transitions.
[2025-02-05 11:53:06,624 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 86.33333333333333) internal successors, (777), 8 states have internal predecessors, (777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:53:06,624 INFO  L276                IsEmpty]: Start isEmpty. Operand 12357 states and 12828 transitions.
[2025-02-05 11:53:06,629 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 665
[2025-02-05 11:53:06,629 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:53:06,630 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:53:06,636 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-05 11:53:06,830 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,SelfDestructingSolverStorable11
[2025-02-05 11:53:06,831 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:53:06,831 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:53:06,831 INFO  L85        PathProgramCache]: Analyzing trace with hash -1013332014, now seen corresponding path program 1 times
[2025-02-05 11:53:06,831 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:53:06,831 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792213421]
[2025-02-05 11:53:06,832 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:53:06,832 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:53:06,902 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 664 statements into 1 equivalence classes.
[2025-02-05 11:53:06,935 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 664 of 664 statements.
[2025-02-05 11:53:06,935 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:53:06,936 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:53:07,734 INFO  L134       CoverageAnalysis]: Checked inductivity of 618 backedges. 266 proven. 352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 11:53:07,734 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:53:07,735 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792213421]
[2025-02-05 11:53:07,735 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792213421] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-05 11:53:07,735 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1595164496]
[2025-02-05 11:53:07,735 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:53:07,735 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 11:53:07,735 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 11:53:07,737 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-05 11:53:07,738 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-05 11:53:07,806 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 664 statements into 1 equivalence classes.
[2025-02-05 11:53:07,892 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 664 of 664 statements.
[2025-02-05 11:53:07,892 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:53:07,892 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:53:07,895 INFO  L256         TraceCheckSpWp]: Trace formula consists of 780 conjuncts, 5 conjuncts are in the unsatisfiable core
[2025-02-05 11:53:07,902 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-05 11:53:08,298 INFO  L134       CoverageAnalysis]: Checked inductivity of 618 backedges. 450 proven. 168 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 11:53:08,299 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-02-05 11:53:09,711 INFO  L134       CoverageAnalysis]: Checked inductivity of 618 backedges. 450 proven. 168 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 11:53:09,712 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1595164496] provided 0 perfect and 2 imperfect interpolant sequences
[2025-02-05 11:53:09,712 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-02-05 11:53:09,712 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12
[2025-02-05 11:53:09,712 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662357313]
[2025-02-05 11:53:09,712 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-02-05 11:53:09,713 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2025-02-05 11:53:09,714 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:53:09,715 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2025-02-05 11:53:09,715 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132
[2025-02-05 11:53:09,716 INFO  L87              Difference]: Start difference. First operand 12357 states and 12828 transitions. Second operand  has 12 states, 12 states have (on average 143.33333333333334) internal successors, (1720), 12 states have internal predecessors, (1720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:53:17,614 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:53:17,614 INFO  L93              Difference]: Finished difference Result 38337 states and 39862 transitions.
[2025-02-05 11:53:17,614 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. 
[2025-02-05 11:53:17,615 INFO  L78                 Accepts]: Start accepts. Automaton has  has 12 states, 12 states have (on average 143.33333333333334) internal successors, (1720), 12 states have internal predecessors, (1720), 0 states have call successors, (0), 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 664
[2025-02-05 11:53:17,615 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:53:17,637 INFO  L225             Difference]: With dead ends: 38337
[2025-02-05 11:53:17,637 INFO  L226             Difference]: Without dead ends: 25681
[2025-02-05 11:53:17,642 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 1397 GetRequests, 1343 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1048 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=591, Invalid=2489, Unknown=0, NotChecked=0, Total=3080
[2025-02-05 11:53:17,643 INFO  L435           NwaCegarLoop]: 77 mSDtfsCounter, 5703 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 14150 mSolverCounterSat, 1124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5703 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 15274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1124 IncrementalHoareTripleChecker+Valid, 14150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time
[2025-02-05 11:53:17,643 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [5703 Valid, 467 Invalid, 15274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1124 Valid, 14150 Invalid, 0 Unknown, 0 Unchecked, 7.1s Time]
[2025-02-05 11:53:17,656 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 25681 states.
[2025-02-05 11:53:17,817 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 25681 to 18951.
[2025-02-05 11:53:17,831 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 18951 states, 18950 states have (on average 1.0378364116094987) internal successors, (19667), 18950 states have internal predecessors, (19667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:53:17,847 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 18951 states to 18951 states and 19667 transitions.
[2025-02-05 11:53:17,847 INFO  L78                 Accepts]: Start accepts. Automaton has 18951 states and 19667 transitions. Word has length 664
[2025-02-05 11:53:17,848 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:53:17,848 INFO  L471      AbstractCegarLoop]: Abstraction has 18951 states and 19667 transitions.
[2025-02-05 11:53:17,848 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 12 states, 12 states have (on average 143.33333333333334) internal successors, (1720), 12 states have internal predecessors, (1720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:53:17,848 INFO  L276                IsEmpty]: Start isEmpty. Operand 18951 states and 19667 transitions.
[2025-02-05 11:53:17,855 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 732
[2025-02-05 11:53:17,855 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:53:17,856 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:53:17,863 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0
[2025-02-05 11:53:18,056 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12
[2025-02-05 11:53:18,057 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:53:18,058 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:53:18,058 INFO  L85        PathProgramCache]: Analyzing trace with hash 1016482512, now seen corresponding path program 1 times
[2025-02-05 11:53:18,058 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:53:18,058 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344593303]
[2025-02-05 11:53:18,058 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:53:18,058 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:53:18,101 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 731 statements into 1 equivalence classes.
[2025-02-05 11:53:18,133 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 731 of 731 statements.
[2025-02-05 11:53:18,133 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:53:18,133 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:53:18,373 INFO  L134       CoverageAnalysis]: Checked inductivity of 960 backedges. 565 proven. 0 refuted. 0 times theorem prover too weak. 395 trivial. 0 not checked.
[2025-02-05 11:53:18,373 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:53:18,373 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344593303]
[2025-02-05 11:53:18,373 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344593303] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:53:18,373 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:53:18,374 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:53:18,374 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879274728]
[2025-02-05 11:53:18,374 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:53:18,374 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:53:18,374 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:53:18,374 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:53:18,374 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:53:18,375 INFO  L87              Difference]: Start difference. First operand 18951 states and 19667 transitions. Second operand  has 3 states, 3 states have (on average 148.33333333333334) internal successors, (445), 3 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:53:19,085 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:53:19,085 INFO  L93              Difference]: Finished difference Result 37599 states and 39041 transitions.
[2025-02-05 11:53:19,085 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:53:19,085 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 148.33333333333334) internal successors, (445), 3 states have internal predecessors, (445), 0 states have call successors, (0), 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 731
[2025-02-05 11:53:19,086 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:53:19,099 INFO  L225             Difference]: With dead ends: 37599
[2025-02-05 11:53:19,099 INFO  L226             Difference]: Without dead ends: 19248
[2025-02-05 11:53:19,108 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:53:19,108 INFO  L435           NwaCegarLoop]: 64 mSDtfsCounter, 437 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 727 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 797 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-02-05 11:53:19,109 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 69 Invalid, 797 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 727 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-02-05 11:53:19,117 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 19248 states.
[2025-02-05 11:53:19,258 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 19248 to 18949.
[2025-02-05 11:53:19,268 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 18949 states, 18948 states have (on average 1.0377348532826685) internal successors, (19663), 18948 states have internal predecessors, (19663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:53:19,282 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 18949 states to 18949 states and 19663 transitions.
[2025-02-05 11:53:19,283 INFO  L78                 Accepts]: Start accepts. Automaton has 18949 states and 19663 transitions. Word has length 731
[2025-02-05 11:53:19,283 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:53:19,283 INFO  L471      AbstractCegarLoop]: Abstraction has 18949 states and 19663 transitions.
[2025-02-05 11:53:19,283 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 148.33333333333334) internal successors, (445), 3 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:53:19,283 INFO  L276                IsEmpty]: Start isEmpty. Operand 18949 states and 19663 transitions.
[2025-02-05 11:53:19,291 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 785
[2025-02-05 11:53:19,291 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:53:19,291 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:53:19,291 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2025-02-05 11:53:19,292 INFO  L396      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:53:19,292 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:53:19,292 INFO  L85        PathProgramCache]: Analyzing trace with hash -1378791495, now seen corresponding path program 1 times
[2025-02-05 11:53:19,292 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:53:19,292 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427842559]
[2025-02-05 11:53:19,292 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:53:19,292 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:53:19,340 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 784 statements into 1 equivalence classes.
[2025-02-05 11:53:19,367 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 784 of 784 statements.
[2025-02-05 11:53:19,367 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:53:19,367 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:53:19,705 INFO  L134       CoverageAnalysis]: Checked inductivity of 952 backedges. 679 proven. 0 refuted. 0 times theorem prover too weak. 273 trivial. 0 not checked.
[2025-02-05 11:53:19,705 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:53:19,705 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427842559]
[2025-02-05 11:53:19,705 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427842559] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:53:19,706 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:53:19,706 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:53:19,706 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709229484]
[2025-02-05 11:53:19,706 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:53:19,707 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:53:19,707 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:53:19,707 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:53:19,707 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:53:19,708 INFO  L87              Difference]: Start difference. First operand 18949 states and 19663 transitions. Second operand  has 3 states, 3 states have (on average 198.66666666666666) internal successors, (596), 3 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:53:20,543 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:53:20,543 INFO  L93              Difference]: Finished difference Result 39978 states and 41496 transitions.
[2025-02-05 11:53:20,544 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:53:20,544 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 198.66666666666666) internal successors, (596), 3 states have internal predecessors, (596), 0 states have call successors, (0), 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 784
[2025-02-05 11:53:20,545 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:53:20,565 INFO  L225             Difference]: With dead ends: 39978
[2025-02-05 11:53:20,565 INFO  L226             Difference]: Without dead ends: 21629
[2025-02-05 11:53:20,579 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:53:20,579 INFO  L435           NwaCegarLoop]: 490 mSDtfsCounter, 68 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 737 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 737 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-02-05 11:53:20,579 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 527 Invalid, 847 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 737 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-02-05 11:53:20,591 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 21629 states.
[2025-02-05 11:53:20,731 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 21629 to 18334.
[2025-02-05 11:53:20,743 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 18334 states, 18333 states have (on average 1.0314187530682377) internal successors, (18909), 18333 states have internal predecessors, (18909), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:53:20,757 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 18334 states to 18334 states and 18909 transitions.
[2025-02-05 11:53:20,758 INFO  L78                 Accepts]: Start accepts. Automaton has 18334 states and 18909 transitions. Word has length 784
[2025-02-05 11:53:20,758 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:53:20,758 INFO  L471      AbstractCegarLoop]: Abstraction has 18334 states and 18909 transitions.
[2025-02-05 11:53:20,758 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 198.66666666666666) internal successors, (596), 3 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:53:20,758 INFO  L276                IsEmpty]: Start isEmpty. Operand 18334 states and 18909 transitions.
[2025-02-05 11:53:20,769 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 814
[2025-02-05 11:53:20,769 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:53:20,769 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:53:20,770 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2025-02-05 11:53:20,770 INFO  L396      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:53:20,770 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:53:20,770 INFO  L85        PathProgramCache]: Analyzing trace with hash 1633213725, now seen corresponding path program 1 times
[2025-02-05 11:53:20,770 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:53:20,770 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131292216]
[2025-02-05 11:53:20,770 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:53:20,771 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:53:20,818 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 813 statements into 1 equivalence classes.
[2025-02-05 11:53:20,846 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 813 of 813 statements.
[2025-02-05 11:53:20,846 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:53:20,846 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:53:20,991 INFO  L134       CoverageAnalysis]: Checked inductivity of 1075 backedges. 598 proven. 0 refuted. 0 times theorem prover too weak. 477 trivial. 0 not checked.
[2025-02-05 11:53:20,992 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:53:20,992 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131292216]
[2025-02-05 11:53:20,992 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131292216] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:53:20,992 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:53:20,992 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:53:20,992 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046430741]
[2025-02-05 11:53:20,992 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:53:20,993 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:53:20,993 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:53:20,994 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:53:20,994 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:53:20,994 INFO  L87              Difference]: Start difference. First operand 18334 states and 18909 transitions. Second operand  has 3 states, 3 states have (on average 148.33333333333334) internal successors, (445), 3 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:53:21,704 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:53:21,704 INFO  L93              Difference]: Finished difference Result 38449 states and 39712 transitions.
[2025-02-05 11:53:21,705 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:53:21,705 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 148.33333333333334) internal successors, (445), 3 states have internal predecessors, (445), 0 states have call successors, (0), 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 813
[2025-02-05 11:53:21,705 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:53:21,722 INFO  L225             Difference]: With dead ends: 38449
[2025-02-05 11:53:21,722 INFO  L226             Difference]: Without dead ends: 20715
[2025-02-05 11:53:21,734 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:53:21,734 INFO  L435           NwaCegarLoop]: 439 mSDtfsCounter, 340 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 727 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 851 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-02-05 11:53:21,734 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [340 Valid, 465 Invalid, 851 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 727 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-02-05 11:53:21,745 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 20715 states.
[2025-02-05 11:53:21,864 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 20715 to 19818.
[2025-02-05 11:53:21,877 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 19818 states, 19817 states have (on average 1.029015491749508) internal successors, (20392), 19817 states have internal predecessors, (20392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:53:21,892 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 19818 states to 19818 states and 20392 transitions.
[2025-02-05 11:53:21,892 INFO  L78                 Accepts]: Start accepts. Automaton has 19818 states and 20392 transitions. Word has length 813
[2025-02-05 11:53:21,893 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:53:21,893 INFO  L471      AbstractCegarLoop]: Abstraction has 19818 states and 20392 transitions.
[2025-02-05 11:53:21,893 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 148.33333333333334) internal successors, (445), 3 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:53:21,893 INFO  L276                IsEmpty]: Start isEmpty. Operand 19818 states and 20392 transitions.
[2025-02-05 11:53:21,902 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 882
[2025-02-05 11:53:21,903 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:53:21,903 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:53:21,903 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2025-02-05 11:53:21,903 INFO  L396      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:53:21,903 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:53:21,903 INFO  L85        PathProgramCache]: Analyzing trace with hash 1135801006, now seen corresponding path program 1 times
[2025-02-05 11:53:21,904 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:53:21,904 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046918736]
[2025-02-05 11:53:21,904 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:53:21,904 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:53:21,951 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 881 statements into 1 equivalence classes.
[2025-02-05 11:53:22,009 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 881 of 881 statements.
[2025-02-05 11:53:22,009 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:53:22,009 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:53:23,510 INFO  L134       CoverageAnalysis]: Checked inductivity of 1445 backedges. 946 proven. 263 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked.
[2025-02-05 11:53:23,510 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:53:23,510 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046918736]
[2025-02-05 11:53:23,510 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046918736] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-05 11:53:23,511 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1109333898]
[2025-02-05 11:53:23,511 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:53:23,511 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 11:53:23,511 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 11:53:23,513 INFO  L229       MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-02-05 11:53:23,514 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process
[2025-02-05 11:53:23,594 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 881 statements into 1 equivalence classes.
[2025-02-05 11:53:23,692 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 881 of 881 statements.
[2025-02-05 11:53:23,692 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:53:23,692 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:53:23,694 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1037 conjuncts, 5 conjuncts are in the unsatisfiable core
[2025-02-05 11:53:23,704 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-05 11:53:24,021 INFO  L134       CoverageAnalysis]: Checked inductivity of 1445 backedges. 991 proven. 266 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked.
[2025-02-05 11:53:24,021 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-02-05 11:53:24,193 INFO  L134       CoverageAnalysis]: Checked inductivity of 1445 backedges. 803 proven. 0 refuted. 0 times theorem prover too weak. 642 trivial. 0 not checked.
[2025-02-05 11:53:24,193 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1109333898] provided 1 perfect and 1 imperfect interpolant sequences
[2025-02-05 11:53:24,193 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences.
[2025-02-05 11:53:24,193 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6, 5] total 10
[2025-02-05 11:53:24,193 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741783993]
[2025-02-05 11:53:24,193 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:53:24,194 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:53:24,194 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:53:24,194 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:53:24,194 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90
[2025-02-05 11:53:24,195 INFO  L87              Difference]: Start difference. First operand 19818 states and 20392 transitions. Second operand  has 3 states, 3 states have (on average 168.66666666666666) internal successors, (506), 3 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:53:24,758 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:53:24,758 INFO  L93              Difference]: Finished difference Result 32120 states and 32961 transitions.
[2025-02-05 11:53:24,758 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:53:24,759 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 168.66666666666666) internal successors, (506), 3 states have internal predecessors, (506), 0 states have call successors, (0), 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 881
[2025-02-05 11:53:24,759 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:53:24,771 INFO  L225             Difference]: With dead ends: 32120
[2025-02-05 11:53:24,771 INFO  L226             Difference]: Without dead ends: 12902
[2025-02-05 11:53:24,781 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 1766 GetRequests, 1758 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90
[2025-02-05 11:53:24,781 INFO  L435           NwaCegarLoop]: 63 mSDtfsCounter, 170 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 708 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 708 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-02-05 11:53:24,781 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 73 Invalid, 775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 708 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-02-05 11:53:24,788 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 12902 states.
[2025-02-05 11:53:24,851 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 12902 to 11100.
[2025-02-05 11:53:24,857 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 11100 states, 11099 states have (on average 1.0195513109289125) internal successors, (11316), 11099 states have internal predecessors, (11316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:53:24,865 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11100 states to 11100 states and 11316 transitions.
[2025-02-05 11:53:24,866 INFO  L78                 Accepts]: Start accepts. Automaton has 11100 states and 11316 transitions. Word has length 881
[2025-02-05 11:53:24,866 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:53:24,866 INFO  L471      AbstractCegarLoop]: Abstraction has 11100 states and 11316 transitions.
[2025-02-05 11:53:24,866 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 168.66666666666666) internal successors, (506), 3 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:53:24,866 INFO  L276                IsEmpty]: Start isEmpty. Operand 11100 states and 11316 transitions.
[2025-02-05 11:53:24,875 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 882
[2025-02-05 11:53:24,875 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:53:24,875 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:53:24,882 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0
[2025-02-05 11:53:25,076 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16
[2025-02-05 11:53:25,076 INFO  L396      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:53:25,076 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:53:25,077 INFO  L85        PathProgramCache]: Analyzing trace with hash -2139151096, now seen corresponding path program 1 times
[2025-02-05 11:53:25,077 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:53:25,077 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666591166]
[2025-02-05 11:53:25,077 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:53:25,077 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:53:25,129 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 881 statements into 1 equivalence classes.
[2025-02-05 11:53:25,166 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 881 of 881 statements.
[2025-02-05 11:53:25,166 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:53:25,166 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:53:25,710 INFO  L134       CoverageAnalysis]: Checked inductivity of 1141 backedges. 658 proven. 0 refuted. 0 times theorem prover too weak. 483 trivial. 0 not checked.
[2025-02-05 11:53:25,711 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:53:25,711 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666591166]
[2025-02-05 11:53:25,711 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666591166] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:53:25,711 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:53:25,711 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-05 11:53:25,711 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196793754]
[2025-02-05 11:53:25,711 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:53:25,711 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 11:53:25,711 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:53:25,712 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 11:53:25,712 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-02-05 11:53:25,712 INFO  L87              Difference]: Start difference. First operand 11100 states and 11316 transitions. Second operand  has 4 states, 4 states have (on average 126.25) internal successors, (505), 4 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:53:26,558 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:53:26,558 INFO  L93              Difference]: Finished difference Result 16194 states and 16476 transitions.
[2025-02-05 11:53:26,558 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 11:53:26,558 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 126.25) internal successors, (505), 4 states have internal predecessors, (505), 0 states have call successors, (0), 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 881
[2025-02-05 11:53:26,559 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:53:26,573 INFO  L225             Difference]: With dead ends: 16194
[2025-02-05 11:53:26,573 INFO  L226             Difference]: Without dead ends: 16192
[2025-02-05 11:53:26,578 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-02-05 11:53:26,578 INFO  L435           NwaCegarLoop]: 33 mSDtfsCounter, 447 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 1379 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 447 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 1445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 1379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time
[2025-02-05 11:53:26,578 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [447 Valid, 67 Invalid, 1445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 1379 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2025-02-05 11:53:26,586 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 16192 states.
[2025-02-05 11:53:26,656 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 16192 to 10801.
[2025-02-05 11:53:26,661 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 10801 states, 10800 states have (on average 1.0195370370370371) internal successors, (11011), 10800 states have internal predecessors, (11011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:53:26,669 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10801 states to 10801 states and 11011 transitions.
[2025-02-05 11:53:26,670 INFO  L78                 Accepts]: Start accepts. Automaton has 10801 states and 11011 transitions. Word has length 881
[2025-02-05 11:53:26,670 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:53:26,670 INFO  L471      AbstractCegarLoop]: Abstraction has 10801 states and 11011 transitions.
[2025-02-05 11:53:26,670 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 126.25) internal successors, (505), 4 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:53:26,671 INFO  L276                IsEmpty]: Start isEmpty. Operand 10801 states and 11011 transitions.
[2025-02-05 11:53:26,680 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 983
[2025-02-05 11:53:26,680 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:53:26,680 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:53:26,680 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2025-02-05 11:53:26,681 INFO  L396      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:53:26,681 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:53:26,681 INFO  L85        PathProgramCache]: Analyzing trace with hash 1291580810, now seen corresponding path program 1 times
[2025-02-05 11:53:26,681 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:53:26,681 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661080164]
[2025-02-05 11:53:26,681 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:53:26,681 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:53:26,735 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 982 statements into 1 equivalence classes.
[2025-02-05 11:53:26,854 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 982 of 982 statements.
[2025-02-05 11:53:26,854 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:53:26,854 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:53:30,090 INFO  L134       CoverageAnalysis]: Checked inductivity of 1479 backedges. 243 proven. 0 refuted. 0 times theorem prover too weak. 1236 trivial. 0 not checked.
[2025-02-05 11:53:30,091 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:53:30,092 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661080164]
[2025-02-05 11:53:30,092 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661080164] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:53:30,092 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:53:30,092 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:53:30,092 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575453073]
[2025-02-05 11:53:30,092 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:53:30,092 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:53:30,092 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:53:30,093 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:53:30,093 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:53:30,093 INFO  L87              Difference]: Start difference. First operand 10801 states and 11011 transitions. Second operand  has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:53:30,620 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:53:30,620 INFO  L93              Difference]: Finished difference Result 22796 states and 23251 transitions.
[2025-02-05 11:53:30,621 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:53:30,621 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 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 982
[2025-02-05 11:53:30,621 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:53:30,632 INFO  L225             Difference]: With dead ends: 22796
[2025-02-05 11:53:30,632 INFO  L226             Difference]: Without dead ends: 12296
[2025-02-05 11:53:30,638 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:53:30,638 INFO  L435           NwaCegarLoop]: 64 mSDtfsCounter, 268 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-02-05 11:53:30,638 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 82 Invalid, 745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-02-05 11:53:30,644 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 12296 states.
[2025-02-05 11:53:30,704 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 12296 to 11399.
[2025-02-05 11:53:30,710 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 11399 states, 11398 states have (on average 1.0157922442533778) internal successors, (11578), 11398 states have internal predecessors, (11578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:53:30,719 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11399 states to 11399 states and 11578 transitions.
[2025-02-05 11:53:30,720 INFO  L78                 Accepts]: Start accepts. Automaton has 11399 states and 11578 transitions. Word has length 982
[2025-02-05 11:53:30,721 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:53:30,721 INFO  L471      AbstractCegarLoop]: Abstraction has 11399 states and 11578 transitions.
[2025-02-05 11:53:30,721 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:53:30,721 INFO  L276                IsEmpty]: Start isEmpty. Operand 11399 states and 11578 transitions.
[2025-02-05 11:53:30,733 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1220
[2025-02-05 11:53:30,733 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:53:30,734 INFO  L218           NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:53:30,734 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2025-02-05 11:53:30,734 INFO  L396      AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:53:30,734 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:53:30,735 INFO  L85        PathProgramCache]: Analyzing trace with hash -1199703102, now seen corresponding path program 1 times
[2025-02-05 11:53:30,735 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:53:30,735 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105020178]
[2025-02-05 11:53:30,735 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:53:30,735 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:53:30,800 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1219 statements into 1 equivalence classes.
[2025-02-05 11:53:30,842 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1219 of 1219 statements.
[2025-02-05 11:53:30,842 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:53:30,842 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:53:31,622 INFO  L134       CoverageAnalysis]: Checked inductivity of 2397 backedges. 1166 proven. 0 refuted. 0 times theorem prover too weak. 1231 trivial. 0 not checked.
[2025-02-05 11:53:31,622 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:53:31,622 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105020178]
[2025-02-05 11:53:31,622 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105020178] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:53:31,622 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:53:31,622 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-05 11:53:31,622 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739672181]
[2025-02-05 11:53:31,623 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:53:31,623 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-05 11:53:31,623 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:53:31,624 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-05 11:53:31,624 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20
[2025-02-05 11:53:31,624 INFO  L87              Difference]: Start difference. First operand 11399 states and 11578 transitions. Second operand  has 5 states, 5 states have (on average 117.6) internal successors, (588), 5 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:53:32,799 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:53:32,799 INFO  L93              Difference]: Finished difference Result 26400 states and 26814 transitions.
[2025-02-05 11:53:32,799 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-05 11:53:32,799 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 117.6) internal successors, (588), 5 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1219
[2025-02-05 11:53:32,800 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:53:32,800 INFO  L225             Difference]: With dead ends: 26400
[2025-02-05 11:53:32,800 INFO  L226             Difference]: Without dead ends: 0
[2025-02-05 11:53:32,809 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20
[2025-02-05 11:53:32,810 INFO  L435           NwaCegarLoop]: 33 mSDtfsCounter, 664 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 2004 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 664 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 2126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 2004 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time
[2025-02-05 11:53:32,810 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [664 Valid, 65 Invalid, 2126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 2004 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2025-02-05 11:53:32,810 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2025-02-05 11:53:32,810 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2025-02-05 11:53:32,810 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:53:32,810 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2025-02-05 11:53:32,810 INFO  L78                 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1219
[2025-02-05 11:53:32,810 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:53:32,810 INFO  L471      AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2025-02-05 11:53:32,811 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 117.6) internal successors, (588), 5 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:53:32,811 INFO  L276                IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2025-02-05 11:53:32,811 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2025-02-05 11:53:32,813 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2025-02-05 11:53:32,814 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2025-02-05 11:53:32,816 INFO  L422         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:53:32,817 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.
[2025-02-05 11:53:35,561 INFO  L170   ceAbstractionStarter]: Computing trace abstraction results
[2025-02-05 11:53:35,592 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 11:53:35 BoogieIcfgContainer
[2025-02-05 11:53:35,593 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2025-02-05 11:53:35,593 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2025-02-05 11:53:35,593 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2025-02-05 11:53:35,593 INFO  L274        PluginConnector]: Witness Printer initialized
[2025-02-05 11:53:35,598 INFO  L184        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:52:41" (3/4) ...
[2025-02-05 11:53:35,600 INFO  L146         WitnessPrinter]: Generating witness for correct program
[2025-02-05 11:53:35,627 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges
[2025-02-05 11:53:35,629 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges
[2025-02-05 11:53:35,630 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges
[2025-02-05 11:53:35,632 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges
[2025-02-05 11:53:35,812 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml
[2025-02-05 11:53:35,812 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml
[2025-02-05 11:53:35,813 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2025-02-05 11:53:35,813 INFO  L158              Benchmark]: Toolchain (without parser) took 57352.24ms. Allocated memory was 142.6MB in the beginning and 2.0GB in the end (delta: 1.9GB). Free memory was 101.9MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB.
[2025-02-05 11:53:35,814 INFO  L158              Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory was 126.8MB in the beginning and 126.5MB in the end (delta: 307.6kB). There was no memory consumed. Max. memory is 16.1GB.
[2025-02-05 11:53:35,814 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 700.91ms. Allocated memory is still 142.6MB. Free memory was 101.9MB in the beginning and 89.7MB in the end (delta: 12.2MB). Peak memory consumption was 80.7MB. Max. memory is 16.1GB.
[2025-02-05 11:53:35,814 INFO  L158              Benchmark]: Boogie Procedure Inliner took 136.87ms. Allocated memory is still 142.6MB. Free memory was 89.7MB in the beginning and 52.4MB in the end (delta: 37.3MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB.
[2025-02-05 11:53:35,814 INFO  L158              Benchmark]: Boogie Preprocessor took 220.38ms. Allocated memory is still 142.6MB. Free memory was 52.4MB in the beginning and 46.6MB in the end (delta: 5.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
[2025-02-05 11:53:35,815 INFO  L158              Benchmark]: IcfgBuilder took 2135.37ms. Allocated memory was 142.6MB in the beginning and 352.3MB in the end (delta: 209.7MB). Free memory was 46.6MB in the beginning and 208.0MB in the end (delta: -161.4MB). Peak memory consumption was 185.1MB. Max. memory is 16.1GB.
[2025-02-05 11:53:35,815 INFO  L158              Benchmark]: TraceAbstraction took 53933.81ms. Allocated memory was 352.3MB in the beginning and 2.0GB in the end (delta: 1.7GB). Free memory was 208.0MB in the beginning and 600.0MB in the end (delta: -392.0MB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB.
[2025-02-05 11:53:35,817 INFO  L158              Benchmark]: Witness Printer took 219.56ms. Allocated memory is still 2.0GB. Free memory was 600.0MB in the beginning and 1.8GB in the end (delta: -1.2GB). Peak memory consumption was 18.2MB. Max. memory is 16.1GB.
[2025-02-05 11:53:35,817 INFO  L338   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory was 126.8MB in the beginning and 126.5MB in the end (delta: 307.6kB). There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 700.91ms. Allocated memory is still 142.6MB. Free memory was 101.9MB in the beginning and 89.7MB in the end (delta: 12.2MB). Peak memory consumption was 80.7MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 136.87ms. Allocated memory is still 142.6MB. Free memory was 89.7MB in the beginning and 52.4MB in the end (delta: 37.3MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB.
 * Boogie Preprocessor took 220.38ms. Allocated memory is still 142.6MB. Free memory was 52.4MB in the beginning and 46.6MB in the end (delta: 5.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
 * IcfgBuilder took 2135.37ms. Allocated memory was 142.6MB in the beginning and 352.3MB in the end (delta: 209.7MB). Free memory was 46.6MB in the beginning and 208.0MB in the end (delta: -161.4MB). Peak memory consumption was 185.1MB. Max. memory is 16.1GB.
 * TraceAbstraction took 53933.81ms. Allocated memory was 352.3MB in the beginning and 2.0GB in the end (delta: 1.7GB). Free memory was 208.0MB in the beginning and 600.0MB in the end (delta: -392.0MB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB.
 * Witness Printer took 219.56ms. Allocated memory is still 2.0GB. Free memory was 600.0MB in the beginning and 1.8GB in the end (delta: -1.2GB). Peak memory consumption was 18.2MB. Max. memory is 16.1GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: ErrorAutomatonStatistics
    NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0
  - PositiveResult [Line: 206]: a call to reach_error is unreachable
    For all program executions holds that a call to reach_error is unreachable at this location
  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 1 procedures, 424 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 51.1s, OverallIterations: 20, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 30.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 14029 SdHoareTripleChecker+Valid, 27.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 14029 mSDsluCounter, 7204 SdHoareTripleChecker+Invalid, 23.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1110 mSDsCounter, 4721 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 36685 IncrementalHoareTripleChecker+Invalid, 41406 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4721 mSolverCounterUnsat, 6094 mSDtfsCounter, 36685 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6163 GetRequests, 6058 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1101 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19818occurred in iteration=16, InterpolantAutomatonStates: 125, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.9s AutomataMinimizationTime, 20 MinimizatonAttempts, 25627 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 14.7s InterpolantComputationTime, 15173 NumberOfCodeBlocks, 15173 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 17316 ConstructedInterpolants, 0 QuantifiedInterpolants, 54755 SizeOfPredicates, 6 NumberOfNonLiveVariables, 4669 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 29 InterpolantComputations, 18 PerfectInterpolantSequences, 21737/23188 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available
  - AllSpecificationsHoldResult: All specifications hold
    1 specifications checked. All of them hold
  - InvariantResult [Line: 1776]: Location Invariant
    Derived location invariant: (((((((((((((((((((((((((((((((((((2 == a2) && (((long long) 89 + a4) <= 0)) && (((long long) a0 + 61) <= 0)) || ((((((28 <= a0) && (((long long) 89 + a4) <= 0)) && (0 <= (168748 + ((a29 >= 0) ? (a29 / 5) : ((a29 / 5) - 1))))) && (a2 == 4)) && ((((a29 >= 0) ? (a29 % 5) : ((a29 % 5) + 5)) != 0) || (0 < (168748 + ((a29 >= 0) ? (a29 / 5) : ((a29 / 5) - 1)))))) && (((long long) a29 + 127) <= 0))) || (((((((long long) 42 + a4) <= 0) && (195722 <= a29)) && (((long long) 98 + a0) <= 0)) && (0 <= ((long long) 146 + a0))) && (5 <= a2))) || (((((long long) 89 + a4) <= 0) && (a2 == 1)) && (((long long) a0 + 61) <= 0))) || (((((((long long) 42 + a4) <= 0) && (0 <= ((long long) a4 + 85))) && (44 <= a29)) && (((long long) a0 + 147) <= 0)) && (3 == a2))) || (((((long long) 89 + a4) <= 0) && (a2 == 1)) && (((long long) a29 + 127) == 0))) || ((((((((long long) 42 + a4) <= 0) && (0 <= ((long long) a4 + 85))) && (((long long) 98 + a0) <= 0)) && (5 <= a2)) && (0 <= ((long long) a29 + 143))) && (a29 <= 43))) || ((((((0 <= ((long long) 600000 + a0)) && (((long long) 42 + a4) <= 0)) && (0 <= ((long long) a4 + 85))) && (((long long) a0 + 147) <= 0)) && (a2 == 4)) && (0 <= ((long long) a29 + 143)))) || ((((((0 <= ((long long) 600000 + a0)) && (((long long) 42 + a4) <= 0)) && (2 == a2)) && (0 <= ((long long) a4 + 85))) && (((long long) a0 + 147) <= 0)) && (0 <= ((long long) a29 + 192415)))) || ((((((((long long) 42 + a4) <= 0) && (((long long) a0 + 147) <= 0)) && (0 <= (168748 + ((a29 >= 0) ? (a29 / 5) : ((a29 / 5) - 1))))) && ((((a29 >= 0) ? (a29 % 5) : ((a29 % 5) + 5)) != 0) || (0 < (168748 + ((a29 >= 0) ? (a29 / 5) : ((a29 / 5) - 1)))))) && (3 == a2)) && (((long long) a29 + 127) <= 0))) || ((((((((long long) 42 + a4) <= 0) && (((long long) 98 + a0) <= 0)) && (0 <= ((long long) 146 + a0))) && (a2 == 1)) && (0 <= (168748 + ((a29 >= 0) ? (a29 / 5) : ((a29 / 5) - 1))))) && ((((a29 >= 0) ? (a29 % 5) : ((a29 % 5) + 5)) != 0) || (0 < (168748 + ((a29 >= 0) ? (a29 / 5) : ((a29 / 5) - 1))))))) || (((((0 <= ((long long) 600000 + a0)) && (((long long) 42 + a4) <= 0)) && (((long long) 98 + a0) <= 0)) && (a2 == 1)) && (0 <= ((long long) a29 + 143)))) || (((((((((long long) 42 + a4) <= 0) && (0 <= ((long long) a4 + 85))) && (((long long) a0 + 147) <= 0)) && (0 <= (168748 + ((a29 >= 0) ? (a29 / 5) : ((a29 / 5) - 1))))) && (a2 == 4)) && ((((a29 >= 0) ? (a29 % 5) : ((a29 % 5) + 5)) != 0) || (0 < (168748 + ((a29 >= 0) ? (a29 / 5) : ((a29 / 5) - 1)))))) && (((long long) a29 + 127) <= 0))) || (((44 <= a29) && (((long long) 89 + a4) <= 0)) && (5 <= a2))) || (((((long long) 89 + a4) <= 0) && (a2 == 4)) && (((long long) a0 + 61) <= 0))) || (((a2 == 1) && (((long long) a4 + 86) <= 0)) && (((long long) a29 + 144) <= 0))) || ((((((long long) 89 + a4) <= 0) && (a2 == 4)) && (0 <= ((long long) a29 + 143))) && (a29 <= 43))) || ((((((long long) 89 + a4) <= 0) && (0 <= ((long long) 146 + a0))) && (5 <= a2)) && (0 <= ((long long) a29 + 143)))) || (((((0 <= ((long long) 600000 + a0)) && (((195722 <= a29) && (a2 == 4)) || ((0 <= ((long long) a4 + 85)) && (a2 == 4)))) && (((long long) 42 + a4) <= 0)) && (((long long) 98 + a0) <= 0)) && (143458 <= a29))) || ((((((long long) 89 + a4) <= 0) && (0 <= (168748 + ((a29 >= 0) ? (a29 / 5) : ((a29 / 5) - 1))))) && ((((a29 >= 0) ? (a29 % 5) : ((a29 % 5) + 5)) != 0) || (0 < (168748 + ((a29 >= 0) ? (a29 / 5) : ((a29 / 5) - 1)))))) && (3 == a2))) || ((((((long long) 42 + a4) <= 0) && (((long long) a0 + 147) <= 0)) && (96176 <= a29)) && (3 == a2))) || (((((((long long) 42 + a4) <= 0) && (((long long) a0 + 147) <= 0)) && (0 <= ((long long) a29 + 143))) && (3 == a2)) && (a29 <= 43))) || ((((2 == a2) && (44 <= a29)) && (((long long) 98 + a0) <= 0)) && (0 <= ((long long) 146 + a0)))) || ((((0 <= ((long long) 600000 + a0)) && (2 == a2)) && (44 <= a29)) && (((long long) a0 + 147) <= 0))) || (((((((a2 == 1) && (((long long) a0 + 61) <= 0)) || ((0 <= ((long long) a4 + 85)) && (a2 == 1))) && (((long long) 42 + a4) <= 0)) && (0 <= ((long long) 146 + a0))) && (0 <= ((long long) a29 + 143))) && (a29 <= 43))) || ((((((((long long) 42 + a4) <= 0) && (((long long) 98 + a0) <= 0)) && (0 <= ((long long) 146 + a0))) && (0 <= (168748 + ((a29 >= 0) ? (a29 / 5) : ((a29 / 5) - 1))))) && ((((a29 >= 0) ? (a29 % 5) : ((a29 % 5) + 5)) != 0) || (0 < (168748 + ((a29 >= 0) ? (a29 / 5) : ((a29 / 5) - 1)))))) && (3 == a2))) || (((((((((long long) 42 + a4) <= 0) && (0 <= ((long long) a4 + 85))) && (((long long) 98 + a0) <= 0)) && (0 <= ((long long) 146 + a0))) && (5 <= a2)) && (0 <= ((long long) 126661 + a29))) && (a29 <= 43))) || (((((long long) 89 + a4) <= 0) && (3 == a2)) && (((long long) a0 + 61) <= 0))) || ((((((0 <= ((long long) 600000 + a0)) && (((long long) 42 + a4) <= 0)) && (((long long) a0 + 147) <= 0)) && (a2 == 4)) && (0 <= ((long long) a29 + 143))) && (a29 <= 43))) || ((((((long long) 89 + a4) <= 0) && (5 <= a2)) && (((long long) a29 + 127) <= 0)) && (((long long) a0 + 61) <= 0))) || ((((2 == a2) && (((long long) 89 + a4) <= 0)) && (0 <= (168748 + ((a29 >= 0) ? (a29 / 5) : ((a29 / 5) - 1))))) && ((((a29 >= 0) ? (a29 % 5) : ((a29 % 5) + 5)) != 0) || (0 < (168748 + ((a29 >= 0) ? (a29 / 5) : ((a29 / 5) - 1))))))) || ((((((((long long) 42 + a4) <= 0) && (2 == a2)) && (0 <= ((long long) a4 + 85))) && (((long long) 98 + a0) <= 0)) && (0 <= ((long long) 146 + a0))) && (0 <= ((long long) a29 + 143)))) || (((((0 <= ((long long) 600000 + a0)) && (((long long) 42 + a4) <= 0)) && (44 <= a29)) && (((long long) a0 + 147) <= 0)) && (5 <= a2)))
RESULT: Ultimate proved your program to be correct!
[2025-02-05 11:53:35,837 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0
Received shutdown request...
--- End real Ultimate output ---

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