./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem12_label07.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/Problem12_label07.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 bcaadc0834b1e1668dc1393f3526c5eee7053e110c3b9c83c6fc0a5a0bac3de4
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-c00e63d-m
[2025-02-05 11:35:09,116 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-02-05 11:35:09,181 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:35:09,184 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-02-05 11:35:09,186 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-02-05 11:35:09,209 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-02-05 11:35:09,210 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-02-05 11:35:09,211 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-02-05 11:35:09,211 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-02-05 11:35:09,212 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-02-05 11:35:09,212 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-02-05 11:35:09,212 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-02-05 11:35:09,213 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-02-05 11:35:09,213 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-02-05 11:35:09,213 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-02-05 11:35:09,213 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-02-05 11:35:09,213 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-02-05 11:35:09,213 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-02-05 11:35:09,214 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-02-05 11:35:09,214 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-02-05 11:35:09,214 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-02-05 11:35:09,214 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-02-05 11:35:09,214 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-02-05 11:35:09,214 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-02-05 11:35:09,214 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-02-05 11:35:09,214 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-02-05 11:35:09,214 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-02-05 11:35:09,215 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-02-05 11:35:09,215 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-02-05 11:35:09,215 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-02-05 11:35:09,215 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-02-05 11:35:09,215 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-02-05 11:35:09,215 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-02-05 11:35:09,215 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-02-05 11:35:09,215 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-02-05 11:35:09,215 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-02-05 11:35:09,216 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-02-05 11:35:09,216 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-02-05 11:35:09,216 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-02-05 11:35:09,216 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-02-05 11:35:09,216 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-02-05 11:35:09,216 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-02-05 11:35:09,216 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-02-05 11:35:09,216 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 -> bcaadc0834b1e1668dc1393f3526c5eee7053e110c3b9c83c6fc0a5a0bac3de4
[2025-02-05 11:35:09,487 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-02-05 11:35:09,496 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-02-05 11:35:09,498 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-02-05 11:35:09,499 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-02-05 11:35:09,500 INFO  L274        PluginConnector]: CDTParser initialized
[2025-02-05 11:35:09,501 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem12_label07.c
[2025-02-05 11:35:10,724 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d185f978f/1189b8d3ace241eeb5f2eafea1c5b26d/FLAGbf58c2d18
[2025-02-05 11:35:11,173 INFO  L384              CDTParser]: Found 1 translation units.
[2025-02-05 11:35:11,174 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label07.c
[2025-02-05 11:35:11,209 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d185f978f/1189b8d3ace241eeb5f2eafea1c5b26d/FLAGbf58c2d18
[2025-02-05 11:35:11,228 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d185f978f/1189b8d3ace241eeb5f2eafea1c5b26d
[2025-02-05 11:35:11,230 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-02-05 11:35:11,232 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-02-05 11:35:11,235 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-02-05 11:35:11,235 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-02-05 11:35:11,239 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-02-05 11:35:11,241 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:35:11" (1/1) ...
[2025-02-05 11:35:11,243 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17470641 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:35:11, skipping insertion in model container
[2025-02-05 11:35:11,244 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:35:11" (1/1) ...
[2025-02-05 11:35:11,362 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-02-05 11:35:11,525 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/Problem12_label07.c[1203,1216]
[2025-02-05 11:35:12,009 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-05 11:35:12,022 INFO  L200         MainTranslator]: Completed pre-run
[2025-02-05 11:35:12,033 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/Problem12_label07.c[1203,1216]
[2025-02-05 11:35:12,301 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-05 11:35:12,318 INFO  L204         MainTranslator]: Completed translation
[2025-02-05 11:35:12,319 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:35:12 WrapperNode
[2025-02-05 11:35:12,319 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-02-05 11:35:12,320 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-02-05 11:35:12,321 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-02-05 11:35:12,321 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-02-05 11:35:12,325 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:35:12" (1/1) ...
[2025-02-05 11:35:12,361 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:35:12" (1/1) ...
[2025-02-05 11:35:12,698 INFO  L138                Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 4758
[2025-02-05 11:35:12,699 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-02-05 11:35:12,700 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-02-05 11:35:12,700 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-02-05 11:35:12,700 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-02-05 11:35:12,720 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:35:12" (1/1) ...
[2025-02-05 11:35:12,721 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:35:12" (1/1) ...
[2025-02-05 11:35:12,835 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:35:12" (1/1) ...
[2025-02-05 11:35:12,958 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:35:12,958 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:35:12" (1/1) ...
[2025-02-05 11:35:12,958 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:35:12" (1/1) ...
[2025-02-05 11:35:13,082 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:35:12" (1/1) ...
[2025-02-05 11:35:13,100 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:35:12" (1/1) ...
[2025-02-05 11:35:13,121 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:35:12" (1/1) ...
[2025-02-05 11:35:13,134 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:35:12" (1/1) ...
[2025-02-05 11:35:13,196 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-02-05 11:35:13,197 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-02-05 11:35:13,197 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-02-05 11:35:13,197 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-02-05 11:35:13,198 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:35:12" (1/1) ...
[2025-02-05 11:35:13,203 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-02-05 11:35:13,213 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 11:35:13,235 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:35:13,242 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:35:13,261 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-02-05 11:35:13,261 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-02-05 11:35:13,261 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-02-05 11:35:13,261 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-02-05 11:35:13,310 INFO  L257             CfgBuilder]: Building ICFG
[2025-02-05 11:35:13,312 INFO  L287             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-02-05 11:35:17,190 INFO  L1309  $ProcedureCfgBuilder]: dead code at ProgramPoint L4665: havoc calculate_output3_#t~ret11#1;
[2025-02-05 11:35:17,190 INFO  L1309  $ProcedureCfgBuilder]: dead code at ProgramPoint L1696: havoc calculate_output_#t~ret9#1;
[2025-02-05 11:35:17,191 INFO  L1309  $ProcedureCfgBuilder]: dead code at ProgramPoint L3175: havoc calculate_output2_#t~ret10#1;
[2025-02-05 11:35:17,390 INFO  L?                        ?]: Removed 702 outVars from TransFormulas that were not future-live.
[2025-02-05 11:35:17,391 INFO  L308             CfgBuilder]: Performing block encoding
[2025-02-05 11:35:17,424 INFO  L332             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-02-05 11:35:17,425 INFO  L337             CfgBuilder]: Removed 0 assume(true) statements.
[2025-02-05 11:35:17,425 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:35:17 BoogieIcfgContainer
[2025-02-05 11:35:17,425 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-02-05 11:35:17,427 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-02-05 11:35:17,428 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-02-05 11:35:17,432 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-02-05 11:35:17,433 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 11:35:11" (1/3) ...
[2025-02-05 11:35:17,433 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@589615a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:35:17, skipping insertion in model container
[2025-02-05 11:35:17,434 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:35:12" (2/3) ...
[2025-02-05 11:35:17,434 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@589615a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:35:17, skipping insertion in model container
[2025-02-05 11:35:17,434 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:35:17" (3/3) ...
[2025-02-05 11:35:17,435 INFO  L128   eAbstractionObserver]: Analyzing ICFG Problem12_label07.c
[2025-02-05 11:35:17,450 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-02-05 11:35:17,452 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG Problem12_label07.c that has 1 procedures, 818 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-02-05 11:35:17,524 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-02-05 11:35:17,534 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;@65d3815b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-02-05 11:35:17,534 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-02-05 11:35:17,542 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 818 states, 816 states have (on average 1.9166666666666667) internal successors, (1564), 817 states have internal predecessors, (1564), 0 states have call successors, (0), 0 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:35:17,547 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 7
[2025-02-05 11:35:17,547 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:35:17,548 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1]
[2025-02-05 11:35:17,548 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:35:17,552 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:35:17,553 INFO  L85        PathProgramCache]: Analyzing trace with hash -856045730, now seen corresponding path program 1 times
[2025-02-05 11:35:17,559 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:35:17,559 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338825044]
[2025-02-05 11:35:17,560 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:35:17,560 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:35:17,623 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes.
[2025-02-05 11:35:17,641 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements.
[2025-02-05 11:35:17,642 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:35:17,642 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:35:17,737 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:35:17,738 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:35:17,738 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338825044]
[2025-02-05 11:35:17,739 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338825044] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:35:17,739 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:35:17,739 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-02-05 11:35:17,741 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40493796]
[2025-02-05 11:35:17,741 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:35:17,744 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:35:17,745 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:35:17,759 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:35:17,759 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:35:17,763 INFO  L87              Difference]: Start difference. First operand  has 818 states, 816 states have (on average 1.9166666666666667) internal successors, (1564), 817 states have internal predecessors, (1564), 0 states have call successors, (0), 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 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 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:35:21,237 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:35:21,238 INFO  L93              Difference]: Finished difference Result 2388 states and 4626 transitions.
[2025-02-05 11:35:21,239 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:35:21,241 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 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 6
[2025-02-05 11:35:21,241 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:35:21,253 INFO  L225             Difference]: With dead ends: 2388
[2025-02-05 11:35:21,254 INFO  L226             Difference]: Without dead ends: 1506
[2025-02-05 11:35:21,258 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:35:21,260 INFO  L435           NwaCegarLoop]: 92 mSDtfsCounter, 853 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 2337 mSolverCounterSat, 1058 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 853 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 3395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1058 IncrementalHoareTripleChecker+Valid, 2337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time
[2025-02-05 11:35:21,260 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [853 Valid, 102 Invalid, 3395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1058 Valid, 2337 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time]
[2025-02-05 11:35:21,274 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1506 states.
[2025-02-05 11:35:21,322 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1506 to 1506.
[2025-02-05 11:35:21,325 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1506 states, 1505 states have (on average 1.869767441860465) internal successors, (2814), 1505 states have internal predecessors, (2814), 0 states have call successors, (0), 0 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:35:21,336 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1506 states to 1506 states and 2814 transitions.
[2025-02-05 11:35:21,337 INFO  L78                 Accepts]: Start accepts. Automaton has 1506 states and 2814 transitions. Word has length 6
[2025-02-05 11:35:21,338 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:35:21,338 INFO  L471      AbstractCegarLoop]: Abstraction has 1506 states and 2814 transitions.
[2025-02-05 11:35:21,338 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 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:35:21,338 INFO  L276                IsEmpty]: Start isEmpty. Operand 1506 states and 2814 transitions.
[2025-02-05 11:35:21,339 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 80
[2025-02-05 11:35:21,339 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:35:21,339 INFO  L218           NwaCegarLoop]: trace histogram [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]
[2025-02-05 11:35:21,340 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2025-02-05 11:35:21,340 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:35:21,340 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:35:21,340 INFO  L85        PathProgramCache]: Analyzing trace with hash 1033660093, now seen corresponding path program 1 times
[2025-02-05 11:35:21,340 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:35:21,340 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145407704]
[2025-02-05 11:35:21,340 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:35:21,340 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:35:21,363 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes.
[2025-02-05 11:35:21,400 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements.
[2025-02-05 11:35:21,402 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:35:21,403 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:35:21,721 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 11:35:21,722 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:35:21,722 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145407704]
[2025-02-05 11:35:21,722 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145407704] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:35:21,723 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:35:21,723 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:35:21,723 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956519012]
[2025-02-05 11:35:21,723 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:35:21,724 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 11:35:21,724 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:35:21,724 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 11:35:21,724 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-05 11:35:21,724 INFO  L87              Difference]: Start difference. First operand 1506 states and 2814 transitions. Second operand  has 4 states, 4 states have (on average 19.75) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 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:35:26,267 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:35:26,267 INFO  L93              Difference]: Finished difference Result 5271 states and 9820 transitions.
[2025-02-05 11:35:26,268 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-05 11:35:26,268 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 19.75) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 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 79
[2025-02-05 11:35:26,268 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:35:26,286 INFO  L225             Difference]: With dead ends: 5271
[2025-02-05 11:35:26,286 INFO  L226             Difference]: Without dead ends: 3767
[2025-02-05 11:35:26,289 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-02-05 11:35:26,290 INFO  L435           NwaCegarLoop]: 182 mSDtfsCounter, 2296 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 3612 mSolverCounterSat, 1535 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2296 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 5147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1535 IncrementalHoareTripleChecker+Valid, 3612 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time
[2025-02-05 11:35:26,290 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2296 Valid, 199 Invalid, 5147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1535 Valid, 3612 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time]
[2025-02-05 11:35:26,295 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3767 states.
[2025-02-05 11:35:26,390 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3767 to 3759.
[2025-02-05 11:35:26,403 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3759 states, 3758 states have (on average 1.6120276742948376) internal successors, (6058), 3758 states have internal predecessors, (6058), 0 states have call successors, (0), 0 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:35:26,414 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3759 states to 3759 states and 6058 transitions.
[2025-02-05 11:35:26,419 INFO  L78                 Accepts]: Start accepts. Automaton has 3759 states and 6058 transitions. Word has length 79
[2025-02-05 11:35:26,420 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:35:26,420 INFO  L471      AbstractCegarLoop]: Abstraction has 3759 states and 6058 transitions.
[2025-02-05 11:35:26,420 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 19.75) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 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:35:26,420 INFO  L276                IsEmpty]: Start isEmpty. Operand 3759 states and 6058 transitions.
[2025-02-05 11:35:26,429 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 148
[2025-02-05 11:35:26,429 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:35:26,429 INFO  L218           NwaCegarLoop]: trace histogram [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]
[2025-02-05 11:35:26,430 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-02-05 11:35:26,430 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:35:26,430 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:35:26,430 INFO  L85        PathProgramCache]: Analyzing trace with hash -1310635245, now seen corresponding path program 1 times
[2025-02-05 11:35:26,430 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:35:26,430 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419616190]
[2025-02-05 11:35:26,430 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:35:26,431 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:35:26,467 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes.
[2025-02-05 11:35:26,515 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements.
[2025-02-05 11:35:26,515 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:35:26,515 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:35:27,013 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 11:35:27,014 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:35:27,016 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419616190]
[2025-02-05 11:35:27,016 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419616190] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-05 11:35:27,016 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [634309305]
[2025-02-05 11:35:27,016 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:35:27,016 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 11:35:27,016 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 11:35:27,018 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:35:27,021 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:35:27,059 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes.
[2025-02-05 11:35:27,083 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements.
[2025-02-05 11:35:27,083 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:35:27,083 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:35:27,088 INFO  L256         TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-02-05 11:35:27,095 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-05 11:35:27,252 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2025-02-05 11:35:27,253 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-02-05 11:35:27,253 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [634309305] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:35:27,253 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-02-05 11:35:27,254 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4
[2025-02-05 11:35:27,254 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833087641]
[2025-02-05 11:35:27,254 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:35:27,254 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:35:27,254 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:35:27,254 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:35:27,254 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-05 11:35:27,255 INFO  L87              Difference]: Start difference. First operand 3759 states and 6058 transitions. Second operand  has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 2 states have internal predecessors, (145), 0 states have call successors, (0), 0 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:35:29,822 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:35:29,822 INFO  L93              Difference]: Finished difference Result 10520 states and 17412 transitions.
[2025-02-05 11:35:29,822 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:35:29,822 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 2 states have internal predecessors, (145), 0 states have call successors, (0), 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 147
[2025-02-05 11:35:29,823 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:35:29,840 INFO  L225             Difference]: With dead ends: 10520
[2025-02-05 11:35:29,841 INFO  L226             Difference]: Without dead ends: 6763
[2025-02-05 11:35:29,845 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-05 11:35:29,847 INFO  L435           NwaCegarLoop]: 635 mSDtfsCounter, 622 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2597 mSolverCounterSat, 505 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 622 SdHoareTripleChecker+Valid, 642 SdHoareTripleChecker+Invalid, 3102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 505 IncrementalHoareTripleChecker+Valid, 2597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time
[2025-02-05 11:35:29,848 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [622 Valid, 642 Invalid, 3102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [505 Valid, 2597 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time]
[2025-02-05 11:35:29,855 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 6763 states.
[2025-02-05 11:35:29,957 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 6763 to 6763.
[2025-02-05 11:35:29,967 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 6763 states, 6762 states have (on average 1.6311742088139605) internal successors, (11030), 6762 states have internal predecessors, (11030), 0 states have call successors, (0), 0 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:35:29,981 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6763 states to 6763 states and 11030 transitions.
[2025-02-05 11:35:29,981 INFO  L78                 Accepts]: Start accepts. Automaton has 6763 states and 11030 transitions. Word has length 147
[2025-02-05 11:35:29,982 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:35:29,982 INFO  L471      AbstractCegarLoop]: Abstraction has 6763 states and 11030 transitions.
[2025-02-05 11:35:29,983 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 2 states have internal predecessors, (145), 0 states have call successors, (0), 0 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:35:29,983 INFO  L276                IsEmpty]: Start isEmpty. Operand 6763 states and 11030 transitions.
[2025-02-05 11:35:29,985 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 155
[2025-02-05 11:35:29,987 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:35:29,988 INFO  L218           NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:35:29,994 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2025-02-05 11:35:30,188 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 11:35:30,188 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:35:30,189 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:35:30,189 INFO  L85        PathProgramCache]: Analyzing trace with hash 1357469519, now seen corresponding path program 1 times
[2025-02-05 11:35:30,189 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:35:30,189 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22907806]
[2025-02-05 11:35:30,189 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:35:30,189 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:35:30,206 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes.
[2025-02-05 11:35:30,223 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements.
[2025-02-05 11:35:30,223 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:35:30,223 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:35:30,478 INFO  L134       CoverageAnalysis]: Checked inductivity of 77 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 11:35:30,478 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:35:30,478 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22907806]
[2025-02-05 11:35:30,478 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22907806] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:35:30,478 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:35:30,478 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:35:30,478 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828159543]
[2025-02-05 11:35:30,479 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:35:30,479 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 11:35:30,479 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:35:30,479 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 11:35:30,479 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-02-05 11:35:30,479 INFO  L87              Difference]: Start difference. First operand 6763 states and 11030 transitions. Second operand  has 4 states, 4 states have (on average 38.5) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 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:35:33,513 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:35:33,514 INFO  L93              Difference]: Finished difference Result 18067 states and 29771 transitions.
[2025-02-05 11:35:33,514 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 11:35:33,514 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 38.5) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 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 154
[2025-02-05 11:35:33,514 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:35:33,539 INFO  L225             Difference]: With dead ends: 18067
[2025-02-05 11:35:33,539 INFO  L226             Difference]: Without dead ends: 11269
[2025-02-05 11:35:33,546 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-02-05 11:35:33,546 INFO  L435           NwaCegarLoop]: 694 mSDtfsCounter, 702 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 3107 mSolverCounterSat, 729 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 702 SdHoareTripleChecker+Valid, 708 SdHoareTripleChecker+Invalid, 3836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 729 IncrementalHoareTripleChecker+Valid, 3107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time
[2025-02-05 11:35:33,547 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [702 Valid, 708 Invalid, 3836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [729 Valid, 3107 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time]
[2025-02-05 11:35:33,555 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 11269 states.
[2025-02-05 11:35:33,649 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 11269 to 9767.
[2025-02-05 11:35:33,663 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 9767 states, 9766 states have (on average 1.4400983002252714) internal successors, (14064), 9766 states have internal predecessors, (14064), 0 states have call successors, (0), 0 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:35:33,677 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9767 states to 9767 states and 14064 transitions.
[2025-02-05 11:35:33,678 INFO  L78                 Accepts]: Start accepts. Automaton has 9767 states and 14064 transitions. Word has length 154
[2025-02-05 11:35:33,678 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:35:33,678 INFO  L471      AbstractCegarLoop]: Abstraction has 9767 states and 14064 transitions.
[2025-02-05 11:35:33,678 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 38.5) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 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:35:33,678 INFO  L276                IsEmpty]: Start isEmpty. Operand 9767 states and 14064 transitions.
[2025-02-05 11:35:33,681 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 225
[2025-02-05 11:35:33,683 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:35:33,683 INFO  L218           NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:33,684 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-02-05 11:35:33,684 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:35:33,685 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:35:33,685 INFO  L85        PathProgramCache]: Analyzing trace with hash 1692306974, now seen corresponding path program 1 times
[2025-02-05 11:35:33,685 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:35:33,686 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421266241]
[2025-02-05 11:35:33,686 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:35:33,686 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:35:33,716 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes.
[2025-02-05 11:35:33,734 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements.
[2025-02-05 11:35:33,735 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:35:33,735 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:35:34,071 INFO  L134       CoverageAnalysis]: Checked inductivity of 83 backedges. 7 proven. 54 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked.
[2025-02-05 11:35:34,072 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:35:34,072 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421266241]
[2025-02-05 11:35:34,072 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421266241] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-05 11:35:34,072 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1323775953]
[2025-02-05 11:35:34,072 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:35:34,072 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 11:35:34,072 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 11:35:34,074 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:35:34,077 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:35:34,114 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes.
[2025-02-05 11:35:34,153 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements.
[2025-02-05 11:35:34,153 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:35:34,153 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:35:34,155 INFO  L256         TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-02-05 11:35:34,158 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-05 11:35:34,246 INFO  L134       CoverageAnalysis]: Checked inductivity of 83 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 11:35:34,247 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-02-05 11:35:34,247 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1323775953] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:35:34,247 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-02-05 11:35:34,247 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5
[2025-02-05 11:35:34,247 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495734617]
[2025-02-05 11:35:34,247 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:35:34,248 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:35:34,248 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:35:34,248 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:35:34,248 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-05 11:35:34,248 INFO  L87              Difference]: Start difference. First operand 9767 states and 14064 transitions. Second operand  has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 0 states have call successors, (0), 0 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:35:36,799 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:35:36,800 INFO  L93              Difference]: Finished difference Result 25540 states and 38130 transitions.
[2025-02-05 11:35:36,800 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:35:36,800 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 0 states have call successors, (0), 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 224
[2025-02-05 11:35:36,801 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:35:36,836 INFO  L225             Difference]: With dead ends: 25540
[2025-02-05 11:35:36,836 INFO  L226             Difference]: Without dead ends: 15775
[2025-02-05 11:35:36,845 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-05 11:35:36,845 INFO  L435           NwaCegarLoop]: 370 mSDtfsCounter, 874 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2100 mSolverCounterSat, 703 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 874 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 2803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 703 IncrementalHoareTripleChecker+Valid, 2100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time
[2025-02-05 11:35:36,846 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [874 Valid, 376 Invalid, 2803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [703 Valid, 2100 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time]
[2025-02-05 11:35:36,859 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 15775 states.
[2025-02-05 11:35:36,985 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 15775 to 14273.
[2025-02-05 11:35:37,009 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 14273 states, 14272 states have (on average 1.4261491031390134) internal successors, (20354), 14272 states have internal predecessors, (20354), 0 states have call successors, (0), 0 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:35:37,102 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 14273 states to 14273 states and 20354 transitions.
[2025-02-05 11:35:37,104 INFO  L78                 Accepts]: Start accepts. Automaton has 14273 states and 20354 transitions. Word has length 224
[2025-02-05 11:35:37,104 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:35:37,107 INFO  L471      AbstractCegarLoop]: Abstraction has 14273 states and 20354 transitions.
[2025-02-05 11:35:37,108 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 0 states have call successors, (0), 0 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:35:37,108 INFO  L276                IsEmpty]: Start isEmpty. Operand 14273 states and 20354 transitions.
[2025-02-05 11:35:37,114 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 294
[2025-02-05 11:35:37,114 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:35:37,114 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:35:37,129 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:35:37,315 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 11:35:37,315 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:35:37,316 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:35:37,316 INFO  L85        PathProgramCache]: Analyzing trace with hash 314018911, now seen corresponding path program 1 times
[2025-02-05 11:35:37,316 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:35:37,316 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871652637]
[2025-02-05 11:35:37,316 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:35:37,316 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:35:37,339 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 293 statements into 1 equivalence classes.
[2025-02-05 11:35:37,356 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 293 of 293 statements.
[2025-02-05 11:35:37,356 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:35:37,356 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:35:37,747 INFO  L134       CoverageAnalysis]: Checked inductivity of 224 backedges. 152 proven. 54 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked.
[2025-02-05 11:35:37,748 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:35:37,748 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871652637]
[2025-02-05 11:35:37,748 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871652637] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-05 11:35:37,748 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1432383135]
[2025-02-05 11:35:37,748 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:35:37,748 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 11:35:37,748 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 11:35:37,751 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:35:37,759 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:35:37,820 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 293 statements into 1 equivalence classes.
[2025-02-05 11:35:37,882 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 293 of 293 statements.
[2025-02-05 11:35:37,882 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:35:37,882 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:35:37,885 INFO  L256         TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-02-05 11:35:37,890 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-05 11:35:37,918 INFO  L134       CoverageAnalysis]: Checked inductivity of 224 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 213 trivial. 0 not checked.
[2025-02-05 11:35:37,918 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-02-05 11:35:37,918 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1432383135] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:35:37,918 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-02-05 11:35:37,919 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5
[2025-02-05 11:35:37,919 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304427353]
[2025-02-05 11:35:37,919 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:35:37,919 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:35:37,919 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:35:37,920 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:35:37,920 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-02-05 11:35:37,920 INFO  L87              Difference]: Start difference. First operand 14273 states and 20354 transitions. Second operand  has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 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:35:40,475 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:35:40,476 INFO  L93              Difference]: Finished difference Result 29295 states and 41833 transitions.
[2025-02-05 11:35:40,476 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:35:40,476 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 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 293
[2025-02-05 11:35:40,477 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:35:40,511 INFO  L225             Difference]: With dead ends: 29295
[2025-02-05 11:35:40,511 INFO  L226             Difference]: Without dead ends: 15024
[2025-02-05 11:35:40,522 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 292 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-02-05 11:35:40,524 INFO  L435           NwaCegarLoop]: 1109 mSDtfsCounter, 868 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2198 mSolverCounterSat, 524 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 868 SdHoareTripleChecker+Valid, 1117 SdHoareTripleChecker+Invalid, 2722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 524 IncrementalHoareTripleChecker+Valid, 2198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time
[2025-02-05 11:35:40,524 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [868 Valid, 1117 Invalid, 2722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [524 Valid, 2198 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time]
[2025-02-05 11:35:40,536 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 15024 states.
[2025-02-05 11:35:40,674 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 15024 to 15024.
[2025-02-05 11:35:40,691 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 15024 states, 15023 states have (on average 1.274778672701857) internal successors, (19151), 15023 states have internal predecessors, (19151), 0 states have call successors, (0), 0 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:35:40,708 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 15024 states to 15024 states and 19151 transitions.
[2025-02-05 11:35:40,709 INFO  L78                 Accepts]: Start accepts. Automaton has 15024 states and 19151 transitions. Word has length 293
[2025-02-05 11:35:40,709 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:35:40,709 INFO  L471      AbstractCegarLoop]: Abstraction has 15024 states and 19151 transitions.
[2025-02-05 11:35:40,710 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 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:35:40,710 INFO  L276                IsEmpty]: Start isEmpty. Operand 15024 states and 19151 transitions.
[2025-02-05 11:35:40,719 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 428
[2025-02-05 11:35:40,719 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:35:40,720 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-02-05 11:35:40,729 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:35:40,920 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 11:35:40,921 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:35:40,921 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:35:40,921 INFO  L85        PathProgramCache]: Analyzing trace with hash -223779952, now seen corresponding path program 1 times
[2025-02-05 11:35:40,921 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:35:40,921 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774754863]
[2025-02-05 11:35:40,921 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:35:40,921 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:35:40,955 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 427 statements into 1 equivalence classes.
[2025-02-05 11:35:40,971 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 427 of 427 statements.
[2025-02-05 11:35:40,971 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:35:40,971 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:35:41,366 INFO  L134       CoverageAnalysis]: Checked inductivity of 288 backedges. 216 proven. 54 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked.
[2025-02-05 11:35:41,367 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:35:41,367 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774754863]
[2025-02-05 11:35:41,367 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774754863] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-05 11:35:41,367 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [512149157]
[2025-02-05 11:35:41,367 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:35:41,368 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 11:35:41,368 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 11:35:41,372 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:35:41,378 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:35:41,452 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 427 statements into 1 equivalence classes.
[2025-02-05 11:35:41,542 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 427 of 427 statements.
[2025-02-05 11:35:41,542 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:35:41,542 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:35:41,545 INFO  L256         TraceCheckSpWp]: Trace formula consists of 559 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-02-05 11:35:41,551 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-05 11:35:41,780 INFO  L134       CoverageAnalysis]: Checked inductivity of 288 backedges. 216 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked.
[2025-02-05 11:35:41,780 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-02-05 11:35:41,780 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [512149157] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:35:41,780 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-02-05 11:35:41,781 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4
[2025-02-05 11:35:41,781 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852307994]
[2025-02-05 11:35:41,781 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:35:41,781 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:35:41,781 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:35:41,782 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:35:41,782 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-05 11:35:41,782 INFO  L87              Difference]: Start difference. First operand 15024 states and 19151 transitions. Second operand  has 3 states, 3 states have (on average 119.0) internal successors, (357), 2 states have internal predecessors, (357), 0 states have call successors, (0), 0 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:35:44,214 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:35:44,215 INFO  L93              Difference]: Finished difference Result 37556 states and 47813 transitions.
[2025-02-05 11:35:44,218 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:35:44,218 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 119.0) internal successors, (357), 2 states have internal predecessors, (357), 0 states have call successors, (0), 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 427
[2025-02-05 11:35:44,218 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:35:44,271 INFO  L225             Difference]: With dead ends: 37556
[2025-02-05 11:35:44,274 INFO  L226             Difference]: Without dead ends: 22534
[2025-02-05 11:35:44,288 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 429 GetRequests, 426 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-05 11:35:44,289 INFO  L435           NwaCegarLoop]: 421 mSDtfsCounter, 697 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1973 mSolverCounterSat, 798 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 697 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 2771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 798 IncrementalHoareTripleChecker+Valid, 1973 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time
[2025-02-05 11:35:44,289 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [697 Valid, 427 Invalid, 2771 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [798 Valid, 1973 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time]
[2025-02-05 11:35:44,338 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 22534 states.
[2025-02-05 11:35:44,598 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 22534 to 17277.
[2025-02-05 11:35:44,623 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 17277 states, 17276 states have (on average 1.1979046075480435) internal successors, (20695), 17276 states have internal predecessors, (20695), 0 states have call successors, (0), 0 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:35:44,638 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 17277 states to 17277 states and 20695 transitions.
[2025-02-05 11:35:44,639 INFO  L78                 Accepts]: Start accepts. Automaton has 17277 states and 20695 transitions. Word has length 427
[2025-02-05 11:35:44,639 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:35:44,640 INFO  L471      AbstractCegarLoop]: Abstraction has 17277 states and 20695 transitions.
[2025-02-05 11:35:44,640 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 119.0) internal successors, (357), 2 states have internal predecessors, (357), 0 states have call successors, (0), 0 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:35:44,640 INFO  L276                IsEmpty]: Start isEmpty. Operand 17277 states and 20695 transitions.
[2025-02-05 11:35:44,649 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 507
[2025-02-05 11:35:44,649 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:35:44,650 INFO  L218           NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:44,657 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0
[2025-02-05 11:35:44,851 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,SelfDestructingSolverStorable6
[2025-02-05 11:35:44,851 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:35:44,851 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:35:44,852 INFO  L85        PathProgramCache]: Analyzing trace with hash 2011796054, now seen corresponding path program 1 times
[2025-02-05 11:35:44,852 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:35:44,852 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883816321]
[2025-02-05 11:35:44,852 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:35:44,852 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:35:44,891 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 506 statements into 1 equivalence classes.
[2025-02-05 11:35:44,922 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 506 of 506 statements.
[2025-02-05 11:35:44,922 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:35:44,922 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:35:45,443 INFO  L134       CoverageAnalysis]: Checked inductivity of 518 backedges. 299 proven. 108 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked.
[2025-02-05 11:35:45,443 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:35:45,443 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883816321]
[2025-02-05 11:35:45,443 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883816321] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-05 11:35:45,443 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1977596066]
[2025-02-05 11:35:45,443 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:35:45,443 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 11:35:45,443 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 11:35:45,446 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:35:45,447 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:35:45,499 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 506 statements into 1 equivalence classes.
[2025-02-05 11:35:45,603 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 506 of 506 statements.
[2025-02-05 11:35:45,603 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:35:45,603 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:35:45,608 INFO  L256         TraceCheckSpWp]: Trace formula consists of 663 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-02-05 11:35:45,614 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-05 11:35:45,711 INFO  L134       CoverageAnalysis]: Checked inductivity of 518 backedges. 436 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked.
[2025-02-05 11:35:45,712 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-02-05 11:35:45,712 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1977596066] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:35:45,712 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-02-05 11:35:45,712 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5
[2025-02-05 11:35:45,712 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942738663]
[2025-02-05 11:35:45,712 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:35:45,713 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:35:45,713 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:35:45,714 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:35:45,714 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-05 11:35:45,714 INFO  L87              Difference]: Start difference. First operand 17277 states and 20695 transitions. Second operand  has 3 states, 3 states have (on average 142.0) internal successors, (426), 3 states have internal predecessors, (426), 0 states have call successors, (0), 0 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:35:48,323 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:35:48,323 INFO  L93              Difference]: Finished difference Result 42062 states and 50941 transitions.
[2025-02-05 11:35:48,324 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:35:48,324 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 142.0) internal successors, (426), 3 states have internal predecessors, (426), 0 states have call successors, (0), 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 506
[2025-02-05 11:35:48,324 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:35:48,370 INFO  L225             Difference]: With dead ends: 42062
[2025-02-05 11:35:48,370 INFO  L226             Difference]: Without dead ends: 24787
[2025-02-05 11:35:48,388 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 508 GetRequests, 505 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-05 11:35:48,389 INFO  L435           NwaCegarLoop]: 232 mSDtfsCounter, 792 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2075 mSolverCounterSat, 792 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 792 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 2867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 792 IncrementalHoareTripleChecker+Valid, 2075 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time
[2025-02-05 11:35:48,389 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [792 Valid, 238 Invalid, 2867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [792 Valid, 2075 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time]
[2025-02-05 11:35:48,406 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 24787 states.
[2025-02-05 11:35:48,601 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 24787 to 24787.
[2025-02-05 11:35:48,624 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 24787 states, 24786 states have (on average 1.1758250625353022) internal successors, (29144), 24786 states have internal predecessors, (29144), 0 states have call successors, (0), 0 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:35:48,769 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 24787 states to 24787 states and 29144 transitions.
[2025-02-05 11:35:48,770 INFO  L78                 Accepts]: Start accepts. Automaton has 24787 states and 29144 transitions. Word has length 506
[2025-02-05 11:35:48,771 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:35:48,771 INFO  L471      AbstractCegarLoop]: Abstraction has 24787 states and 29144 transitions.
[2025-02-05 11:35:48,771 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 142.0) internal successors, (426), 3 states have internal predecessors, (426), 0 states have call successors, (0), 0 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:35:48,771 INFO  L276                IsEmpty]: Start isEmpty. Operand 24787 states and 29144 transitions.
[2025-02-05 11:35:48,782 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 545
[2025-02-05 11:35:48,782 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:35:48,782 INFO  L218           NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:48,790 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:35:48,983 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 11:35:48,983 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:35:48,984 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:35:48,984 INFO  L85        PathProgramCache]: Analyzing trace with hash -915694537, now seen corresponding path program 1 times
[2025-02-05 11:35:48,984 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:35:48,984 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755181397]
[2025-02-05 11:35:48,984 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:35:48,984 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:35:49,018 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 544 statements into 1 equivalence classes.
[2025-02-05 11:35:49,039 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 544 of 544 statements.
[2025-02-05 11:35:49,039 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:35:49,039 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:35:49,237 INFO  L134       CoverageAnalysis]: Checked inductivity of 594 backedges. 517 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked.
[2025-02-05 11:35:49,237 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:35:49,237 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755181397]
[2025-02-05 11:35:49,237 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755181397] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:35:49,237 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:35:49,237 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:35:49,238 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489651045]
[2025-02-05 11:35:49,238 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:35:49,238 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:35:49,238 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:35:49,238 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:35:49,238 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:35:49,239 INFO  L87              Difference]: Start difference. First operand 24787 states and 29144 transitions. Second operand  has 3 states, 3 states have (on average 157.66666666666666) internal successors, (473), 3 states have internal predecessors, (473), 0 states have call successors, (0), 0 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:35:51,728 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:35:51,728 INFO  L93              Difference]: Finished difference Result 51825 states and 60749 transitions.
[2025-02-05 11:35:51,729 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:35:51,729 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 157.66666666666666) internal successors, (473), 3 states have internal predecessors, (473), 0 states have call successors, (0), 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 544
[2025-02-05 11:35:51,729 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:35:51,758 INFO  L225             Difference]: With dead ends: 51825
[2025-02-05 11:35:51,758 INFO  L226             Difference]: Without dead ends: 27040
[2025-02-05 11:35:51,769 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:35:51,770 INFO  L435           NwaCegarLoop]: 1170 mSDtfsCounter, 651 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2573 mSolverCounterSat, 382 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 651 SdHoareTripleChecker+Valid, 1177 SdHoareTripleChecker+Invalid, 2955 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 382 IncrementalHoareTripleChecker+Valid, 2573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time
[2025-02-05 11:35:51,770 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [651 Valid, 1177 Invalid, 2955 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [382 Valid, 2573 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time]
[2025-02-05 11:35:51,786 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 27040 states.
[2025-02-05 11:35:51,942 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 27040 to 27040.
[2025-02-05 11:35:51,966 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 27040 states, 27039 states have (on average 1.143348496615999) internal successors, (30915), 27039 states have internal predecessors, (30915), 0 states have call successors, (0), 0 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:35:51,991 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 27040 states to 27040 states and 30915 transitions.
[2025-02-05 11:35:51,991 INFO  L78                 Accepts]: Start accepts. Automaton has 27040 states and 30915 transitions. Word has length 544
[2025-02-05 11:35:51,991 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:35:51,991 INFO  L471      AbstractCegarLoop]: Abstraction has 27040 states and 30915 transitions.
[2025-02-05 11:35:51,992 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 157.66666666666666) internal successors, (473), 3 states have internal predecessors, (473), 0 states have call successors, (0), 0 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:35:51,993 INFO  L276                IsEmpty]: Start isEmpty. Operand 27040 states and 30915 transitions.
[2025-02-05 11:35:52,002 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 549
[2025-02-05 11:35:52,003 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:35:52,003 INFO  L218           NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:52,003 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-02-05 11:35:52,003 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:35:52,003 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:35:52,004 INFO  L85        PathProgramCache]: Analyzing trace with hash -516016383, now seen corresponding path program 1 times
[2025-02-05 11:35:52,004 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:35:52,004 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877787188]
[2025-02-05 11:35:52,004 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:35:52,004 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:35:52,033 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 548 statements into 1 equivalence classes.
[2025-02-05 11:35:52,052 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 548 of 548 statements.
[2025-02-05 11:35:52,052 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:35:52,052 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:35:52,393 INFO  L134       CoverageAnalysis]: Checked inductivity of 598 backedges. 345 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked.
[2025-02-05 11:35:52,396 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:35:52,397 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877787188]
[2025-02-05 11:35:52,397 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877787188] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:35:52,397 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:35:52,397 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:35:52,397 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802414680]
[2025-02-05 11:35:52,397 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:35:52,397 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:35:52,398 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:35:52,398 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:35:52,398 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:35:52,398 INFO  L87              Difference]: Start difference. First operand 27040 states and 30915 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:35:54,644 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:35:54,644 INFO  L93              Difference]: Finished difference Result 57833 states and 65687 transitions.
[2025-02-05 11:35:54,644 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:35:54,645 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 548
[2025-02-05 11:35:54,645 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:35:54,680 INFO  L225             Difference]: With dead ends: 57833
[2025-02-05 11:35:54,680 INFO  L226             Difference]: Without dead ends: 27040
[2025-02-05 11:35:54,692 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:35:54,693 INFO  L435           NwaCegarLoop]: 1229 mSDtfsCounter, 604 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2180 mSolverCounterSat, 526 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 604 SdHoareTripleChecker+Valid, 1237 SdHoareTripleChecker+Invalid, 2706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 526 IncrementalHoareTripleChecker+Valid, 2180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time
[2025-02-05 11:35:54,693 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [604 Valid, 1237 Invalid, 2706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [526 Valid, 2180 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time]
[2025-02-05 11:35:54,712 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 27040 states.
[2025-02-05 11:35:54,913 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 27040 to 27040.
[2025-02-05 11:35:54,935 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 27040 states, 27039 states have (on average 1.1010762232331077) internal successors, (29772), 27039 states have internal predecessors, (29772), 0 states have call successors, (0), 0 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:35:54,960 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 27040 states to 27040 states and 29772 transitions.
[2025-02-05 11:35:54,960 INFO  L78                 Accepts]: Start accepts. Automaton has 27040 states and 29772 transitions. Word has length 548
[2025-02-05 11:35:54,961 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:35:54,961 INFO  L471      AbstractCegarLoop]: Abstraction has 27040 states and 29772 transitions.
[2025-02-05 11:35:54,961 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:35:54,961 INFO  L276                IsEmpty]: Start isEmpty. Operand 27040 states and 29772 transitions.
[2025-02-05 11:35:54,970 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 604
[2025-02-05 11:35:54,970 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:35:54,971 INFO  L218           NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:54,971 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-02-05 11:35:54,971 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:35:54,972 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:35:54,972 INFO  L85        PathProgramCache]: Analyzing trace with hash 83403327, now seen corresponding path program 1 times
[2025-02-05 11:35:54,972 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:35:54,972 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936088265]
[2025-02-05 11:35:54,972 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:35:54,972 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:35:55,004 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 603 statements into 1 equivalence classes.
[2025-02-05 11:35:55,023 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 603 of 603 statements.
[2025-02-05 11:35:55,023 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:35:55,023 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:35:55,132 INFO  L134       CoverageAnalysis]: Checked inductivity of 619 backedges. 530 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked.
[2025-02-05 11:35:55,132 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:35:55,132 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936088265]
[2025-02-05 11:35:55,132 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936088265] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:35:55,132 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:35:55,133 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:35:55,134 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91219338]
[2025-02-05 11:35:55,134 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:35:55,134 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:35:55,136 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:35:55,136 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:35:55,136 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:35:55,137 INFO  L87              Difference]: Start difference. First operand 27040 states and 29772 transitions. Second operand  has 3 states, 3 states have (on average 172.0) internal successors, (516), 3 states have internal predecessors, (516), 0 states have call successors, (0), 0 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:35:57,626 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:35:57,627 INFO  L93              Difference]: Finished difference Result 72102 states and 79481 transitions.
[2025-02-05 11:35:57,627 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:35:57,627 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 172.0) internal successors, (516), 3 states have internal predecessors, (516), 0 states have call successors, (0), 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 603
[2025-02-05 11:35:57,628 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:35:57,675 INFO  L225             Difference]: With dead ends: 72102
[2025-02-05 11:35:57,675 INFO  L226             Difference]: Without dead ends: 45815
[2025-02-05 11:35:57,697 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:35:57,697 INFO  L435           NwaCegarLoop]: 492 mSDtfsCounter, 687 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2263 mSolverCounterSat, 638 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 687 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 2901 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 638 IncrementalHoareTripleChecker+Valid, 2263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time
[2025-02-05 11:35:57,697 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [687 Valid, 499 Invalid, 2901 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [638 Valid, 2263 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time]
[2025-02-05 11:35:57,728 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 45815 states.
[2025-02-05 11:35:57,984 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 45815 to 45064.
[2025-02-05 11:35:58,011 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 45064 states, 45063 states have (on average 1.0807536116104122) internal successors, (48702), 45063 states have internal predecessors, (48702), 0 states have call successors, (0), 0 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:35:58,049 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 45064 states to 45064 states and 48702 transitions.
[2025-02-05 11:35:58,050 INFO  L78                 Accepts]: Start accepts. Automaton has 45064 states and 48702 transitions. Word has length 603
[2025-02-05 11:35:58,050 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:35:58,050 INFO  L471      AbstractCegarLoop]: Abstraction has 45064 states and 48702 transitions.
[2025-02-05 11:35:58,050 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 172.0) internal successors, (516), 3 states have internal predecessors, (516), 0 states have call successors, (0), 0 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:35:58,051 INFO  L276                IsEmpty]: Start isEmpty. Operand 45064 states and 48702 transitions.
[2025-02-05 11:35:58,062 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 631
[2025-02-05 11:35:58,063 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:35:58,063 INFO  L218           NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:58,063 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-02-05 11:35:58,063 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:35:58,064 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:35:58,064 INFO  L85        PathProgramCache]: Analyzing trace with hash -2099472805, now seen corresponding path program 1 times
[2025-02-05 11:35:58,064 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:35:58,064 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186881165]
[2025-02-05 11:35:58,064 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:35:58,064 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:35:58,173 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 630 statements into 1 equivalence classes.
[2025-02-05 11:35:58,189 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 630 of 630 statements.
[2025-02-05 11:35:58,189 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:35:58,189 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:35:58,306 INFO  L134       CoverageAnalysis]: Checked inductivity of 689 backedges. 573 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked.
[2025-02-05 11:35:58,306 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:35:58,306 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186881165]
[2025-02-05 11:35:58,306 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186881165] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:35:58,306 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:35:58,307 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:35:58,307 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238737127]
[2025-02-05 11:35:58,307 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:35:58,307 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:35:58,307 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:35:58,308 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:35:58,308 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:35:58,308 INFO  L87              Difference]: Start difference. First operand 45064 states and 48702 transitions. Second operand  has 3 states, 3 states have (on average 172.0) internal successors, (516), 3 states have internal predecessors, (516), 0 states have call successors, (0), 0 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:36:00,644 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:36:00,645 INFO  L93              Difference]: Finished difference Result 104395 states and 113207 transitions.
[2025-02-05 11:36:00,645 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:36:00,645 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 172.0) internal successors, (516), 3 states have internal predecessors, (516), 0 states have call successors, (0), 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 630
[2025-02-05 11:36:00,646 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:36:00,718 INFO  L225             Difference]: With dead ends: 104395
[2025-02-05 11:36:00,718 INFO  L226             Difference]: Without dead ends: 60084
[2025-02-05 11:36:00,750 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:36:00,751 INFO  L435           NwaCegarLoop]: 1283 mSDtfsCounter, 664 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2324 mSolverCounterSat, 510 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 664 SdHoareTripleChecker+Valid, 1291 SdHoareTripleChecker+Invalid, 2834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 510 IncrementalHoareTripleChecker+Valid, 2324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time
[2025-02-05 11:36:00,751 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [664 Valid, 1291 Invalid, 2834 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [510 Valid, 2324 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time]
[2025-02-05 11:36:00,793 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 60084 states.
[2025-02-05 11:36:01,250 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 60084 to 57080.
[2025-02-05 11:36:01,292 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 57080 states, 57079 states have (on average 1.0714798787645194) internal successors, (61159), 57079 states have internal predecessors, (61159), 0 states have call successors, (0), 0 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:36:01,354 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 57080 states to 57080 states and 61159 transitions.
[2025-02-05 11:36:01,355 INFO  L78                 Accepts]: Start accepts. Automaton has 57080 states and 61159 transitions. Word has length 630
[2025-02-05 11:36:01,355 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:36:01,355 INFO  L471      AbstractCegarLoop]: Abstraction has 57080 states and 61159 transitions.
[2025-02-05 11:36:01,355 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 172.0) internal successors, (516), 3 states have internal predecessors, (516), 0 states have call successors, (0), 0 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:36:01,355 INFO  L276                IsEmpty]: Start isEmpty. Operand 57080 states and 61159 transitions.
[2025-02-05 11:36:01,373 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 631
[2025-02-05 11:36:01,373 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:36:01,374 INFO  L218           NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:01,374 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2025-02-05 11:36:01,374 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:36:01,374 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:36:01,375 INFO  L85        PathProgramCache]: Analyzing trace with hash -368440421, now seen corresponding path program 1 times
[2025-02-05 11:36:01,375 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:36:01,375 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662217523]
[2025-02-05 11:36:01,375 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:36:01,375 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:36:01,423 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 630 statements into 1 equivalence classes.
[2025-02-05 11:36:01,444 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 630 of 630 statements.
[2025-02-05 11:36:01,444 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:36:01,444 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:36:01,658 INFO  L134       CoverageAnalysis]: Checked inductivity of 685 backedges. 565 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked.
[2025-02-05 11:36:01,658 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:36:01,658 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662217523]
[2025-02-05 11:36:01,659 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662217523] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:36:01,659 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:36:01,659 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:36:01,659 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942967334]
[2025-02-05 11:36:01,659 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:36:01,660 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:36:01,660 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:36:01,661 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:36:01,661 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:36:01,661 INFO  L87              Difference]: Start difference. First operand 57080 states and 61159 transitions. Second operand  has 3 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 0 states have call successors, (0), 0 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:36:03,948 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:36:03,948 INFO  L93              Difference]: Finished difference Result 123921 states and 133391 transitions.
[2025-02-05 11:36:03,949 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:36:03,949 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 0 states have call successors, (0), 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 630
[2025-02-05 11:36:03,949 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:36:04,023 INFO  L225             Difference]: With dead ends: 123921
[2025-02-05 11:36:04,023 INFO  L226             Difference]: Without dead ends: 67594
[2025-02-05 11:36:04,062 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:36:04,063 INFO  L435           NwaCegarLoop]: 1262 mSDtfsCounter, 669 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2226 mSolverCounterSat, 383 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 669 SdHoareTripleChecker+Valid, 1270 SdHoareTripleChecker+Invalid, 2609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 383 IncrementalHoareTripleChecker+Valid, 2226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time
[2025-02-05 11:36:04,063 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [669 Valid, 1270 Invalid, 2609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [383 Valid, 2226 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time]
[2025-02-05 11:36:04,119 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 67594 states.
[2025-02-05 11:36:04,651 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 67594 to 66092.
[2025-02-05 11:36:04,699 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 66092 states, 66091 states have (on average 1.0617028037100362) internal successors, (70169), 66091 states have internal predecessors, (70169), 0 states have call successors, (0), 0 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:36:04,761 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 66092 states to 66092 states and 70169 transitions.
[2025-02-05 11:36:04,761 INFO  L78                 Accepts]: Start accepts. Automaton has 66092 states and 70169 transitions. Word has length 630
[2025-02-05 11:36:04,761 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:36:04,761 INFO  L471      AbstractCegarLoop]: Abstraction has 66092 states and 70169 transitions.
[2025-02-05 11:36:04,762 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 0 states have call successors, (0), 0 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:36:04,762 INFO  L276                IsEmpty]: Start isEmpty. Operand 66092 states and 70169 transitions.
[2025-02-05 11:36:04,777 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 660
[2025-02-05 11:36:04,777 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:36:04,777 INFO  L218           NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:04,777 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2025-02-05 11:36:04,778 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:36:04,778 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:36:04,778 INFO  L85        PathProgramCache]: Analyzing trace with hash 40898355, now seen corresponding path program 1 times
[2025-02-05 11:36:04,778 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:36:04,778 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293542049]
[2025-02-05 11:36:04,779 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:36:04,779 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:36:04,816 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 659 statements into 1 equivalence classes.
[2025-02-05 11:36:04,834 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 659 of 659 statements.
[2025-02-05 11:36:04,834 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:36:04,834 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:36:05,214 INFO  L134       CoverageAnalysis]: Checked inductivity of 750 backedges. 606 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked.
[2025-02-05 11:36:05,215 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:36:05,215 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293542049]
[2025-02-05 11:36:05,215 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293542049] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:36:05,215 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:36:05,215 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:36:05,215 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496438347]
[2025-02-05 11:36:05,215 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:36:05,216 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:36:05,216 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:36:05,216 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:36:05,216 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:36:05,217 INFO  L87              Difference]: Start difference. First operand 66092 states and 70169 transitions. Second operand  has 3 states, 3 states have (on average 172.33333333333334) internal successors, (517), 3 states have internal predecessors, (517), 0 states have call successors, (0), 0 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:36:07,628 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:36:07,628 INFO  L93              Difference]: Finished difference Result 159218 states and 169701 transitions.
[2025-02-05 11:36:07,629 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:36:07,629 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 172.33333333333334) internal successors, (517), 3 states have internal predecessors, (517), 0 states have call successors, (0), 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 659
[2025-02-05 11:36:07,629 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:36:07,720 INFO  L225             Difference]: With dead ends: 159218
[2025-02-05 11:36:07,720 INFO  L226             Difference]: Without dead ends: 93879
[2025-02-05 11:36:07,751 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:36:07,751 INFO  L435           NwaCegarLoop]: 1256 mSDtfsCounter, 712 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2125 mSolverCounterSat, 514 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 712 SdHoareTripleChecker+Valid, 1263 SdHoareTripleChecker+Invalid, 2639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 514 IncrementalHoareTripleChecker+Valid, 2125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time
[2025-02-05 11:36:07,751 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [712 Valid, 1263 Invalid, 2639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [514 Valid, 2125 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time]
[2025-02-05 11:36:07,804 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 93879 states.
[2025-02-05 11:36:08,348 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 93879 to 89373.
[2025-02-05 11:36:08,400 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 89373 states, 89372 states have (on average 1.0569082039117397) internal successors, (94458), 89372 states have internal predecessors, (94458), 0 states have call successors, (0), 0 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:36:08,714 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 89373 states to 89373 states and 94458 transitions.
[2025-02-05 11:36:08,715 INFO  L78                 Accepts]: Start accepts. Automaton has 89373 states and 94458 transitions. Word has length 659
[2025-02-05 11:36:08,715 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:36:08,715 INFO  L471      AbstractCegarLoop]: Abstraction has 89373 states and 94458 transitions.
[2025-02-05 11:36:08,715 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 172.33333333333334) internal successors, (517), 3 states have internal predecessors, (517), 0 states have call successors, (0), 0 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:36:08,715 INFO  L276                IsEmpty]: Start isEmpty. Operand 89373 states and 94458 transitions.
[2025-02-05 11:36:08,727 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 666
[2025-02-05 11:36:08,727 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:36:08,727 INFO  L218           NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:08,727 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2025-02-05 11:36:08,727 INFO  L396      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:36:08,728 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:36:08,728 INFO  L85        PathProgramCache]: Analyzing trace with hash -1728682492, now seen corresponding path program 1 times
[2025-02-05 11:36:08,728 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:36:08,728 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825865552]
[2025-02-05 11:36:08,728 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:36:08,728 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:36:08,766 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 665 statements into 1 equivalence classes.
[2025-02-05 11:36:08,783 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 665 of 665 statements.
[2025-02-05 11:36:08,783 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:36:08,783 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:36:09,168 INFO  L134       CoverageAnalysis]: Checked inductivity of 768 backedges. 624 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked.
[2025-02-05 11:36:09,169 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:36:09,169 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825865552]
[2025-02-05 11:36:09,169 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825865552] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:36:09,169 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:36:09,169 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:36:09,169 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712920581]
[2025-02-05 11:36:09,169 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:36:09,170 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:36:09,170 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:36:09,174 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:36:09,175 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:36:09,175 INFO  L87              Difference]: Start difference. First operand 89373 states and 94458 transitions. Second operand  has 3 states, 3 states have (on average 174.33333333333334) internal successors, (523), 3 states have internal predecessors, (523), 0 states have call successors, (0), 0 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:36:11,845 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:36:11,845 INFO  L93              Difference]: Finished difference Result 214041 states and 226589 transitions.
[2025-02-05 11:36:11,846 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:36:11,846 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 174.33333333333334) internal successors, (523), 3 states have internal predecessors, (523), 0 states have call successors, (0), 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 665
[2025-02-05 11:36:11,846 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:36:11,994 INFO  L225             Difference]: With dead ends: 214041
[2025-02-05 11:36:11,994 INFO  L226             Difference]: Without dead ends: 125421
[2025-02-05 11:36:12,040 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:36:12,041 INFO  L435           NwaCegarLoop]: 284 mSDtfsCounter, 671 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2423 mSolverCounterSat, 524 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 671 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 2947 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 524 IncrementalHoareTripleChecker+Valid, 2423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time
[2025-02-05 11:36:12,041 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [671 Valid, 290 Invalid, 2947 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [524 Valid, 2423 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time]
[2025-02-05 11:36:12,120 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 125421 states.
[2025-02-05 11:36:13,260 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 125421 to 103642.
[2025-02-05 11:36:13,324 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 103642 states, 103641 states have (on average 1.0607867542767824) internal successors, (109941), 103641 states have internal predecessors, (109941), 0 states have call successors, (0), 0 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:36:13,423 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 103642 states to 103642 states and 109941 transitions.
[2025-02-05 11:36:13,424 INFO  L78                 Accepts]: Start accepts. Automaton has 103642 states and 109941 transitions. Word has length 665
[2025-02-05 11:36:13,424 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:36:13,424 INFO  L471      AbstractCegarLoop]: Abstraction has 103642 states and 109941 transitions.
[2025-02-05 11:36:13,424 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 174.33333333333334) internal successors, (523), 3 states have internal predecessors, (523), 0 states have call successors, (0), 0 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:36:13,424 INFO  L276                IsEmpty]: Start isEmpty. Operand 103642 states and 109941 transitions.
[2025-02-05 11:36:13,439 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 735
[2025-02-05 11:36:13,440 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:36:13,440 INFO  L218           NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:13,440 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2025-02-05 11:36:13,440 INFO  L396      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:36:13,440 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:36:13,441 INFO  L85        PathProgramCache]: Analyzing trace with hash -741008873, now seen corresponding path program 1 times
[2025-02-05 11:36:13,441 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:36:13,441 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863489101]
[2025-02-05 11:36:13,441 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:36:13,441 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:36:13,480 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 734 statements into 1 equivalence classes.
[2025-02-05 11:36:13,512 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 734 of 734 statements.
[2025-02-05 11:36:13,512 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:36:13,512 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:36:14,687 INFO  L134       CoverageAnalysis]: Checked inductivity of 855 backedges. 478 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked.
[2025-02-05 11:36:14,688 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:36:14,688 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863489101]
[2025-02-05 11:36:14,688 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863489101] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:36:14,688 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:36:14,688 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-05 11:36:14,688 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018134956]
[2025-02-05 11:36:14,688 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:36:14,689 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 11:36:14,689 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:36:14,690 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 11:36:14,690 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-05 11:36:14,690 INFO  L87              Difference]: Start difference. First operand 103642 states and 109941 transitions. Second operand  has 4 states, 4 states have (on average 118.75) internal successors, (475), 4 states have internal predecessors, (475), 0 states have call successors, (0), 0 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:36:17,839 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:36:17,839 INFO  L93              Difference]: Finished difference Result 206715 states and 219308 transitions.
[2025-02-05 11:36:17,839 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-05 11:36:17,839 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 118.75) internal successors, (475), 4 states have internal predecessors, (475), 0 states have call successors, (0), 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 734
[2025-02-05 11:36:17,840 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:36:17,964 INFO  L225             Difference]: With dead ends: 206715
[2025-02-05 11:36:17,964 INFO  L226             Difference]: Without dead ends: 103826
[2025-02-05 11:36:18,028 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-02-05 11:36:18,029 INFO  L435           NwaCegarLoop]: 1375 mSDtfsCounter, 653 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 3872 mSolverCounterSat, 470 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 653 SdHoareTripleChecker+Valid, 1395 SdHoareTripleChecker+Invalid, 4342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 470 IncrementalHoareTripleChecker+Valid, 3872 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time
[2025-02-05 11:36:18,029 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [653 Valid, 1395 Invalid, 4342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [470 Valid, 3872 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time]
[2025-02-05 11:36:18,104 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 103826 states.
[2025-02-05 11:36:19,217 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 103826 to 103642.
[2025-02-05 11:36:19,287 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 103642 states, 103641 states have (on average 1.0576026861956176) internal successors, (109611), 103641 states have internal predecessors, (109611), 0 states have call successors, (0), 0 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:36:19,382 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 103642 states to 103642 states and 109611 transitions.
[2025-02-05 11:36:19,383 INFO  L78                 Accepts]: Start accepts. Automaton has 103642 states and 109611 transitions. Word has length 734
[2025-02-05 11:36:19,384 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:36:19,384 INFO  L471      AbstractCegarLoop]: Abstraction has 103642 states and 109611 transitions.
[2025-02-05 11:36:19,384 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 118.75) internal successors, (475), 4 states have internal predecessors, (475), 0 states have call successors, (0), 0 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:36:19,384 INFO  L276                IsEmpty]: Start isEmpty. Operand 103642 states and 109611 transitions.
[2025-02-05 11:36:19,400 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 770
[2025-02-05 11:36:19,400 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:36:19,400 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-02-05 11:36:19,400 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2025-02-05 11:36:19,401 INFO  L396      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:36:19,402 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:36:19,403 INFO  L85        PathProgramCache]: Analyzing trace with hash -1998831255, now seen corresponding path program 1 times
[2025-02-05 11:36:19,403 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:36:19,403 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951197912]
[2025-02-05 11:36:19,403 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:36:19,403 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:36:19,444 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 769 statements into 1 equivalence classes.
[2025-02-05 11:36:19,463 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 769 of 769 statements.
[2025-02-05 11:36:19,464 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:36:19,464 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:36:20,694 INFO  L134       CoverageAnalysis]: Checked inductivity of 1096 backedges. 737 proven. 257 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked.
[2025-02-05 11:36:20,694 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:36:20,695 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951197912]
[2025-02-05 11:36:20,695 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951197912] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-05 11:36:20,695 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1403199123]
[2025-02-05 11:36:20,695 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:36:20,695 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 11:36:20,695 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 11:36:20,697 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:36:20,698 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:36:20,767 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 769 statements into 1 equivalence classes.
[2025-02-05 11:36:20,860 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 769 of 769 statements.
[2025-02-05 11:36:20,860 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:36:20,860 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:36:20,863 INFO  L256         TraceCheckSpWp]: Trace formula consists of 949 conjuncts, 3 conjuncts are in the unsatisfiable core
[2025-02-05 11:36:20,869 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-05 11:36:21,479 INFO  L134       CoverageAnalysis]: Checked inductivity of 1096 backedges. 517 proven. 0 refuted. 0 times theorem prover too weak. 579 trivial. 0 not checked.
[2025-02-05 11:36:21,480 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-02-05 11:36:21,480 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1403199123] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:36:21,480 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-02-05 11:36:21,480 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8
[2025-02-05 11:36:21,480 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844037210]
[2025-02-05 11:36:21,480 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:36:21,480 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:36:21,481 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:36:21,481 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:36:21,481 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2025-02-05 11:36:21,481 INFO  L87              Difference]: Start difference. First operand 103642 states and 109611 transitions. Second operand  has 3 states, 3 states have (on average 150.66666666666666) internal successors, (452), 3 states have internal predecessors, (452), 0 states have call successors, (0), 0 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:36:23,731 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:36:23,731 INFO  L93              Difference]: Finished difference Result 209535 states and 221550 transitions.
[2025-02-05 11:36:23,732 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:36:23,732 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 150.66666666666666) internal successors, (452), 3 states have internal predecessors, (452), 0 states have call successors, (0), 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 769
[2025-02-05 11:36:23,732 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:36:23,844 INFO  L225             Difference]: With dead ends: 209535
[2025-02-05 11:36:23,844 INFO  L226             Difference]: Without dead ends: 104393
[2025-02-05 11:36:23,887 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 774 GetRequests, 768 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2025-02-05 11:36:23,887 INFO  L435           NwaCegarLoop]: 1372 mSDtfsCounter, 491 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2179 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 491 SdHoareTripleChecker+Valid, 1379 SdHoareTripleChecker+Invalid, 2298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 2179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time
[2025-02-05 11:36:23,887 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [491 Valid, 1379 Invalid, 2298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 2179 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time]
[2025-02-05 11:36:23,948 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 104393 states.
[2025-02-05 11:36:24,772 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 104393 to 104393.
[2025-02-05 11:36:24,820 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 104393 states, 104392 states have (on average 1.055713081462181) internal successors, (110208), 104392 states have internal predecessors, (110208), 0 states have call successors, (0), 0 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:36:24,916 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 104393 states to 104393 states and 110208 transitions.
[2025-02-05 11:36:24,917 INFO  L78                 Accepts]: Start accepts. Automaton has 104393 states and 110208 transitions. Word has length 769
[2025-02-05 11:36:24,917 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:36:24,917 INFO  L471      AbstractCegarLoop]: Abstraction has 104393 states and 110208 transitions.
[2025-02-05 11:36:24,917 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 150.66666666666666) internal successors, (452), 3 states have internal predecessors, (452), 0 states have call successors, (0), 0 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:36:24,918 INFO  L276                IsEmpty]: Start isEmpty. Operand 104393 states and 110208 transitions.
[2025-02-05 11:36:24,934 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 778
[2025-02-05 11:36:24,934 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:36:24,935 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 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]
[2025-02-05 11:36:24,943 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:36:25,135 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:36:25,135 INFO  L396      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:36:25,136 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:36:25,136 INFO  L85        PathProgramCache]: Analyzing trace with hash -977863467, now seen corresponding path program 1 times
[2025-02-05 11:36:25,136 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:36:25,136 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450142618]
[2025-02-05 11:36:25,136 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:36:25,136 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:36:25,176 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 777 statements into 1 equivalence classes.
[2025-02-05 11:36:25,194 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 777 of 777 statements.
[2025-02-05 11:36:25,195 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:36:25,195 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:36:26,079 INFO  L134       CoverageAnalysis]: Checked inductivity of 1117 backedges. 736 proven. 0 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked.
[2025-02-05 11:36:26,080 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:36:26,080 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450142618]
[2025-02-05 11:36:26,080 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450142618] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:36:26,080 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:36:26,080 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:36:26,080 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276765525]
[2025-02-05 11:36:26,080 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:36:26,080 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:36:26,080 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:36:26,081 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:36:26,081 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:36:26,081 INFO  L87              Difference]: Start difference. First operand 104393 states and 110208 transitions. Second operand  has 3 states, 3 states have (on average 171.66666666666666) internal successors, (515), 3 states have internal predecessors, (515), 0 states have call successors, (0), 0 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:36:28,504 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:36:28,504 INFO  L93              Difference]: Finished difference Result 210286 states and 221953 transitions.
[2025-02-05 11:36:28,505 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:36:28,505 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 171.66666666666666) internal successors, (515), 3 states have internal predecessors, (515), 0 states have call successors, (0), 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 777
[2025-02-05 11:36:28,505 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:36:28,644 INFO  L225             Difference]: With dead ends: 210286
[2025-02-05 11:36:28,645 INFO  L226             Difference]: Without dead ends: 106646
[2025-02-05 11:36:28,709 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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:36:28,710 INFO  L435           NwaCegarLoop]: 897 mSDtfsCounter, 795 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2121 mSolverCounterSat, 519 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 795 SdHoareTripleChecker+Valid, 904 SdHoareTripleChecker+Invalid, 2640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 519 IncrementalHoareTripleChecker+Valid, 2121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time
[2025-02-05 11:36:28,710 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [795 Valid, 904 Invalid, 2640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [519 Valid, 2121 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time]
[2025-02-05 11:36:28,798 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 106646 states.