./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem12_label22.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_label22.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 d43cfdc29fde06b3f3db8e8550743c4a543837bf593795daae105a797554d3b1
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-c00e63d-m
[2025-02-05 11:36:44,214 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-02-05 11:36:44,291 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:36:44,297 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-02-05 11:36:44,300 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-02-05 11:36:44,326 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-02-05 11:36:44,327 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-02-05 11:36:44,327 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-02-05 11:36:44,328 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-02-05 11:36:44,328 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-02-05 11:36:44,329 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-02-05 11:36:44,329 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-02-05 11:36:44,329 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-02-05 11:36:44,329 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-02-05 11:36:44,329 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-02-05 11:36:44,330 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-02-05 11:36:44,330 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-02-05 11:36:44,330 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-02-05 11:36:44,330 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-02-05 11:36:44,330 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-02-05 11:36:44,331 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-02-05 11:36:44,331 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-02-05 11:36:44,331 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-02-05 11:36:44,331 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-02-05 11:36:44,331 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-02-05 11:36:44,331 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-02-05 11:36:44,331 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-02-05 11:36:44,331 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-02-05 11:36:44,331 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-02-05 11:36:44,331 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-02-05 11:36:44,332 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-02-05 11:36:44,332 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-02-05 11:36:44,332 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-02-05 11:36:44,332 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-02-05 11:36:44,333 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-02-05 11:36:44,333 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-02-05 11:36:44,333 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-02-05 11:36:44,333 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-02-05 11:36:44,333 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-02-05 11:36:44,333 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-02-05 11:36:44,333 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-02-05 11:36:44,333 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-02-05 11:36:44,333 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-02-05 11:36:44,334 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 -> d43cfdc29fde06b3f3db8e8550743c4a543837bf593795daae105a797554d3b1
[2025-02-05 11:36:44,654 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-02-05 11:36:44,665 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-02-05 11:36:44,667 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-02-05 11:36:44,670 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-02-05 11:36:44,670 INFO  L274        PluginConnector]: CDTParser initialized
[2025-02-05 11:36:44,672 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem12_label22.c
[2025-02-05 11:36:46,006 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2c2c21925/7a8ad19ac8a84e25b0dc40e62704fd95/FLAG8cb553740
[2025-02-05 11:36:46,597 INFO  L384              CDTParser]: Found 1 translation units.
[2025-02-05 11:36:46,598 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label22.c
[2025-02-05 11:36:46,634 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2c2c21925/7a8ad19ac8a84e25b0dc40e62704fd95/FLAG8cb553740
[2025-02-05 11:36:46,652 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2c2c21925/7a8ad19ac8a84e25b0dc40e62704fd95
[2025-02-05 11:36:46,655 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-02-05 11:36:46,656 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-02-05 11:36:46,657 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-02-05 11:36:46,658 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-02-05 11:36:46,663 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-02-05 11:36:46,664 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:36:46" (1/1) ...
[2025-02-05 11:36:46,664 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64fbe3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:36:46, skipping insertion in model container
[2025-02-05 11:36:46,666 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:36:46" (1/1) ...
[2025-02-05 11:36:46,770 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-02-05 11:36:46,988 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_label22.c[7880,7893]
[2025-02-05 11:36:47,596 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-05 11:36:47,609 INFO  L200         MainTranslator]: Completed pre-run
[2025-02-05 11:36:47,637 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_label22.c[7880,7893]
[2025-02-05 11:36:47,941 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-05 11:36:47,962 INFO  L204         MainTranslator]: Completed translation
[2025-02-05 11:36:47,963 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:36:47 WrapperNode
[2025-02-05 11:36:47,963 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-02-05 11:36:47,964 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-02-05 11:36:47,964 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-02-05 11:36:47,964 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-02-05 11:36:47,969 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:36:47" (1/1) ...
[2025-02-05 11:36:48,017 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:36:47" (1/1) ...
[2025-02-05 11:36:48,312 INFO  L138                Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 4758
[2025-02-05 11:36:48,313 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-02-05 11:36:48,314 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-02-05 11:36:48,315 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-02-05 11:36:48,315 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-02-05 11:36:48,323 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:36:47" (1/1) ...
[2025-02-05 11:36:48,324 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:36:47" (1/1) ...
[2025-02-05 11:36:48,369 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:36:47" (1/1) ...
[2025-02-05 11:36:48,547 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:36:48,548 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:36:47" (1/1) ...
[2025-02-05 11:36:48,548 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:36:47" (1/1) ...
[2025-02-05 11:36:48,642 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:36:47" (1/1) ...
[2025-02-05 11:36:48,663 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:36:47" (1/1) ...
[2025-02-05 11:36:48,688 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:36:47" (1/1) ...
[2025-02-05 11:36:48,707 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:36:47" (1/1) ...
[2025-02-05 11:36:48,764 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-02-05 11:36:48,766 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-02-05 11:36:48,766 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-02-05 11:36:48,766 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-02-05 11:36:48,767 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:36:47" (1/1) ...
[2025-02-05 11:36:48,772 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-02-05 11:36:48,784 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 11:36:48,798 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:36:48,802 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:36:48,824 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-02-05 11:36:48,824 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-02-05 11:36:48,824 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-02-05 11:36:48,824 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-02-05 11:36:48,894 INFO  L257             CfgBuilder]: Building ICFG
[2025-02-05 11:36:48,896 INFO  L287             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-02-05 11:36:53,398 INFO  L1309  $ProcedureCfgBuilder]: dead code at ProgramPoint L4665: havoc calculate_output3_#t~ret11#1;
[2025-02-05 11:36:53,398 INFO  L1309  $ProcedureCfgBuilder]: dead code at ProgramPoint L1696: havoc calculate_output_#t~ret9#1;
[2025-02-05 11:36:53,398 INFO  L1309  $ProcedureCfgBuilder]: dead code at ProgramPoint L3175: havoc calculate_output2_#t~ret10#1;
[2025-02-05 11:36:53,622 INFO  L?                        ?]: Removed 702 outVars from TransFormulas that were not future-live.
[2025-02-05 11:36:53,624 INFO  L308             CfgBuilder]: Performing block encoding
[2025-02-05 11:36:53,663 INFO  L332             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-02-05 11:36:53,669 INFO  L337             CfgBuilder]: Removed 0 assume(true) statements.
[2025-02-05 11:36:53,670 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:36:53 BoogieIcfgContainer
[2025-02-05 11:36:53,670 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-02-05 11:36:53,672 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-02-05 11:36:53,672 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-02-05 11:36:53,677 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-02-05 11:36:53,677 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 11:36:46" (1/3) ...
[2025-02-05 11:36:53,678 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78590e55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:36:53, skipping insertion in model container
[2025-02-05 11:36:53,679 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:36:47" (2/3) ...
[2025-02-05 11:36:53,679 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78590e55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:36:53, skipping insertion in model container
[2025-02-05 11:36:53,679 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:36:53" (3/3) ...
[2025-02-05 11:36:53,680 INFO  L128   eAbstractionObserver]: Analyzing ICFG Problem12_label22.c
[2025-02-05 11:36:53,696 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-02-05 11:36:53,699 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG Problem12_label22.c that has 1 procedures, 818 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-02-05 11:36:53,791 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-02-05 11:36:53,804 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;@75aba358, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-02-05 11:36:53,806 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-02-05 11:36:53,815 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:36:53,823 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 65
[2025-02-05 11:36:53,825 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:36:53,826 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:36:53,826 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:36:53,831 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:36:53,832 INFO  L85        PathProgramCache]: Analyzing trace with hash -414591833, now seen corresponding path program 1 times
[2025-02-05 11:36:53,839 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:36:53,839 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393600765]
[2025-02-05 11:36:53,840 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:36:53,840 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:36:53,923 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes.
[2025-02-05 11:36:53,979 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements.
[2025-02-05 11:36:53,980 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:36:53,980 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:36:54,281 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:36:54,282 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:36:54,282 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393600765]
[2025-02-05 11:36:54,283 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393600765] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:36:54,283 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:36:54,283 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-02-05 11:36:54,284 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898428036]
[2025-02-05 11:36:54,285 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:36:54,288 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:36:54,289 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:36:54,308 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:36:54,310 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:36:54,315 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 21.333333333333332) internal successors, (64), 2 states have internal predecessors, (64), 0 states have call successors, (0), 0 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:57,959 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:36:57,960 INFO  L93              Difference]: Finished difference Result 2388 states and 4626 transitions.
[2025-02-05 11:36:57,961 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:36:57,962 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 2 states have internal predecessors, (64), 0 states have call successors, (0), 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 64
[2025-02-05 11:36:57,963 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:36:57,979 INFO  L225             Difference]: With dead ends: 2388
[2025-02-05 11:36:57,979 INFO  L226             Difference]: Without dead ends: 1506
[2025-02-05 11:36:57,985 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:36:57,988 INFO  L435           NwaCegarLoop]: 92 mSDtfsCounter, 795 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 2337 mSolverCounterSat, 1058 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 795 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.5s IncrementalHoareTripleChecker+Time
[2025-02-05 11:36:57,988 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [795 Valid, 102 Invalid, 3395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1058 Valid, 2337 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time]
[2025-02-05 11:36:58,006 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1506 states.
[2025-02-05 11:36:58,091 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1506 to 1506.
[2025-02-05 11:36:58,095 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:36:58,104 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1506 states to 1506 states and 2814 transitions.
[2025-02-05 11:36:58,105 INFO  L78                 Accepts]: Start accepts. Automaton has 1506 states and 2814 transitions. Word has length 64
[2025-02-05 11:36:58,106 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:36:58,106 INFO  L471      AbstractCegarLoop]: Abstraction has 1506 states and 2814 transitions.
[2025-02-05 11:36:58,106 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 2 states have internal predecessors, (64), 0 states have call successors, (0), 0 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:58,106 INFO  L276                IsEmpty]: Start isEmpty. Operand 1506 states and 2814 transitions.
[2025-02-05 11:36:58,113 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 138
[2025-02-05 11:36:58,114 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:36:58,114 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:36:58,114 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2025-02-05 11:36:58,115 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:36:58,115 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:36:58,115 INFO  L85        PathProgramCache]: Analyzing trace with hash 1670380262, now seen corresponding path program 1 times
[2025-02-05 11:36:58,115 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:36:58,115 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43259746]
[2025-02-05 11:36:58,116 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:36:58,116 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:36:58,145 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes.
[2025-02-05 11:36:58,179 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements.
[2025-02-05 11:36:58,179 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:36:58,179 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:36:58,570 INFO  L134       CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 11:36:58,570 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:36:58,570 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43259746]
[2025-02-05 11:36:58,570 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43259746] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:36:58,570 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:36:58,570 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:36:58,570 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306730921]
[2025-02-05 11:36:58,571 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:36:58,572 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 11:36:58,572 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:36:58,572 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 11:36:58,572 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-05 11:36:58,572 INFO  L87              Difference]: Start difference. First operand 1506 states and 2814 transitions. Second operand  has 4 states, 4 states have (on average 34.25) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 0 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:37:03,145 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:37:03,145 INFO  L93              Difference]: Finished difference Result 5271 states and 9820 transitions.
[2025-02-05 11:37:03,145 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-05 11:37:03,145 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 34.25) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 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 137
[2025-02-05 11:37:03,146 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:37:03,161 INFO  L225             Difference]: With dead ends: 5271
[2025-02-05 11:37:03,161 INFO  L226             Difference]: Without dead ends: 3767
[2025-02-05 11:37:03,165 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:37:03,166 INFO  L435           NwaCegarLoop]: 183 mSDtfsCounter, 2294 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 3612 mSolverCounterSat, 1535 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2294 SdHoareTripleChecker+Valid, 201 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:37:03,167 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2294 Valid, 201 Invalid, 5147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1535 Valid, 3612 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time]
[2025-02-05 11:37:03,173 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3767 states.
[2025-02-05 11:37:03,232 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3767 to 3759.
[2025-02-05 11:37:03,238 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3759 states, 3758 states have (on average 1.611761575306014) internal successors, (6057), 3758 states have internal predecessors, (6057), 0 states have call successors, (0), 0 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:37:03,246 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3759 states to 3759 states and 6057 transitions.
[2025-02-05 11:37:03,246 INFO  L78                 Accepts]: Start accepts. Automaton has 3759 states and 6057 transitions. Word has length 137
[2025-02-05 11:37:03,248 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:37:03,248 INFO  L471      AbstractCegarLoop]: Abstraction has 3759 states and 6057 transitions.
[2025-02-05 11:37:03,249 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 34.25) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 0 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:37:03,249 INFO  L276                IsEmpty]: Start isEmpty. Operand 3759 states and 6057 transitions.
[2025-02-05 11:37:03,253 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 212
[2025-02-05 11:37:03,253 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:37:03,254 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:37:03,254 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-02-05 11:37:03,254 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:37:03,255 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:37:03,258 INFO  L85        PathProgramCache]: Analyzing trace with hash 600444141, now seen corresponding path program 1 times
[2025-02-05 11:37:03,258 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:37:03,259 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544661218]
[2025-02-05 11:37:03,259 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:37:03,259 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:37:03,287 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 211 statements into 1 equivalence classes.
[2025-02-05 11:37:03,311 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 211 of 211 statements.
[2025-02-05 11:37:03,312 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:37:03,312 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:37:03,775 INFO  L134       CoverageAnalysis]: Checked inductivity of 193 backedges. 165 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked.
[2025-02-05 11:37:03,775 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:37:03,775 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544661218]
[2025-02-05 11:37:03,775 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544661218] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:37:03,775 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:37:03,776 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:37:03,776 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676212686]
[2025-02-05 11:37:03,776 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:37:03,776 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 11:37:03,776 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:37:03,777 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 11:37:03,777 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-02-05 11:37:03,777 INFO  L87              Difference]: Start difference. First operand 3759 states and 6057 transitions. Second operand  has 4 states, 4 states have (on average 46.0) internal successors, (184), 3 states have internal predecessors, (184), 0 states have call successors, (0), 0 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:37:06,890 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:37:06,890 INFO  L93              Difference]: Finished difference Result 10557 states and 17446 transitions.
[2025-02-05 11:37:06,891 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 11:37:06,891 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 46.0) internal successors, (184), 3 states have internal predecessors, (184), 0 states have call successors, (0), 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 211
[2025-02-05 11:37:06,891 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:37:06,914 INFO  L225             Difference]: With dead ends: 10557
[2025-02-05 11:37:06,914 INFO  L226             Difference]: Without dead ends: 6763
[2025-02-05 11:37:06,921 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:37:06,922 INFO  L435           NwaCegarLoop]: 694 mSDtfsCounter, 702 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 3107 mSolverCounterSat, 729 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s 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, 3.0s IncrementalHoareTripleChecker+Time
[2025-02-05 11:37:06,923 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [702 Valid, 708 Invalid, 3836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [729 Valid, 3107 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time]
[2025-02-05 11:37:06,929 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 6763 states.
[2025-02-05 11:37:07,020 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 6763 to 6763.
[2025-02-05 11:37:07,030 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 6763 states, 6762 states have (on average 1.3618751848565513) internal successors, (9209), 6762 states have internal predecessors, (9209), 0 states have call successors, (0), 0 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:37:07,043 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6763 states to 6763 states and 9209 transitions.
[2025-02-05 11:37:07,043 INFO  L78                 Accepts]: Start accepts. Automaton has 6763 states and 9209 transitions. Word has length 211
[2025-02-05 11:37:07,044 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:37:07,044 INFO  L471      AbstractCegarLoop]: Abstraction has 6763 states and 9209 transitions.
[2025-02-05 11:37:07,044 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 46.0) internal successors, (184), 3 states have internal predecessors, (184), 0 states have call successors, (0), 0 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:37:07,044 INFO  L276                IsEmpty]: Start isEmpty. Operand 6763 states and 9209 transitions.
[2025-02-05 11:37:07,048 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 282
[2025-02-05 11:37:07,048 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:37:07,048 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:37:07,049 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-02-05 11:37:07,049 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:37:07,050 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:37:07,050 INFO  L85        PathProgramCache]: Analyzing trace with hash -507178754, now seen corresponding path program 1 times
[2025-02-05 11:37:07,051 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:37:07,051 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760955406]
[2025-02-05 11:37:07,051 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:37:07,051 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:37:07,087 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 281 statements into 1 equivalence classes.
[2025-02-05 11:37:07,126 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 281 of 281 statements.
[2025-02-05 11:37:07,130 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:37:07,131 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:37:07,441 INFO  L134       CoverageAnalysis]: Checked inductivity of 198 backedges. 198 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 11:37:07,441 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:37:07,441 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760955406]
[2025-02-05 11:37:07,442 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760955406] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:37:07,442 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:37:07,442 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:37:07,442 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959251123]
[2025-02-05 11:37:07,442 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:37:07,443 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:37:07,444 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:37:07,444 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:37:07,444 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:37:07,445 INFO  L87              Difference]: Start difference. First operand 6763 states and 9209 transitions. Second operand  has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:37:09,878 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:37:09,879 INFO  L93              Difference]: Finished difference Result 13524 states and 18416 transitions.
[2025-02-05 11:37:09,879 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:37:09,879 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 281
[2025-02-05 11:37:09,880 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:37:09,900 INFO  L225             Difference]: With dead ends: 13524
[2025-02-05 11:37:09,900 INFO  L226             Difference]: Without dead ends: 6763
[2025-02-05 11:37:09,909 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:37:09,910 INFO  L435           NwaCegarLoop]: 1075 mSDtfsCounter, 692 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2514 mSolverCounterSat, 418 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 692 SdHoareTripleChecker+Valid, 1082 SdHoareTripleChecker+Invalid, 2932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 418 IncrementalHoareTripleChecker+Valid, 2514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time
[2025-02-05 11:37:09,910 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [692 Valid, 1082 Invalid, 2932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [418 Valid, 2514 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time]
[2025-02-05 11:37:09,917 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 6763 states.
[2025-02-05 11:37:09,998 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 6763 to 6763.
[2025-02-05 11:37:10,009 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 6763 states, 6762 states have (on average 1.3039041703637977) internal successors, (8817), 6762 states have internal predecessors, (8817), 0 states have call successors, (0), 0 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:37:10,022 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6763 states to 6763 states and 8817 transitions.
[2025-02-05 11:37:10,022 INFO  L78                 Accepts]: Start accepts. Automaton has 6763 states and 8817 transitions. Word has length 281
[2025-02-05 11:37:10,024 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:37:10,024 INFO  L471      AbstractCegarLoop]: Abstraction has 6763 states and 8817 transitions.
[2025-02-05 11:37:10,024 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:37:10,024 INFO  L276                IsEmpty]: Start isEmpty. Operand 6763 states and 8817 transitions.
[2025-02-05 11:37:10,027 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 286
[2025-02-05 11:37:10,028 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:37:10,028 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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]
[2025-02-05 11:37:10,028 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-02-05 11:37:10,028 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:37:10,029 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:37:10,029 INFO  L85        PathProgramCache]: Analyzing trace with hash -740649612, now seen corresponding path program 1 times
[2025-02-05 11:37:10,029 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:37:10,029 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152309664]
[2025-02-05 11:37:10,029 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:37:10,029 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:37:10,055 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 285 statements into 1 equivalence classes.
[2025-02-05 11:37:10,079 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 285 of 285 statements.
[2025-02-05 11:37:10,079 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:37:10,079 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:37:10,557 INFO  L134       CoverageAnalysis]: Checked inductivity of 198 backedges. 164 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 11:37:10,559 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:37:10,559 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152309664]
[2025-02-05 11:37:10,559 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152309664] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-05 11:37:10,559 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1832123509]
[2025-02-05 11:37:10,559 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:37:10,559 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 11:37:10,559 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 11:37:10,563 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:37:10,564 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:37:10,619 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 285 statements into 1 equivalence classes.
[2025-02-05 11:37:10,680 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 285 of 285 statements.
[2025-02-05 11:37:10,680 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:37:10,680 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:37:10,683 INFO  L256         TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-02-05 11:37:10,691 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-05 11:37:10,829 INFO  L134       CoverageAnalysis]: Checked inductivity of 198 backedges. 198 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 11:37:10,832 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-02-05 11:37:10,833 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1832123509] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:37:10,833 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-02-05 11:37:10,833 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6
[2025-02-05 11:37:10,833 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229686960]
[2025-02-05 11:37:10,833 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:37:10,834 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:37:10,834 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:37:10,835 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:37:10,836 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2025-02-05 11:37:10,836 INFO  L87              Difference]: Start difference. First operand 6763 states and 8817 transitions. Second operand  has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 0 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:37:13,645 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:37:13,646 INFO  L93              Difference]: Finished difference Result 16528 states and 22423 transitions.
[2025-02-05 11:37:13,646 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:37:13,646 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 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 285
[2025-02-05 11:37:13,647 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:37:13,673 INFO  L225             Difference]: With dead ends: 16528
[2025-02-05 11:37:13,673 INFO  L226             Difference]: Without dead ends: 9767
[2025-02-05 11:37:13,682 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 284 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2025-02-05 11:37:13,683 INFO  L435           NwaCegarLoop]: 369 mSDtfsCounter, 876 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2100 mSolverCounterSat, 703 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 876 SdHoareTripleChecker+Valid, 375 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.7s IncrementalHoareTripleChecker+Time
[2025-02-05 11:37:13,683 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [876 Valid, 375 Invalid, 2803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [703 Valid, 2100 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time]
[2025-02-05 11:37:13,694 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 9767 states.
[2025-02-05 11:37:13,883 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 9767 to 9767.
[2025-02-05 11:37:13,901 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 9767 states, 9766 states have (on average 1.3088265410608233) internal successors, (12782), 9766 states have internal predecessors, (12782), 0 states have call successors, (0), 0 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:37:13,921 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9767 states to 9767 states and 12782 transitions.
[2025-02-05 11:37:13,922 INFO  L78                 Accepts]: Start accepts. Automaton has 9767 states and 12782 transitions. Word has length 285
[2025-02-05 11:37:13,922 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:37:13,922 INFO  L471      AbstractCegarLoop]: Abstraction has 9767 states and 12782 transitions.
[2025-02-05 11:37:13,922 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 0 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:37:13,923 INFO  L276                IsEmpty]: Start isEmpty. Operand 9767 states and 12782 transitions.
[2025-02-05 11:37:13,927 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 305
[2025-02-05 11:37:13,929 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:37:13,930 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:13,938 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:37:14,134 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 11:37:14,134 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:37:14,135 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:37:14,135 INFO  L85        PathProgramCache]: Analyzing trace with hash 542706992, now seen corresponding path program 1 times
[2025-02-05 11:37:14,135 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:37:14,135 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929096430]
[2025-02-05 11:37:14,135 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:37:14,136 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:37:14,175 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 304 statements into 1 equivalence classes.
[2025-02-05 11:37:14,205 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 304 of 304 statements.
[2025-02-05 11:37:14,205 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:37:14,205 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:37:14,448 INFO  L134       CoverageAnalysis]: Checked inductivity of 221 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked.
[2025-02-05 11:37:14,449 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:37:14,449 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929096430]
[2025-02-05 11:37:14,449 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929096430] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:37:14,449 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:37:14,449 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:37:14,449 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896720076]
[2025-02-05 11:37:14,449 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:37:14,450 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:37:14,450 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:37:14,451 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:37:14,451 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:37:14,451 INFO  L87              Difference]: Start difference. First operand 9767 states and 12782 transitions. Second operand  has 3 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 0 states have call successors, (0), 0 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:37:17,030 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:37:17,030 INFO  L93              Difference]: Finished difference Result 27793 states and 36757 transitions.
[2025-02-05 11:37:17,031 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:37:17,031 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 0 states have call successors, (0), 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 304
[2025-02-05 11:37:17,031 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:37:17,076 INFO  L225             Difference]: With dead ends: 27793
[2025-02-05 11:37:17,076 INFO  L226             Difference]: Without dead ends: 18028
[2025-02-05 11:37:17,091 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:37:17,093 INFO  L435           NwaCegarLoop]: 1386 mSDtfsCounter, 690 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2411 mSolverCounterSat, 527 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 690 SdHoareTripleChecker+Valid, 1394 SdHoareTripleChecker+Invalid, 2938 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 527 IncrementalHoareTripleChecker+Valid, 2411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time
[2025-02-05 11:37:17,094 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [690 Valid, 1394 Invalid, 2938 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [527 Valid, 2411 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time]
[2025-02-05 11:37:17,111 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 18028 states.
[2025-02-05 11:37:17,327 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 18028 to 18028.
[2025-02-05 11:37:17,351 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 18028 states, 18027 states have (on average 1.2131247573084818) internal successors, (21869), 18027 states have internal predecessors, (21869), 0 states have call successors, (0), 0 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:37:17,378 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 18028 states to 18028 states and 21869 transitions.
[2025-02-05 11:37:17,379 INFO  L78                 Accepts]: Start accepts. Automaton has 18028 states and 21869 transitions. Word has length 304
[2025-02-05 11:37:17,380 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:37:17,381 INFO  L471      AbstractCegarLoop]: Abstraction has 18028 states and 21869 transitions.
[2025-02-05 11:37:17,381 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 0 states have call successors, (0), 0 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:37:17,381 INFO  L276                IsEmpty]: Start isEmpty. Operand 18028 states and 21869 transitions.
[2025-02-05 11:37:17,386 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 326
[2025-02-05 11:37:17,386 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:37:17,387 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 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:37:17,387 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-02-05 11:37:17,387 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:37:17,388 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:37:17,388 INFO  L85        PathProgramCache]: Analyzing trace with hash 988604368, now seen corresponding path program 1 times
[2025-02-05 11:37:17,388 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:37:17,388 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475627726]
[2025-02-05 11:37:17,388 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:37:17,388 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:37:17,416 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 325 statements into 1 equivalence classes.
[2025-02-05 11:37:17,435 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 325 of 325 statements.
[2025-02-05 11:37:17,435 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:37:17,436 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:37:17,627 INFO  L134       CoverageAnalysis]: Checked inductivity of 242 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked.
[2025-02-05 11:37:17,627 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:37:17,627 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475627726]
[2025-02-05 11:37:17,627 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475627726] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:37:17,627 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:37:17,627 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-02-05 11:37:17,627 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67839893]
[2025-02-05 11:37:17,627 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:37:17,628 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:37:17,628 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:37:17,628 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:37:17,628 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:37:17,629 INFO  L87              Difference]: Start difference. First operand 18028 states and 21869 transitions. Second operand  has 3 states, 3 states have (on average 69.0) internal successors, (207), 2 states have internal predecessors, (207), 0 states have call successors, (0), 0 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:37:20,179 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:37:20,179 INFO  L93              Difference]: Finished difference Result 42062 states and 51579 transitions.
[2025-02-05 11:37:20,180 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:37:20,180 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 69.0) internal successors, (207), 2 states have internal predecessors, (207), 0 states have call successors, (0), 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 325
[2025-02-05 11:37:20,181 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:37:20,228 INFO  L225             Difference]: With dead ends: 42062
[2025-02-05 11:37:20,228 INFO  L226             Difference]: Without dead ends: 24036
[2025-02-05 11:37:20,249 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:37:20,251 INFO  L435           NwaCegarLoop]: 428 mSDtfsCounter, 696 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1975 mSolverCounterSat, 814 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 696 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 2789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 814 IncrementalHoareTripleChecker+Valid, 1975 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time
[2025-02-05 11:37:20,251 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [696 Valid, 434 Invalid, 2789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [814 Valid, 1975 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time]
[2025-02-05 11:37:20,275 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 24036 states.
[2025-02-05 11:37:20,578 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 24036 to 22534.
[2025-02-05 11:37:20,603 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 22534 states, 22533 states have (on average 1.158434296365331) internal successors, (26103), 22533 states have internal predecessors, (26103), 0 states have call successors, (0), 0 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:37:20,630 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 22534 states to 22534 states and 26103 transitions.
[2025-02-05 11:37:20,631 INFO  L78                 Accepts]: Start accepts. Automaton has 22534 states and 26103 transitions. Word has length 325
[2025-02-05 11:37:20,633 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:37:20,633 INFO  L471      AbstractCegarLoop]: Abstraction has 22534 states and 26103 transitions.
[2025-02-05 11:37:20,633 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 69.0) internal successors, (207), 2 states have internal predecessors, (207), 0 states have call successors, (0), 0 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:37:20,633 INFO  L276                IsEmpty]: Start isEmpty. Operand 22534 states and 26103 transitions.
[2025-02-05 11:37:20,640 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 405
[2025-02-05 11:37:20,640 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:37:20,641 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 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:37:20,641 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-02-05 11:37:20,641 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:37:20,641 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:37:20,642 INFO  L85        PathProgramCache]: Analyzing trace with hash 922661750, now seen corresponding path program 1 times
[2025-02-05 11:37:20,642 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:37:20,642 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189474927]
[2025-02-05 11:37:20,642 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:37:20,642 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:37:20,686 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 404 statements into 1 equivalence classes.
[2025-02-05 11:37:20,714 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 404 of 404 statements.
[2025-02-05 11:37:20,714 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:37:20,714 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:37:21,160 INFO  L134       CoverageAnalysis]: Checked inductivity of 461 backedges. 185 proven. 108 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked.
[2025-02-05 11:37:21,162 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:37:21,162 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189474927]
[2025-02-05 11:37:21,163 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189474927] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-05 11:37:21,163 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [752519406]
[2025-02-05 11:37:21,163 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:37:21,163 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 11:37:21,163 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 11:37:21,165 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:37:21,169 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:37:21,231 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 404 statements into 1 equivalence classes.
[2025-02-05 11:37:21,301 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 404 of 404 statements.
[2025-02-05 11:37:21,302 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:37:21,302 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:37:21,307 INFO  L256         TraceCheckSpWp]: Trace formula consists of 531 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-02-05 11:37:21,317 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-05 11:37:21,751 INFO  L134       CoverageAnalysis]: Checked inductivity of 461 backedges. 185 proven. 0 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked.
[2025-02-05 11:37:21,751 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-02-05 11:37:21,751 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [752519406] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:37:21,751 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-02-05 11:37:21,751 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4
[2025-02-05 11:37:21,752 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338270528]
[2025-02-05 11:37:21,752 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:37:21,752 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:37:21,752 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:37:21,753 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:37:21,753 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-05 11:37:21,753 INFO  L87              Difference]: Start difference. First operand 22534 states and 26103 transitions. Second operand  has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 2 states have internal predecessors, (208), 0 states have call successors, (0), 0 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:37:24,068 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:37:24,068 INFO  L93              Difference]: Finished difference Result 54829 states and 63047 transitions.
[2025-02-05 11:37:24,069 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:37:24,069 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 2 states have internal predecessors, (208), 0 states have call successors, (0), 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 404
[2025-02-05 11:37:24,069 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:37:24,106 INFO  L225             Difference]: With dead ends: 54829
[2025-02-05 11:37:24,106 INFO  L226             Difference]: Without dead ends: 32297
[2025-02-05 11:37:24,130 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 406 GetRequests, 403 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:37:24,131 INFO  L435           NwaCegarLoop]: 586 mSDtfsCounter, 626 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2352 mSolverCounterSat, 363 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 626 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 2715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 363 IncrementalHoareTripleChecker+Valid, 2352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time
[2025-02-05 11:37:24,131 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [626 Valid, 593 Invalid, 2715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [363 Valid, 2352 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time]
[2025-02-05 11:37:24,159 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 32297 states.
[2025-02-05 11:37:24,410 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 32297 to 29293.
[2025-02-05 11:37:24,438 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 29293 states, 29292 states have (on average 1.1410624061177113) internal successors, (33424), 29292 states have internal predecessors, (33424), 0 states have call successors, (0), 0 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:37:24,471 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 29293 states to 29293 states and 33424 transitions.
[2025-02-05 11:37:24,472 INFO  L78                 Accepts]: Start accepts. Automaton has 29293 states and 33424 transitions. Word has length 404
[2025-02-05 11:37:24,472 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:37:24,472 INFO  L471      AbstractCegarLoop]: Abstraction has 29293 states and 33424 transitions.
[2025-02-05 11:37:24,472 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 2 states have internal predecessors, (208), 0 states have call successors, (0), 0 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:37:24,473 INFO  L276                IsEmpty]: Start isEmpty. Operand 29293 states and 33424 transitions.
[2025-02-05 11:37:24,482 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 415
[2025-02-05 11:37:24,482 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:37:24,483 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-02-05 11:37:24,490 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:37:24,683 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 11:37:24,685 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:37:24,686 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:37:24,686 INFO  L85        PathProgramCache]: Analyzing trace with hash 1194524849, now seen corresponding path program 1 times
[2025-02-05 11:37:24,686 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:37:24,686 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018891663]
[2025-02-05 11:37:24,686 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:37:24,686 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:37:24,719 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 414 statements into 1 equivalence classes.
[2025-02-05 11:37:24,743 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 414 of 414 statements.
[2025-02-05 11:37:24,743 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:37:24,743 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:37:25,537 INFO  L134       CoverageAnalysis]: Checked inductivity of 473 backedges. 124 proven. 264 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked.
[2025-02-05 11:37:25,538 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:37:25,538 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018891663]
[2025-02-05 11:37:25,538 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018891663] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-05 11:37:25,538 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2025709368]
[2025-02-05 11:37:25,538 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:37:25,538 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 11:37:25,538 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 11:37:25,541 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:37:25,544 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:37:25,602 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 414 statements into 1 equivalence classes.
[2025-02-05 11:37:25,678 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 414 of 414 statements.
[2025-02-05 11:37:25,679 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:37:25,679 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:37:25,681 INFO  L256         TraceCheckSpWp]: Trace formula consists of 540 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-02-05 11:37:25,686 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-05 11:37:25,764 INFO  L134       CoverageAnalysis]: Checked inductivity of 473 backedges. 185 proven. 0 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked.
[2025-02-05 11:37:25,765 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-02-05 11:37:25,765 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2025709368] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:37:25,765 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-02-05 11:37:25,765 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7
[2025-02-05 11:37:25,765 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320317185]
[2025-02-05 11:37:25,765 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:37:25,766 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:37:25,766 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:37:25,766 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:37:25,767 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2025-02-05 11:37:25,767 INFO  L87              Difference]: Start difference. First operand 29293 states and 33424 transitions. Second operand  has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 0 states have call successors, (0), 0 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:37:28,033 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:37:28,033 INFO  L93              Difference]: Finished difference Result 58584 states and 66846 transitions.
[2025-02-05 11:37:28,033 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:37:28,033 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 0 states have call successors, (0), 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 414
[2025-02-05 11:37:28,034 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:37:28,061 INFO  L225             Difference]: With dead ends: 58584
[2025-02-05 11:37:28,062 INFO  L226             Difference]: Without dead ends: 29293
[2025-02-05 11:37:28,073 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 419 GetRequests, 414 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2025-02-05 11:37:28,073 INFO  L435           NwaCegarLoop]: 1180 mSDtfsCounter, 742 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2192 mSolverCounterSat, 447 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 742 SdHoareTripleChecker+Valid, 1188 SdHoareTripleChecker+Invalid, 2639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 447 IncrementalHoareTripleChecker+Valid, 2192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time
[2025-02-05 11:37:28,074 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [742 Valid, 1188 Invalid, 2639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [447 Valid, 2192 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time]
[2025-02-05 11:37:28,094 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 29293 states.
[2025-02-05 11:37:28,299 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 29293 to 29293.
[2025-02-05 11:37:28,324 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 29293 states, 29292 states have (on average 1.105352997405435) internal successors, (32378), 29292 states have internal predecessors, (32378), 0 states have call successors, (0), 0 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:37:28,355 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 29293 states to 29293 states and 32378 transitions.
[2025-02-05 11:37:28,355 INFO  L78                 Accepts]: Start accepts. Automaton has 29293 states and 32378 transitions. Word has length 414
[2025-02-05 11:37:28,356 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:37:28,356 INFO  L471      AbstractCegarLoop]: Abstraction has 29293 states and 32378 transitions.
[2025-02-05 11:37:28,356 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 0 states have call successors, (0), 0 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:37:28,357 INFO  L276                IsEmpty]: Start isEmpty. Operand 29293 states and 32378 transitions.
[2025-02-05 11:37:28,364 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 444
[2025-02-05 11:37:28,364 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:37:28,364 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:37:28,372 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0
[2025-02-05 11:37:28,565 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 11:37:28,565 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:37:28,566 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:37:28,566 INFO  L85        PathProgramCache]: Analyzing trace with hash -429884215, now seen corresponding path program 1 times
[2025-02-05 11:37:28,566 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:37:28,566 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464502074]
[2025-02-05 11:37:28,566 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:37:28,566 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:37:28,601 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 443 statements into 1 equivalence classes.
[2025-02-05 11:37:28,623 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 443 of 443 statements.
[2025-02-05 11:37:28,624 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:37:28,624 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:37:29,007 INFO  L134       CoverageAnalysis]: Checked inductivity of 500 backedges. 226 proven. 230 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked.
[2025-02-05 11:37:29,008 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:37:29,008 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464502074]
[2025-02-05 11:37:29,008 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464502074] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-05 11:37:29,008 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1788057389]
[2025-02-05 11:37:29,008 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:37:29,008 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 11:37:29,008 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 11:37:29,010 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:37:29,012 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:37:29,073 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 443 statements into 1 equivalence classes.
[2025-02-05 11:37:29,142 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 443 of 443 statements.
[2025-02-05 11:37:29,142 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:37:29,142 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:37:29,144 INFO  L256         TraceCheckSpWp]: Trace formula consists of 573 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-02-05 11:37:29,147 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-05 11:37:29,333 INFO  L134       CoverageAnalysis]: Checked inductivity of 500 backedges. 415 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked.
[2025-02-05 11:37:29,333 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-02-05 11:37:29,333 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1788057389] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:37:29,333 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-02-05 11:37:29,333 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5
[2025-02-05 11:37:29,333 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866021934]
[2025-02-05 11:37:29,334 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:37:29,334 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:37:29,334 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:37:29,335 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:37:29,335 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-05 11:37:29,335 INFO  L87              Difference]: Start difference. First operand 29293 states and 32378 transitions. Second operand  has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 0 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:37:31,932 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:37:31,932 INFO  L93              Difference]: Finished difference Result 76608 states and 85276 transitions.
[2025-02-05 11:37:31,933 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:37:31,933 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 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 443
[2025-02-05 11:37:31,933 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:37:31,984 INFO  L225             Difference]: With dead ends: 76608
[2025-02-05 11:37:31,984 INFO  L226             Difference]: Without dead ends: 47317
[2025-02-05 11:37:32,012 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 446 GetRequests, 443 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-05 11:37:32,013 INFO  L435           NwaCegarLoop]: 1016 mSDtfsCounter, 666 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2330 mSolverCounterSat, 718 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 666 SdHoareTripleChecker+Valid, 1023 SdHoareTripleChecker+Invalid, 3048 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 718 IncrementalHoareTripleChecker+Valid, 2330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time
[2025-02-05 11:37:32,013 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [666 Valid, 1023 Invalid, 3048 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [718 Valid, 2330 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time]
[2025-02-05 11:37:32,053 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 47317 states.
[2025-02-05 11:37:32,393 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 47317 to 47317.
[2025-02-05 11:37:32,432 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 47317 states, 47316 states have (on average 1.1110406627779186) internal successors, (52570), 47316 states have internal predecessors, (52570), 0 states have call successors, (0), 0 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:37:32,493 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 47317 states to 47317 states and 52570 transitions.
[2025-02-05 11:37:32,493 INFO  L78                 Accepts]: Start accepts. Automaton has 47317 states and 52570 transitions. Word has length 443
[2025-02-05 11:37:32,494 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:37:32,494 INFO  L471      AbstractCegarLoop]: Abstraction has 47317 states and 52570 transitions.
[2025-02-05 11:37:32,494 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 0 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:37:32,494 INFO  L276                IsEmpty]: Start isEmpty. Operand 47317 states and 52570 transitions.
[2025-02-05 11:37:32,502 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 453
[2025-02-05 11:37:32,503 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:37:32,503 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:37:32,511 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0
[2025-02-05 11:37:32,703 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,SelfDestructingSolverStorable9
[2025-02-05 11:37:32,704 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:37:32,705 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:37:32,705 INFO  L85        PathProgramCache]: Analyzing trace with hash -128013506, now seen corresponding path program 1 times
[2025-02-05 11:37:32,705 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:37:32,705 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742788819]
[2025-02-05 11:37:32,706 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:37:32,706 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:37:32,818 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 452 statements into 1 equivalence classes.
[2025-02-05 11:37:32,843 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 452 of 452 statements.
[2025-02-05 11:37:32,843 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:37:32,843 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:37:33,013 INFO  L134       CoverageAnalysis]: Checked inductivity of 522 backedges. 424 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked.
[2025-02-05 11:37:33,014 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:37:33,014 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742788819]
[2025-02-05 11:37:33,014 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742788819] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:37:33,014 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:37:33,014 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:37:33,015 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475135529]
[2025-02-05 11:37:33,015 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:37:33,015 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:37:33,015 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:37:33,016 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:37:33,016 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:37:33,016 INFO  L87              Difference]: Start difference. First operand 47317 states and 52570 transitions. Second operand  has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 0 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:37:35,216 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:37:35,216 INFO  L93              Difference]: Finished difference Result 98387 states and 108984 transitions.
[2025-02-05 11:37:35,216 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:37:35,217 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 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 452
[2025-02-05 11:37:35,217 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:37:35,275 INFO  L225             Difference]: With dead ends: 98387
[2025-02-05 11:37:35,275 INFO  L226             Difference]: Without dead ends: 50321
[2025-02-05 11:37:35,305 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:37:35,305 INFO  L435           NwaCegarLoop]: 993 mSDtfsCounter, 761 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2084 mSolverCounterSat, 553 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 761 SdHoareTripleChecker+Valid, 1000 SdHoareTripleChecker+Invalid, 2637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 553 IncrementalHoareTripleChecker+Valid, 2084 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time
[2025-02-05 11:37:35,306 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [761 Valid, 1000 Invalid, 2637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [553 Valid, 2084 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time]
[2025-02-05 11:37:35,339 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 50321 states.
[2025-02-05 11:37:35,801 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 50321 to 47317.
[2025-02-05 11:37:35,836 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 47317 states, 47316 states have (on average 1.0753022233493956) internal successors, (50879), 47316 states have internal predecessors, (50879), 0 states have call successors, (0), 0 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:37:35,892 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 47317 states to 47317 states and 50879 transitions.
[2025-02-05 11:37:35,893 INFO  L78                 Accepts]: Start accepts. Automaton has 47317 states and 50879 transitions. Word has length 452
[2025-02-05 11:37:35,893 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:37:35,894 INFO  L471      AbstractCegarLoop]: Abstraction has 47317 states and 50879 transitions.
[2025-02-05 11:37:35,894 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 0 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:37:35,894 INFO  L276                IsEmpty]: Start isEmpty. Operand 47317 states and 50879 transitions.
[2025-02-05 11:37:35,905 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 511
[2025-02-05 11:37:35,905 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:37:35,906 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:37:35,906 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-02-05 11:37:35,906 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:37:35,906 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:37:35,907 INFO  L85        PathProgramCache]: Analyzing trace with hash -899484806, now seen corresponding path program 1 times
[2025-02-05 11:37:35,907 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:37:35,907 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673627712]
[2025-02-05 11:37:35,907 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:37:35,907 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:37:35,958 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 510 statements into 1 equivalence classes.
[2025-02-05 11:37:35,994 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 510 of 510 statements.
[2025-02-05 11:37:35,994 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:37:35,994 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:37:36,456 INFO  L134       CoverageAnalysis]: Checked inductivity of 798 backedges. 545 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked.
[2025-02-05 11:37:36,456 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:37:36,457 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673627712]
[2025-02-05 11:37:36,457 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673627712] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:37:36,457 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:37:36,457 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:37:36,457 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135379644]
[2025-02-05 11:37:36,457 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:37:36,457 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:37:36,457 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:37:36,458 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:37:36,458 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:37:36,458 INFO  L87              Difference]: Start difference. First operand 47317 states and 50879 transitions. Second operand  has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 0 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:37:38,768 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:37:38,769 INFO  L93              Difference]: Finished difference Result 105897 states and 114065 transitions.
[2025-02-05 11:37:38,769 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:37:38,769 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 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 510
[2025-02-05 11:37:38,769 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:37:38,832 INFO  L225             Difference]: With dead ends: 105897
[2025-02-05 11:37:38,832 INFO  L226             Difference]: Without dead ends: 59333
[2025-02-05 11:37:38,856 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:37:38,857 INFO  L435           NwaCegarLoop]: 930 mSDtfsCounter, 738 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2140 mSolverCounterSat, 585 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 738 SdHoareTripleChecker+Valid, 937 SdHoareTripleChecker+Invalid, 2725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 585 IncrementalHoareTripleChecker+Valid, 2140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time
[2025-02-05 11:37:38,857 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [738 Valid, 937 Invalid, 2725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [585 Valid, 2140 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time]
[2025-02-05 11:37:38,894 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 59333 states.
[2025-02-05 11:37:39,229 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 59333 to 52574.
[2025-02-05 11:37:39,264 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 52574 states, 52573 states have (on average 1.0752857930877067) internal successors, (56531), 52573 states have internal predecessors, (56531), 0 states have call successors, (0), 0 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:37:39,313 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 52574 states to 52574 states and 56531 transitions.
[2025-02-05 11:37:39,313 INFO  L78                 Accepts]: Start accepts. Automaton has 52574 states and 56531 transitions. Word has length 510
[2025-02-05 11:37:39,314 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:37:39,314 INFO  L471      AbstractCegarLoop]: Abstraction has 52574 states and 56531 transitions.
[2025-02-05 11:37:39,314 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 0 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:37:39,314 INFO  L276                IsEmpty]: Start isEmpty. Operand 52574 states and 56531 transitions.
[2025-02-05 11:37:39,322 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 539
[2025-02-05 11:37:39,322 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:37:39,322 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:39,322 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2025-02-05 11:37:39,322 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:37:39,323 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:37:39,323 INFO  L85        PathProgramCache]: Analyzing trace with hash -2090673413, now seen corresponding path program 1 times
[2025-02-05 11:37:39,323 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:37:39,323 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057478189]
[2025-02-05 11:37:39,323 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:37:39,323 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:37:39,358 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 538 statements into 1 equivalence classes.
[2025-02-05 11:37:39,383 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 538 of 538 statements.
[2025-02-05 11:37:39,384 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:37:39,384 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:37:39,524 INFO  L134       CoverageAnalysis]: Checked inductivity of 890 backedges. 716 proven. 0 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked.
[2025-02-05 11:37:39,524 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:37:39,524 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057478189]
[2025-02-05 11:37:39,525 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057478189] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:37:39,525 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:37:39,525 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:37:39,525 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703537868]
[2025-02-05 11:37:39,525 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:37:39,525 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:37:39,526 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:37:39,526 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:37:39,526 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:37:39,527 INFO  L87              Difference]: Start difference. First operand 52574 states and 56531 transitions. Second operand  has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 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:37:42,272 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:37:42,272 INFO  L93              Difference]: Finished difference Result 126174 states and 135722 transitions.
[2025-02-05 11:37:42,272 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:37:42,273 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 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 538
[2025-02-05 11:37:42,273 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:37:42,368 INFO  L225             Difference]: With dead ends: 126174
[2025-02-05 11:37:42,369 INFO  L226             Difference]: Without dead ends: 74353
[2025-02-05 11:37:42,405 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:37:42,406 INFO  L435           NwaCegarLoop]: 1342 mSDtfsCounter, 656 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2381 mSolverCounterSat, 422 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 656 SdHoareTripleChecker+Valid, 1349 SdHoareTripleChecker+Invalid, 2803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 422 IncrementalHoareTripleChecker+Valid, 2381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time
[2025-02-05 11:37:42,406 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [656 Valid, 1349 Invalid, 2803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [422 Valid, 2381 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time]
[2025-02-05 11:37:42,461 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 74353 states.
[2025-02-05 11:37:43,137 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 74353 to 72100.
[2025-02-05 11:37:43,184 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 72100 states, 72099 states have (on average 1.0659648538814686) internal successors, (76855), 72099 states have internal predecessors, (76855), 0 states have call successors, (0), 0 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:37:43,247 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 72100 states to 72100 states and 76855 transitions.
[2025-02-05 11:37:43,248 INFO  L78                 Accepts]: Start accepts. Automaton has 72100 states and 76855 transitions. Word has length 538
[2025-02-05 11:37:43,249 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:37:43,249 INFO  L471      AbstractCegarLoop]: Abstraction has 72100 states and 76855 transitions.
[2025-02-05 11:37:43,249 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 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:37:43,249 INFO  L276                IsEmpty]: Start isEmpty. Operand 72100 states and 76855 transitions.
[2025-02-05 11:37:43,257 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 556
[2025-02-05 11:37:43,257 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:37:43,258 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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]
[2025-02-05 11:37:43,258 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2025-02-05 11:37:43,258 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:37:43,258 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:37:43,258 INFO  L85        PathProgramCache]: Analyzing trace with hash -182711366, now seen corresponding path program 1 times
[2025-02-05 11:37:43,258 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:37:43,258 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158780049]
[2025-02-05 11:37:43,259 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:37:43,259 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:37:43,287 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 555 statements into 1 equivalence classes.
[2025-02-05 11:37:43,315 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 555 of 555 statements.
[2025-02-05 11:37:43,315 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:37:43,315 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:37:43,469 INFO  L134       CoverageAnalysis]: Checked inductivity of 830 backedges. 247 proven. 0 refuted. 0 times theorem prover too weak. 583 trivial. 0 not checked.
[2025-02-05 11:37:43,470 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:37:43,470 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158780049]
[2025-02-05 11:37:43,470 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158780049] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:37:43,470 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:37:43,470 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:37:43,470 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216951657]
[2025-02-05 11:37:43,470 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:37:43,471 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:37:43,471 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:37:43,472 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:37:43,472 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:37:43,472 INFO  L87              Difference]: Start difference. First operand 72100 states and 76855 transitions. Second operand  has 3 states, 3 states have (on average 76.0) internal successors, (228), 3 states have internal predecessors, (228), 0 states have call successors, (0), 0 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:37:46,075 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:37:46,075 INFO  L93              Difference]: Finished difference Result 144949 states and 154588 transitions.
[2025-02-05 11:37:46,075 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:37:46,076 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 76.0) internal successors, (228), 3 states have internal predecessors, (228), 0 states have call successors, (0), 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 555
[2025-02-05 11:37:46,076 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:37:46,161 INFO  L225             Difference]: With dead ends: 144949
[2025-02-05 11:37:46,162 INFO  L226             Difference]: Without dead ends: 73602
[2025-02-05 11:37:46,196 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:37:46,196 INFO  L435           NwaCegarLoop]: 1108 mSDtfsCounter, 810 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2195 mSolverCounterSat, 341 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 810 SdHoareTripleChecker+Valid, 1116 SdHoareTripleChecker+Invalid, 2536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 341 IncrementalHoareTripleChecker+Valid, 2195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time
[2025-02-05 11:37:46,196 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [810 Valid, 1116 Invalid, 2536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [341 Valid, 2195 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time]
[2025-02-05 11:37:46,247 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 73602 states.
[2025-02-05 11:37:46,998 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 73602 to 72100.
[2025-02-05 11:37:47,047 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 72100 states, 72099 states have (on average 1.0538981123177853) internal successors, (75985), 72099 states have internal predecessors, (75985), 0 states have call successors, (0), 0 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:37:47,113 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 72100 states to 72100 states and 75985 transitions.
[2025-02-05 11:37:47,114 INFO  L78                 Accepts]: Start accepts. Automaton has 72100 states and 75985 transitions. Word has length 555
[2025-02-05 11:37:47,115 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:37:47,115 INFO  L471      AbstractCegarLoop]: Abstraction has 72100 states and 75985 transitions.
[2025-02-05 11:37:47,115 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 76.0) internal successors, (228), 3 states have internal predecessors, (228), 0 states have call successors, (0), 0 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:37:47,115 INFO  L276                IsEmpty]: Start isEmpty. Operand 72100 states and 75985 transitions.
[2025-02-05 11:37:47,129 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 636
[2025-02-05 11:37:47,129 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:37:47,130 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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:37:47,130 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2025-02-05 11:37:47,130 INFO  L396      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:37:47,130 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:37:47,130 INFO  L85        PathProgramCache]: Analyzing trace with hash -664540004, now seen corresponding path program 1 times
[2025-02-05 11:37:47,130 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:37:47,130 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987528922]
[2025-02-05 11:37:47,130 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:37:47,131 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:37:47,168 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 635 statements into 1 equivalence classes.
[2025-02-05 11:37:47,188 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 635 of 635 statements.
[2025-02-05 11:37:47,188 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:37:47,188 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:37:47,385 INFO  L134       CoverageAnalysis]: Checked inductivity of 917 backedges. 739 proven. 0 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked.
[2025-02-05 11:37:47,385 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:37:47,385 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987528922]
[2025-02-05 11:37:47,385 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987528922] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:37:47,385 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:37:47,385 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:37:47,385 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864205874]
[2025-02-05 11:37:47,386 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:37:47,386 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:37:47,386 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:37:47,387 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:37:47,387 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:37:47,388 INFO  L87              Difference]: Start difference. First operand 72100 states and 75985 transitions. Second operand  has 3 states, 3 states have (on average 153.0) internal successors, (459), 3 states have internal predecessors, (459), 0 states have call successors, (0), 0 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:37:49,776 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:37:49,776 INFO  L93              Difference]: Finished difference Result 156965 states and 165870 transitions.
[2025-02-05 11:37:49,776 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:37:49,777 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 153.0) internal successors, (459), 3 states have internal predecessors, (459), 0 states have call successors, (0), 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 635
[2025-02-05 11:37:49,777 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:37:50,026 INFO  L225             Difference]: With dead ends: 156965
[2025-02-05 11:37:50,027 INFO  L226             Difference]: Without dead ends: 85618
[2025-02-05 11:37:50,045 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:37:50,045 INFO  L435           NwaCegarLoop]: 1274 mSDtfsCounter, 669 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2240 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 669 SdHoareTripleChecker+Valid, 1282 SdHoareTripleChecker+Invalid, 2357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 2240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time
[2025-02-05 11:37:50,046 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [669 Valid, 1282 Invalid, 2357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 2240 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time]
[2025-02-05 11:37:50,101 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 85618 states.
[2025-02-05 11:37:50,735 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 85618 to 82614.
[2025-02-05 11:37:50,782 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 82614 states, 82613 states have (on average 1.0519046639148801) internal successors, (86901), 82613 states have internal predecessors, (86901), 0 states have call successors, (0), 0 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:37:50,887 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 82614 states to 82614 states and 86901 transitions.
[2025-02-05 11:37:50,887 INFO  L78                 Accepts]: Start accepts. Automaton has 82614 states and 86901 transitions. Word has length 635
[2025-02-05 11:37:50,888 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:37:50,888 INFO  L471      AbstractCegarLoop]: Abstraction has 82614 states and 86901 transitions.
[2025-02-05 11:37:50,888 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 153.0) internal successors, (459), 3 states have internal predecessors, (459), 0 states have call successors, (0), 0 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:37:50,888 INFO  L276                IsEmpty]: Start isEmpty. Operand 82614 states and 86901 transitions.
[2025-02-05 11:37:50,912 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 708
[2025-02-05 11:37:50,913 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:37:50,913 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:50,913 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2025-02-05 11:37:50,913 INFO  L396      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:37:50,914 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:37:50,914 INFO  L85        PathProgramCache]: Analyzing trace with hash -1623362255, now seen corresponding path program 1 times
[2025-02-05 11:37:50,914 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:37:50,914 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515914296]
[2025-02-05 11:37:50,914 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:37:50,914 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:37:50,984 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 707 statements into 1 equivalence classes.
[2025-02-05 11:37:51,012 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 707 of 707 statements.
[2025-02-05 11:37:51,012 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:37:51,012 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:37:51,528 INFO  L134       CoverageAnalysis]: Checked inductivity of 1301 backedges. 974 proven. 0 refuted. 0 times theorem prover too weak. 327 trivial. 0 not checked.
[2025-02-05 11:37:51,529 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:37:51,529 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515914296]
[2025-02-05 11:37:51,529 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515914296] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:37:51,529 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:37:51,529 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:37:51,529 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064304680]
[2025-02-05 11:37:51,529 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:37:51,530 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:37:51,530 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:37:51,531 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:37:51,531 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:37:51,531 INFO  L87              Difference]: Start difference. First operand 82614 states and 86901 transitions. Second operand  has 3 states, 3 states have (on average 148.33333333333334) internal successors, (445), 3 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:37:53,944 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:37:53,945 INFO  L93              Difference]: Finished difference Result 166728 states and 175312 transitions.
[2025-02-05 11:37:53,945 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:37:53,945 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 148.33333333333334) internal successors, (445), 3 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 707
[2025-02-05 11:37:53,945 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:37:54,027 INFO  L225             Difference]: With dead ends: 166728
[2025-02-05 11:37:54,027 INFO  L226             Difference]: Without dead ends: 84867
[2025-02-05 11:37:54,058 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:37:54,058 INFO  L435           NwaCegarLoop]: 226 mSDtfsCounter, 793 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2234 mSolverCounterSat, 406 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 793 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 2640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 406 IncrementalHoareTripleChecker+Valid, 2234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time
[2025-02-05 11:37:54,059 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [793 Valid, 232 Invalid, 2640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [406 Valid, 2234 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time]
[2025-02-05 11:37:54,106 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 84867 states.
[2025-02-05 11:37:54,685 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 84867 to 75855.
[2025-02-05 11:37:54,734 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 75855 states, 75854 states have (on average 1.0432145964616237) internal successors, (79132), 75854 states have internal predecessors, (79132), 0 states have call successors, (0), 0 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:37:54,799 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 75855 states to 75855 states and 79132 transitions.
[2025-02-05 11:37:54,800 INFO  L78                 Accepts]: Start accepts. Automaton has 75855 states and 79132 transitions. Word has length 707
[2025-02-05 11:37:54,800 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:37:54,800 INFO  L471      AbstractCegarLoop]: Abstraction has 75855 states and 79132 transitions.
[2025-02-05 11:37:54,800 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 148.33333333333334) internal successors, (445), 3 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:37:54,800 INFO  L276                IsEmpty]: Start isEmpty. Operand 75855 states and 79132 transitions.
[2025-02-05 11:37:54,815 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 711
[2025-02-05 11:37:54,815 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:37:54,815 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 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]
[2025-02-05 11:37:54,815 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2025-02-05 11:37:54,815 INFO  L396      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:37:54,816 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:37:54,816 INFO  L85        PathProgramCache]: Analyzing trace with hash -2036534002, now seen corresponding path program 1 times
[2025-02-05 11:37:54,816 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:37:54,816 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817753716]
[2025-02-05 11:37:54,816 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:37:54,816 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:37:54,859 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 710 statements into 1 equivalence classes.
[2025-02-05 11:37:54,901 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 710 of 710 statements.
[2025-02-05 11:37:54,902 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:37:54,902 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:37:55,480 INFO  L134       CoverageAnalysis]: Checked inductivity of 1058 backedges. 247 proven. 0 refuted. 0 times theorem prover too weak. 811 trivial. 0 not checked.
[2025-02-05 11:37:55,480 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:37:55,480 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817753716]
[2025-02-05 11:37:55,480 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817753716] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:37:55,481 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:37:55,481 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:37:55,481 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065312498]
[2025-02-05 11:37:55,481 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:37:55,482 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:37:55,482 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:37:55,482 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:37:55,483 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:37:55,483 INFO  L87              Difference]: Start difference. First operand 75855 states and 79132 transitions. Second operand  has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:37:58,370 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:37:58,370 INFO  L93              Difference]: Finished difference Result 180995 states and 189255 transitions.
[2025-02-05 11:37:58,371 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:37:58,371 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 710
[2025-02-05 11:37:58,371 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:37:58,372 INFO  L225             Difference]: With dead ends: 180995
[2025-02-05 11:37:58,372 INFO  L226             Difference]: Without dead ends: 0
[2025-02-05 11:37:58,429 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:37:58,430 INFO  L435           NwaCegarLoop]: 330 mSDtfsCounter, 771 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2357 mSolverCounterSat, 619 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 771 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 2976 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 619 IncrementalHoareTripleChecker+Valid, 2357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time
[2025-02-05 11:37:58,430 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [771 Valid, 336 Invalid, 2976 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [619 Valid, 2357 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time]
[2025-02-05 11:37:58,430 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2025-02-05 11:37:58,430 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2025-02-05 11:37:58,431 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:37:58,431 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2025-02-05 11:37:58,431 INFO  L78                 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 710
[2025-02-05 11:37:58,431 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:37:58,431 INFO  L471      AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2025-02-05 11:37:58,431 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:37:58,431 INFO  L276                IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2025-02-05 11:37:58,432 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2025-02-05 11:37:58,434 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2025-02-05 11:37:58,434 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2025-02-05 11:37:58,436 INFO  L422         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:37:58,437 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.