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


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


Checking for ERROR reachability
Using default analysis
Version 798a7b37
Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem16_label38.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 bc6f3b983186b129fc2c8495f43645af8fd70d5de682a5c401850a1bca673b92
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-798a7b3-m
[2025-03-03 10:55:50,950 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-03-03 10:55:51,009 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2025-03-03 10:55:51,015 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-03-03 10:55:51,015 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-03-03 10:55:51,028 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-03-03 10:55:51,029 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-03-03 10:55:51,029 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-03-03 10:55:51,029 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-03-03 10:55:51,029 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-03-03 10:55:51,030 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-03-03 10:55:51,030 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-03-03 10:55:51,030 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-03-03 10:55:51,030 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-03-03 10:55:51,030 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-03-03 10:55:51,030 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-03-03 10:55:51,030 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-03-03 10:55:51,030 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-03-03 10:55:51,031 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-03-03 10:55:51,031 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-03-03 10:55:51,031 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-03-03 10:55:51,031 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-03-03 10:55:51,031 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-03-03 10:55:51,031 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-03-03 10:55:51,031 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-03-03 10:55:51,031 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-03-03 10:55:51,031 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-03-03 10:55:51,031 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-03-03 10:55:51,031 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-03-03 10:55:51,032 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-03-03 10:55:51,032 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-03-03 10:55:51,032 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-03-03 10:55:51,032 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-03 10:55:51,032 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-03-03 10:55:51,032 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-03-03 10:55:51,032 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-03-03 10:55:51,032 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-03-03 10:55:51,032 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-03-03 10:55:51,032 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-03-03 10:55:51,032 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-03-03 10:55:51,033 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-03-03 10:55:51,033 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-03-03 10:55:51,033 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-03-03 10:55:51,033 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/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 -> bc6f3b983186b129fc2c8495f43645af8fd70d5de682a5c401850a1bca673b92
[2025-03-03 10:55:51,239 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-03-03 10:55:51,244 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-03-03 10:55:51,247 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-03-03 10:55:51,247 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-03-03 10:55:51,248 INFO  L274        PluginConnector]: CDTParser initialized
[2025-03-03 10:55:51,249 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem16_label38.c
[2025-03-03 10:55:52,422 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a9fb393f/9bcc173113b14e91a7c08d6c3a664c9c/FLAG76e8aa5ee
[2025-03-03 10:55:52,803 INFO  L384              CDTParser]: Found 1 translation units.
[2025-03-03 10:55:52,803 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label38.c
[2025-03-03 10:55:52,821 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a9fb393f/9bcc173113b14e91a7c08d6c3a664c9c/FLAG76e8aa5ee
[2025-03-03 10:55:52,984 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a9fb393f/9bcc173113b14e91a7c08d6c3a664c9c
[2025-03-03 10:55:52,986 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-03-03 10:55:52,987 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-03-03 10:55:52,988 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-03-03 10:55:52,988 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-03-03 10:55:52,991 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-03-03 10:55:52,991 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:55:52" (1/1) ...
[2025-03-03 10:55:52,993 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72fe4d48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:55:52, skipping insertion in model container
[2025-03-03 10:55:52,993 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:55:52" (1/1) ...
[2025-03-03 10:55:53,031 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-03-03 10:55:53,127 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label38.c[1461,1474]
[2025-03-03 10:55:53,358 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-03 10:55:53,365 INFO  L200         MainTranslator]: Completed pre-run
[2025-03-03 10:55:53,372 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label38.c[1461,1474]
[2025-03-03 10:55:53,472 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-03 10:55:53,484 INFO  L204         MainTranslator]: Completed translation
[2025-03-03 10:55:53,485 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:55:53 WrapperNode
[2025-03-03 10:55:53,485 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-03-03 10:55:53,486 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-03-03 10:55:53,486 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-03-03 10:55:53,486 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-03-03 10:55:53,490 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:55:53" (1/1) ...
[2025-03-03 10:55:53,505 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:55:53" (1/1) ...
[2025-03-03 10:55:53,605 INFO  L138                Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1767
[2025-03-03 10:55:53,605 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-03-03 10:55:53,606 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-03-03 10:55:53,606 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-03-03 10:55:53,607 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-03-03 10:55:53,613 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:55:53" (1/1) ...
[2025-03-03 10:55:53,613 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:55:53" (1/1) ...
[2025-03-03 10:55:53,625 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:55:53" (1/1) ...
[2025-03-03 10:55:53,670 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-03-03 10:55:53,670 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:55:53" (1/1) ...
[2025-03-03 10:55:53,670 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:55:53" (1/1) ...
[2025-03-03 10:55:53,703 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:55:53" (1/1) ...
[2025-03-03 10:55:53,709 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:55:53" (1/1) ...
[2025-03-03 10:55:53,715 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:55:53" (1/1) ...
[2025-03-03 10:55:53,719 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:55:53" (1/1) ...
[2025-03-03 10:55:53,732 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-03-03 10:55:53,734 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-03-03 10:55:53,734 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-03-03 10:55:53,735 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-03-03 10:55:53,735 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:55:53" (1/1) ...
[2025-03-03 10:55:53,739 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-03 10:55:53,747 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 10:55:53,759 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2025-03-03 10:55:53,762 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2025-03-03 10:55:53,779 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-03-03 10:55:53,779 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-03-03 10:55:53,779 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-03-03 10:55:53,779 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-03-03 10:55:53,822 INFO  L256             CfgBuilder]: Building ICFG
[2025-03-03 10:55:53,823 INFO  L286             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-03-03 10:55:55,399 INFO  L1325  $ProcedureCfgBuilder]: dead code at ProgramPoint L1501: havoc calculate_output_#t~ret7#1;
[2025-03-03 10:55:55,453 INFO  L?                        ?]: Removed 276 outVars from TransFormulas that were not future-live.
[2025-03-03 10:55:55,454 INFO  L307             CfgBuilder]: Performing block encoding
[2025-03-03 10:55:55,464 INFO  L331             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-03-03 10:55:55,464 INFO  L336             CfgBuilder]: Removed 0 assume(true) statements.
[2025-03-03 10:55:55,465 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:55:55 BoogieIcfgContainer
[2025-03-03 10:55:55,465 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-03-03 10:55:55,466 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-03-03 10:55:55,466 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-03-03 10:55:55,469 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-03-03 10:55:55,469 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:55:52" (1/3) ...
[2025-03-03 10:55:55,470 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1aec57a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:55:55, skipping insertion in model container
[2025-03-03 10:55:55,470 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:55:53" (2/3) ...
[2025-03-03 10:55:55,471 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1aec57a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:55:55, skipping insertion in model container
[2025-03-03 10:55:55,471 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:55:55" (3/3) ...
[2025-03-03 10:55:55,472 INFO  L128   eAbstractionObserver]: Analyzing ICFG Problem16_label38.c
[2025-03-03 10:55:55,483 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-03-03 10:55:55,485 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG Problem16_label38.c that has 1 procedures, 396 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-03-03 10:55:55,532 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-03-03 10:55:55,539 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;@40e44d76, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-03-03 10:55:55,541 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-03-03 10:55:55,545 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 396 states, 394 states have (on average 1.83248730964467) internal successors, (722), 395 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:55:55,549 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 12
[2025-03-03 10:55:55,550 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 10:55:55,550 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 10:55:55,550 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 10:55:55,554 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 10:55:55,554 INFO  L85        PathProgramCache]: Analyzing trace with hash -1283197837, now seen corresponding path program 1 times
[2025-03-03 10:55:55,560 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 10:55:55,560 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042221819]
[2025-03-03 10:55:55,560 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:55:55,561 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 10:55:55,607 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes.
[2025-03-03 10:55:55,623 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements.
[2025-03-03 10:55:55,624 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:55:55,624 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:55:55,715 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 10:55:55,716 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 10:55:55,716 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042221819]
[2025-03-03 10:55:55,717 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042221819] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 10:55:55,717 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 10:55:55,717 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-03 10:55:55,718 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696605871]
[2025-03-03 10:55:55,719 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 10:55:55,721 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 10:55:55,722 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 10:55:55,735 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 10:55:55,735 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 10:55:55,738 INFO  L87              Difference]: Start difference. First operand  has 396 states, 394 states have (on average 1.83248730964467) internal successors, (722), 395 states have internal predecessors, (722), 0 states have call successors, (0), 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 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:55:57,025 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 10:55:57,026 INFO  L93              Difference]: Finished difference Result 1122 states and 2100 transitions.
[2025-03-03 10:55:57,026 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 10:55:57,027 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 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 11
[2025-03-03 10:55:57,028 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 10:55:57,038 INFO  L225             Difference]: With dead ends: 1122
[2025-03-03 10:55:57,038 INFO  L226             Difference]: Without dead ends: 662
[2025-03-03 10:55:57,042 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-03-03 10:55:57,044 INFO  L435           NwaCegarLoop]: 246 mSDtfsCounter, 376 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 864 mSolverCounterSat, 450 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 1314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 450 IncrementalHoareTripleChecker+Valid, 864 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time
[2025-03-03 10:55:57,044 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [376 Valid, 254 Invalid, 1314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [450 Valid, 864 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time]
[2025-03-03 10:55:57,059 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 662 states.
[2025-03-03 10:55:57,097 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 662.
[2025-03-03 10:55:57,101 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 662 states, 661 states have (on average 1.518910741301059) internal successors, (1004), 661 states have internal predecessors, (1004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:55:57,105 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 1004 transitions.
[2025-03-03 10:55:57,107 INFO  L78                 Accepts]: Start accepts. Automaton has 662 states and 1004 transitions. Word has length 11
[2025-03-03 10:55:57,107 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 10:55:57,107 INFO  L471      AbstractCegarLoop]: Abstraction has 662 states and 1004 transitions.
[2025-03-03 10:55:57,107 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:55:57,107 INFO  L276                IsEmpty]: Start isEmpty. Operand 662 states and 1004 transitions.
[2025-03-03 10:55:57,108 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 80
[2025-03-03 10:55:57,109 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 10:55:57,109 INFO  L218           NwaCegarLoop]: trace histogram [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]
[2025-03-03 10:55:57,109 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2025-03-03 10:55:57,109 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 10:55:57,110 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 10:55:57,110 INFO  L85        PathProgramCache]: Analyzing trace with hash -95959834, now seen corresponding path program 1 times
[2025-03-03 10:55:57,111 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 10:55:57,111 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598678651]
[2025-03-03 10:55:57,111 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:55:57,111 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 10:55:57,128 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes.
[2025-03-03 10:55:57,159 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements.
[2025-03-03 10:55:57,162 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:55:57,162 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:55:57,463 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 10:55:57,464 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 10:55:57,465 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598678651]
[2025-03-03 10:55:57,465 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598678651] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 10:55:57,465 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 10:55:57,465 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 10:55:57,465 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197205507]
[2025-03-03 10:55:57,465 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 10:55:57,466 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-03 10:55:57,466 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 10:55:57,467 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-03 10:55:57,467 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-03 10:55:57,467 INFO  L87              Difference]: Start difference. First operand 662 states and 1004 transitions. Second operand  has 4 states, 4 states have (on average 19.75) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:55:58,967 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 10:55:58,967 INFO  L93              Difference]: Finished difference Result 2309 states and 3414 transitions.
[2025-03-03 10:55:58,967 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 10:55:58,967 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 19.75) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79
[2025-03-03 10:55:58,968 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 10:55:58,972 INFO  L225             Difference]: With dead ends: 2309
[2025-03-03 10:55:58,972 INFO  L226             Difference]: Without dead ends: 1649
[2025-03-03 10:55:58,973 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-03-03 10:55:58,974 INFO  L435           NwaCegarLoop]: 33 mSDtfsCounter, 1008 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 1496 mSolverCounterSat, 489 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1008 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 1985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 489 IncrementalHoareTripleChecker+Valid, 1496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time
[2025-03-03 10:55:58,974 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1008 Valid, 42 Invalid, 1985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [489 Valid, 1496 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time]
[2025-03-03 10:55:58,976 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1649 states.
[2025-03-03 10:55:59,008 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1649 to 1649.
[2025-03-03 10:55:59,010 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1649 states, 1648 states have (on average 1.4016990291262137) internal successors, (2310), 1648 states have internal predecessors, (2310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:55:59,016 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1649 states to 1649 states and 2310 transitions.
[2025-03-03 10:55:59,016 INFO  L78                 Accepts]: Start accepts. Automaton has 1649 states and 2310 transitions. Word has length 79
[2025-03-03 10:55:59,017 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 10:55:59,017 INFO  L471      AbstractCegarLoop]: Abstraction has 1649 states and 2310 transitions.
[2025-03-03 10:55:59,017 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 19.75) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:55:59,017 INFO  L276                IsEmpty]: Start isEmpty. Operand 1649 states and 2310 transitions.
[2025-03-03 10:55:59,020 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 143
[2025-03-03 10:55:59,020 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 10:55:59,020 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 10:55:59,020 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-03-03 10:55:59,020 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 10:55:59,021 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 10:55:59,021 INFO  L85        PathProgramCache]: Analyzing trace with hash 435949286, now seen corresponding path program 1 times
[2025-03-03 10:55:59,022 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 10:55:59,022 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247591833]
[2025-03-03 10:55:59,022 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:55:59,022 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 10:55:59,038 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes.
[2025-03-03 10:55:59,053 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements.
[2025-03-03 10:55:59,054 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:55:59,054 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:55:59,198 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 10:55:59,199 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 10:55:59,199 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247591833]
[2025-03-03 10:55:59,199 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247591833] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 10:55:59,201 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 10:55:59,201 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-03 10:55:59,201 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426621203]
[2025-03-03 10:55:59,201 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 10:55:59,201 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 10:55:59,201 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 10:55:59,202 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 10:55:59,202 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 10:55:59,202 INFO  L87              Difference]: Start difference. First operand 1649 states and 2310 transitions. Second operand  has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 2 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:56:00,182 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 10:56:00,182 INFO  L93              Difference]: Finished difference Result 3625 states and 5242 transitions.
[2025-03-03 10:56:00,182 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 10:56:00,183 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 2 states have internal predecessors, (142), 0 states have call successors, (0), 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 142
[2025-03-03 10:56:00,183 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 10:56:00,189 INFO  L225             Difference]: With dead ends: 3625
[2025-03-03 10:56:00,189 INFO  L226             Difference]: Without dead ends: 2307
[2025-03-03 10:56:00,191 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-03-03 10:56:00,191 INFO  L435           NwaCegarLoop]: 73 mSDtfsCounter, 278 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 882 mSolverCounterSat, 380 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 1262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 380 IncrementalHoareTripleChecker+Valid, 882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time
[2025-03-03 10:56:00,191 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 77 Invalid, 1262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [380 Valid, 882 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2025-03-03 10:56:00,194 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2307 states.
[2025-03-03 10:56:00,221 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2307 to 2307.
[2025-03-03 10:56:00,223 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2307 states, 2306 states have (on average 1.349956634865568) internal successors, (3113), 2306 states have internal predecessors, (3113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:56:00,229 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2307 states to 2307 states and 3113 transitions.
[2025-03-03 10:56:00,229 INFO  L78                 Accepts]: Start accepts. Automaton has 2307 states and 3113 transitions. Word has length 142
[2025-03-03 10:56:00,231 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 10:56:00,231 INFO  L471      AbstractCegarLoop]: Abstraction has 2307 states and 3113 transitions.
[2025-03-03 10:56:00,231 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 2 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:56:00,232 INFO  L276                IsEmpty]: Start isEmpty. Operand 2307 states and 3113 transitions.
[2025-03-03 10:56:00,234 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 178
[2025-03-03 10:56:00,236 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 10:56:00,236 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 10:56:00,237 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-03-03 10:56:00,237 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 10:56:00,237 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 10:56:00,237 INFO  L85        PathProgramCache]: Analyzing trace with hash -2039940033, now seen corresponding path program 1 times
[2025-03-03 10:56:00,237 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 10:56:00,237 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410242284]
[2025-03-03 10:56:00,237 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:56:00,237 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 10:56:00,262 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes.
[2025-03-03 10:56:00,280 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements.
[2025-03-03 10:56:00,280 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:56:00,280 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:56:00,409 INFO  L134       CoverageAnalysis]: Checked inductivity of 95 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked.
[2025-03-03 10:56:00,410 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 10:56:00,410 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410242284]
[2025-03-03 10:56:00,410 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410242284] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 10:56:00,410 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 10:56:00,410 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-03 10:56:00,410 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607917928]
[2025-03-03 10:56:00,410 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 10:56:00,410 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 10:56:00,410 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 10:56:00,411 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 10:56:00,411 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 10:56:00,411 INFO  L87              Difference]: Start difference. First operand 2307 states and 3113 transitions. Second operand  has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:56:01,332 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 10:56:01,332 INFO  L93              Difference]: Finished difference Result 5599 states and 7699 transitions.
[2025-03-03 10:56:01,332 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 10:56:01,333 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 0 states have call successors, (0), 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 177
[2025-03-03 10:56:01,333 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 10:56:01,342 INFO  L225             Difference]: With dead ends: 5599
[2025-03-03 10:56:01,343 INFO  L226             Difference]: Without dead ends: 3623
[2025-03-03 10:56:01,345 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-03-03 10:56:01,345 INFO  L435           NwaCegarLoop]: 151 mSDtfsCounter, 359 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 307 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 1118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 307 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time
[2025-03-03 10:56:01,346 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 155 Invalid, 1118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [307 Valid, 811 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2025-03-03 10:56:01,348 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3623 states.
[2025-03-03 10:56:01,387 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3623 to 2965.
[2025-03-03 10:56:01,390 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2965 states, 2964 states have (on average 1.2442645074224021) internal successors, (3688), 2964 states have internal predecessors, (3688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:56:01,395 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2965 states to 2965 states and 3688 transitions.
[2025-03-03 10:56:01,396 INFO  L78                 Accepts]: Start accepts. Automaton has 2965 states and 3688 transitions. Word has length 177
[2025-03-03 10:56:01,396 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 10:56:01,397 INFO  L471      AbstractCegarLoop]: Abstraction has 2965 states and 3688 transitions.
[2025-03-03 10:56:01,397 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:56:01,397 INFO  L276                IsEmpty]: Start isEmpty. Operand 2965 states and 3688 transitions.
[2025-03-03 10:56:01,402 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 195
[2025-03-03 10:56:01,402 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 10:56:01,402 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 10:56:01,402 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-03-03 10:56:01,402 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 10:56:01,403 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 10:56:01,403 INFO  L85        PathProgramCache]: Analyzing trace with hash -347733775, now seen corresponding path program 1 times
[2025-03-03 10:56:01,403 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 10:56:01,403 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924469156]
[2025-03-03 10:56:01,403 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:56:01,403 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 10:56:01,430 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes.
[2025-03-03 10:56:01,447 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements.
[2025-03-03 10:56:01,447 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:56:01,447 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:56:01,582 INFO  L134       CoverageAnalysis]: Checked inductivity of 103 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 10:56:01,584 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 10:56:01,584 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924469156]
[2025-03-03 10:56:01,584 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924469156] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 10:56:01,584 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 10:56:01,585 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 10:56:01,585 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739925556]
[2025-03-03 10:56:01,585 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 10:56:01,585 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 10:56:01,585 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 10:56:01,586 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 10:56:01,586 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 10:56:01,586 INFO  L87              Difference]: Start difference. First operand 2965 states and 3688 transitions. Second operand  has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 3 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:56:02,384 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 10:56:02,385 INFO  L93              Difference]: Finished difference Result 6915 states and 8657 transitions.
[2025-03-03 10:56:02,385 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 10:56:02,385 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 3 states have internal predecessors, (194), 0 states have call successors, (0), 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 194
[2025-03-03 10:56:02,387 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 10:56:02,396 INFO  L225             Difference]: With dead ends: 6915
[2025-03-03 10:56:02,396 INFO  L226             Difference]: Without dead ends: 3623
[2025-03-03 10:56:02,399 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-03-03 10:56:02,402 INFO  L435           NwaCegarLoop]: 534 mSDtfsCounter, 286 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 796 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 1094 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time
[2025-03-03 10:56:02,402 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 540 Invalid, 1094 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 796 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2025-03-03 10:56:02,406 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3623 states.
[2025-03-03 10:56:02,437 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3623 to 3623.
[2025-03-03 10:56:02,440 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3623 states, 3622 states have (on average 1.0762009939260078) internal successors, (3898), 3622 states have internal predecessors, (3898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:56:02,445 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3623 states to 3623 states and 3898 transitions.
[2025-03-03 10:56:02,445 INFO  L78                 Accepts]: Start accepts. Automaton has 3623 states and 3898 transitions. Word has length 194
[2025-03-03 10:56:02,445 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 10:56:02,446 INFO  L471      AbstractCegarLoop]: Abstraction has 3623 states and 3898 transitions.
[2025-03-03 10:56:02,446 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 3 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:56:02,446 INFO  L276                IsEmpty]: Start isEmpty. Operand 3623 states and 3898 transitions.
[2025-03-03 10:56:02,447 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 247
[2025-03-03 10:56:02,447 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 10:56:02,447 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 10:56:02,447 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-03-03 10:56:02,448 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 10:56:02,448 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 10:56:02,448 INFO  L85        PathProgramCache]: Analyzing trace with hash -306081942, now seen corresponding path program 1 times
[2025-03-03 10:56:02,448 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 10:56:02,448 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287700833]
[2025-03-03 10:56:02,448 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:56:02,448 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 10:56:02,478 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 246 statements into 1 equivalence classes.
[2025-03-03 10:56:02,493 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 246 of 246 statements.
[2025-03-03 10:56:02,494 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:56:02,495 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:56:02,642 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 10:56:02,643 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 10:56:02,643 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287700833]
[2025-03-03 10:56:02,643 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287700833] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 10:56:02,643 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 10:56:02,643 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 10:56:02,644 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329471444]
[2025-03-03 10:56:02,645 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 10:56:02,645 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 10:56:02,645 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 10:56:02,646 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 10:56:02,646 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 10:56:02,646 INFO  L87              Difference]: Start difference. First operand 3623 states and 3898 transitions. Second operand  has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:56:03,278 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 10:56:03,278 INFO  L93              Difference]: Finished difference Result 8231 states and 8905 transitions.
[2025-03-03 10:56:03,278 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 10:56:03,279 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 0 states have call successors, (0), 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 246
[2025-03-03 10:56:03,279 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 10:56:03,289 INFO  L225             Difference]: With dead ends: 8231
[2025-03-03 10:56:03,289 INFO  L226             Difference]: Without dead ends: 4939
[2025-03-03 10:56:03,292 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-03-03 10:56:03,293 INFO  L435           NwaCegarLoop]: 413 mSDtfsCounter, 325 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 765 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 848 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 765 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-03 10:56:03,293 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 419 Invalid, 848 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 765 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-03 10:56:03,297 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 4939 states.
[2025-03-03 10:56:03,335 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 4939 to 4939.
[2025-03-03 10:56:03,339 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 4939 states, 4938 states have (on average 1.0514378290805995) internal successors, (5192), 4938 states have internal predecessors, (5192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:56:03,345 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4939 states to 4939 states and 5192 transitions.
[2025-03-03 10:56:03,346 INFO  L78                 Accepts]: Start accepts. Automaton has 4939 states and 5192 transitions. Word has length 246
[2025-03-03 10:56:03,346 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 10:56:03,346 INFO  L471      AbstractCegarLoop]: Abstraction has 4939 states and 5192 transitions.
[2025-03-03 10:56:03,346 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:56:03,346 INFO  L276                IsEmpty]: Start isEmpty. Operand 4939 states and 5192 transitions.
[2025-03-03 10:56:03,349 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 351
[2025-03-03 10:56:03,349 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 10:56:03,349 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 10:56:03,349 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-03-03 10:56:03,349 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 10:56:03,350 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 10:56:03,350 INFO  L85        PathProgramCache]: Analyzing trace with hash -1584356937, now seen corresponding path program 1 times
[2025-03-03 10:56:03,350 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 10:56:03,350 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256334069]
[2025-03-03 10:56:03,350 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:56:03,350 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 10:56:03,372 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 350 statements into 1 equivalence classes.
[2025-03-03 10:56:03,391 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 350 of 350 statements.
[2025-03-03 10:56:03,391 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:56:03,392 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:56:03,569 INFO  L134       CoverageAnalysis]: Checked inductivity of 112 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked.
[2025-03-03 10:56:03,569 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 10:56:03,570 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256334069]
[2025-03-03 10:56:03,570 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256334069] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 10:56:03,570 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 10:56:03,570 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 10:56:03,570 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629226818]
[2025-03-03 10:56:03,570 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 10:56:03,570 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 10:56:03,570 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 10:56:03,571 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 10:56:03,571 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 10:56:03,571 INFO  L87              Difference]: Start difference. First operand 4939 states and 5192 transitions. Second operand  has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:56:04,269 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 10:56:04,269 INFO  L93              Difference]: Finished difference Result 10863 states and 11493 transitions.
[2025-03-03 10:56:04,269 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 10:56:04,270 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 350
[2025-03-03 10:56:04,270 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 10:56:04,283 INFO  L225             Difference]: With dead ends: 10863
[2025-03-03 10:56:04,284 INFO  L226             Difference]: Without dead ends: 6255
[2025-03-03 10:56:04,288 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-03-03 10:56:04,289 INFO  L435           NwaCegarLoop]: 33 mSDtfsCounter, 337 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 760 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-03-03 10:56:04,289 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 38 Invalid, 857 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 760 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-03-03 10:56:04,295 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 6255 states.
[2025-03-03 10:56:04,343 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 6255 to 6255.
[2025-03-03 10:56:04,348 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 6255 states, 6254 states have (on average 1.0548448992644708) internal successors, (6597), 6254 states have internal predecessors, (6597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:56:04,359 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6255 states to 6255 states and 6597 transitions.
[2025-03-03 10:56:04,360 INFO  L78                 Accepts]: Start accepts. Automaton has 6255 states and 6597 transitions. Word has length 350
[2025-03-03 10:56:04,362 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 10:56:04,362 INFO  L471      AbstractCegarLoop]: Abstraction has 6255 states and 6597 transitions.
[2025-03-03 10:56:04,362 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:56:04,362 INFO  L276                IsEmpty]: Start isEmpty. Operand 6255 states and 6597 transitions.
[2025-03-03 10:56:04,365 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 405
[2025-03-03 10:56:04,367 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 10:56:04,368 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 10:56:04,368 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-03-03 10:56:04,368 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 10:56:04,368 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 10:56:04,368 INFO  L85        PathProgramCache]: Analyzing trace with hash -1887828866, now seen corresponding path program 1 times
[2025-03-03 10:56:04,369 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 10:56:04,369 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032871644]
[2025-03-03 10:56:04,369 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:56:04,369 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 10:56:04,394 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 404 statements into 1 equivalence classes.
[2025-03-03 10:56:04,416 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 404 of 404 statements.
[2025-03-03 10:56:04,416 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:56:04,416 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:56:04,769 INFO  L134       CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked.
[2025-03-03 10:56:04,770 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 10:56:04,770 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032871644]
[2025-03-03 10:56:04,770 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032871644] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 10:56:04,770 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1521347585]
[2025-03-03 10:56:04,770 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:56:04,770 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 10:56:04,770 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 10:56:04,772 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-03 10:56:04,774 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2025-03-03 10:56:04,823 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 404 statements into 1 equivalence classes.
[2025-03-03 10:56:04,908 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 404 of 404 statements.
[2025-03-03 10:56:04,909 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:56:04,909 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:56:04,912 INFO  L256         TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-03-03 10:56:04,923 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 10:56:05,355 INFO  L134       CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked.
[2025-03-03 10:56:05,355 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-03 10:56:05,355 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1521347585] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 10:56:05,355 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-03 10:56:05,355 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4
[2025-03-03 10:56:05,355 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052088310]
[2025-03-03 10:56:05,356 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 10:56:05,356 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 10:56:05,356 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 10:56:05,356 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 10:56:05,357 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-03 10:56:05,357 INFO  L87              Difference]: Start difference. First operand 6255 states and 6597 transitions. Second operand  has 3 states, 3 states have (on average 80.0) internal successors, (240), 2 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:56:05,943 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 10:56:05,943 INFO  L93              Difference]: Finished difference Result 7573 states and 7950 transitions.
[2025-03-03 10:56:05,943 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 10:56:05,944 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 80.0) internal successors, (240), 2 states have internal predecessors, (240), 0 states have call successors, (0), 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-03-03 10:56:05,947 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 10:56:05,968 INFO  L225             Difference]: With dead ends: 7573
[2025-03-03 10:56:05,971 INFO  L226             Difference]: Without dead ends: 7571
[2025-03-03 10:56:05,973 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-03-03 10:56:05,974 INFO  L435           NwaCegarLoop]: 70 mSDtfsCounter, 116 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 740 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-03 10:56:05,974 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 75 Invalid, 772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 740 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-03 10:56:05,981 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 7571 states.
[2025-03-03 10:56:06,039 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 7571 to 6584.
[2025-03-03 10:56:06,049 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 6584 states, 6583 states have (on average 1.0540786875284824) internal successors, (6939), 6583 states have internal predecessors, (6939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:56:06,057 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6584 states to 6584 states and 6939 transitions.
[2025-03-03 10:56:06,058 INFO  L78                 Accepts]: Start accepts. Automaton has 6584 states and 6939 transitions. Word has length 404
[2025-03-03 10:56:06,059 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 10:56:06,059 INFO  L471      AbstractCegarLoop]: Abstraction has 6584 states and 6939 transitions.
[2025-03-03 10:56:06,059 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 80.0) internal successors, (240), 2 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:56:06,059 INFO  L276                IsEmpty]: Start isEmpty. Operand 6584 states and 6939 transitions.
[2025-03-03 10:56:06,083 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1207
[2025-03-03 10:56:06,083 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 10:56:06,084 INFO  L218           NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 10:56:06,091 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2025-03-03 10:56:06,285 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 10:56:06,286 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 10:56:06,286 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 10:56:06,286 INFO  L85        PathProgramCache]: Analyzing trace with hash -1373281507, now seen corresponding path program 1 times
[2025-03-03 10:56:06,287 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 10:56:06,287 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121644140]
[2025-03-03 10:56:06,287 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:56:06,287 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 10:56:06,398 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1206 statements into 1 equivalence classes.
[2025-03-03 10:56:06,459 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1206 of 1206 statements.
[2025-03-03 10:56:06,459 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:56:06,459 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:56:07,002 INFO  L134       CoverageAnalysis]: Checked inductivity of 2565 backedges. 1817 proven. 0 refuted. 0 times theorem prover too weak. 748 trivial. 0 not checked.
[2025-03-03 10:56:07,003 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 10:56:07,003 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121644140]
[2025-03-03 10:56:07,004 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121644140] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 10:56:07,004 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 10:56:07,004 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 10:56:07,004 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069757738]
[2025-03-03 10:56:07,004 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 10:56:07,005 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 10:56:07,006 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 10:56:07,006 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 10:56:07,006 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 10:56:07,007 INFO  L87              Difference]: Start difference. First operand 6584 states and 6939 transitions. Second operand  has 3 states, 3 states have (on average 217.0) internal successors, (651), 3 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:56:07,658 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 10:56:07,658 INFO  L93              Difference]: Finished difference Result 14482 states and 15329 transitions.
[2025-03-03 10:56:07,659 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 10:56:07,659 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 217.0) internal successors, (651), 3 states have internal predecessors, (651), 0 states have call successors, (0), 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 1206
[2025-03-03 10:56:07,659 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 10:56:07,671 INFO  L225             Difference]: With dead ends: 14482
[2025-03-03 10:56:07,671 INFO  L226             Difference]: Without dead ends: 8229
[2025-03-03 10:56:07,677 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-03-03 10:56:07,680 INFO  L435           NwaCegarLoop]: 425 mSDtfsCounter, 220 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 753 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 831 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-03 10:56:07,681 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 431 Invalid, 831 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 753 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-03 10:56:07,687 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 8229 states.
[2025-03-03 10:56:07,735 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 8229 to 7900.
[2025-03-03 10:56:07,742 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 7900 states, 7899 states have (on average 1.0483605519686037) internal successors, (8281), 7899 states have internal predecessors, (8281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:56:07,748 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7900 states to 7900 states and 8281 transitions.
[2025-03-03 10:56:07,749 INFO  L78                 Accepts]: Start accepts. Automaton has 7900 states and 8281 transitions. Word has length 1206
[2025-03-03 10:56:07,750 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 10:56:07,750 INFO  L471      AbstractCegarLoop]: Abstraction has 7900 states and 8281 transitions.
[2025-03-03 10:56:07,750 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 217.0) internal successors, (651), 3 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:56:07,750 INFO  L276                IsEmpty]: Start isEmpty. Operand 7900 states and 8281 transitions.
[2025-03-03 10:56:07,787 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1424
[2025-03-03 10:56:07,788 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 10:56:07,789 INFO  L218           NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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]
[2025-03-03 10:56:07,789 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-03-03 10:56:07,789 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 10:56:07,790 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 10:56:07,790 INFO  L85        PathProgramCache]: Analyzing trace with hash -193847966, now seen corresponding path program 1 times
[2025-03-03 10:56:07,790 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 10:56:07,790 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116160414]
[2025-03-03 10:56:07,790 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:56:07,790 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 10:56:07,880 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1423 statements into 1 equivalence classes.
[2025-03-03 10:56:07,917 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1423 of 1423 statements.
[2025-03-03 10:56:07,919 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:56:07,919 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:56:09,161 INFO  L134       CoverageAnalysis]: Checked inductivity of 3596 backedges. 2614 proven. 0 refuted. 0 times theorem prover too weak. 982 trivial. 0 not checked.
[2025-03-03 10:56:09,162 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 10:56:09,162 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116160414]
[2025-03-03 10:56:09,162 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116160414] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 10:56:09,162 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 10:56:09,162 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-03-03 10:56:09,162 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61843442]
[2025-03-03 10:56:09,162 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 10:56:09,163 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-03 10:56:09,163 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 10:56:09,164 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-03 10:56:09,164 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2025-03-03 10:56:09,164 INFO  L87              Difference]: Start difference. First operand 7900 states and 8281 transitions. Second operand  has 6 states, 6 states have (on average 128.83333333333334) internal successors, (773), 6 states have internal predecessors, (773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:56:10,113 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 10:56:10,113 INFO  L93              Difference]: Finished difference Result 15470 states and 16230 transitions.
[2025-03-03 10:56:10,113 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-03-03 10:56:10,113 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 128.83333333333334) internal successors, (773), 6 states have internal predecessors, (773), 0 states have call successors, (0), 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 1423
[2025-03-03 10:56:10,114 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 10:56:10,125 INFO  L225             Difference]: With dead ends: 15470
[2025-03-03 10:56:10,125 INFO  L226             Difference]: Without dead ends: 7901
[2025-03-03 10:56:10,131 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2025-03-03 10:56:10,132 INFO  L435           NwaCegarLoop]: 430 mSDtfsCounter, 357 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 1794 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 1807 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1794 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time
[2025-03-03 10:56:10,132 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 566 Invalid, 1807 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1794 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2025-03-03 10:56:10,137 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 7901 states.
[2025-03-03 10:56:10,178 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 7901 to 7900.
[2025-03-03 10:56:10,185 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 7900 states, 7899 states have (on average 1.0469679706291937) internal successors, (8270), 7899 states have internal predecessors, (8270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:56:10,192 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7900 states to 7900 states and 8270 transitions.
[2025-03-03 10:56:10,193 INFO  L78                 Accepts]: Start accepts. Automaton has 7900 states and 8270 transitions. Word has length 1423
[2025-03-03 10:56:10,194 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 10:56:10,194 INFO  L471      AbstractCegarLoop]: Abstraction has 7900 states and 8270 transitions.
[2025-03-03 10:56:10,194 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 128.83333333333334) internal successors, (773), 6 states have internal predecessors, (773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:56:10,194 INFO  L276                IsEmpty]: Start isEmpty. Operand 7900 states and 8270 transitions.
[2025-03-03 10:56:10,210 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1438
[2025-03-03 10:56:10,210 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 10:56:10,210 INFO  L218           NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 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-03-03 10:56:10,211 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-03-03 10:56:10,211 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 10:56:10,211 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 10:56:10,212 INFO  L85        PathProgramCache]: Analyzing trace with hash 1363606252, now seen corresponding path program 1 times
[2025-03-03 10:56:10,212 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 10:56:10,212 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572983622]
[2025-03-03 10:56:10,212 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:56:10,212 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 10:56:10,301 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1437 statements into 1 equivalence classes.
[2025-03-03 10:56:10,338 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1437 of 1437 statements.
[2025-03-03 10:56:10,338 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:56:10,338 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:56:11,587 INFO  L134       CoverageAnalysis]: Checked inductivity of 3496 backedges. 2551 proven. 0 refuted. 0 times theorem prover too weak. 945 trivial. 0 not checked.
[2025-03-03 10:56:11,587 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 10:56:11,588 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572983622]
[2025-03-03 10:56:11,588 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572983622] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 10:56:11,588 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 10:56:11,588 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-03 10:56:11,588 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424271497]
[2025-03-03 10:56:11,588 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 10:56:11,589 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-03 10:56:11,589 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 10:56:11,589 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-03 10:56:11,589 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-03 10:56:11,590 INFO  L87              Difference]: Start difference. First operand 7900 states and 8270 transitions. Second operand  has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:56:12,287 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 10:56:12,287 INFO  L93              Difference]: Finished difference Result 15475 states and 16213 transitions.
[2025-03-03 10:56:12,287 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-03 10:56:12,287 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 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 1437
[2025-03-03 10:56:12,288 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 10:56:12,299 INFO  L225             Difference]: With dead ends: 15475
[2025-03-03 10:56:12,300 INFO  L226             Difference]: Without dead ends: 7906
[2025-03-03 10:56:12,306 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-03-03 10:56:12,306 INFO  L435           NwaCegarLoop]: 430 mSDtfsCounter, 217 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 1331 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 1354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-03 10:56:12,306 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 444 Invalid, 1354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1331 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-03 10:56:12,312 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 7906 states.
[2025-03-03 10:56:12,352 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 7906 to 7900.
[2025-03-03 10:56:12,357 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 7900 states, 7899 states have (on average 1.0467147740220282) internal successors, (8268), 7899 states have internal predecessors, (8268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:56:12,364 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7900 states to 7900 states and 8268 transitions.
[2025-03-03 10:56:12,364 INFO  L78                 Accepts]: Start accepts. Automaton has 7900 states and 8268 transitions. Word has length 1437
[2025-03-03 10:56:12,365 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 10:56:12,365 INFO  L471      AbstractCegarLoop]: Abstraction has 7900 states and 8268 transitions.
[2025-03-03 10:56:12,365 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:56:12,365 INFO  L276                IsEmpty]: Start isEmpty. Operand 7900 states and 8268 transitions.
[2025-03-03 10:56:12,405 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1569
[2025-03-03 10:56:12,406 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 10:56:12,406 INFO  L218           NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 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]
[2025-03-03 10:56:12,406 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-03-03 10:56:12,406 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 10:56:12,407 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 10:56:12,407 INFO  L85        PathProgramCache]: Analyzing trace with hash 1802817093, now seen corresponding path program 1 times
[2025-03-03 10:56:12,407 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 10:56:12,407 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691285244]
[2025-03-03 10:56:12,408 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:56:12,408 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 10:56:12,483 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1568 statements into 1 equivalence classes.
[2025-03-03 10:56:12,513 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1568 of 1568 statements.
[2025-03-03 10:56:12,513 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:56:12,513 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:56:13,547 INFO  L134       CoverageAnalysis]: Checked inductivity of 4870 backedges. 3117 proven. 0 refuted. 0 times theorem prover too weak. 1753 trivial. 0 not checked.
[2025-03-03 10:56:13,548 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 10:56:13,548 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691285244]
[2025-03-03 10:56:13,548 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691285244] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 10:56:13,548 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 10:56:13,548 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 10:56:13,548 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730939140]
[2025-03-03 10:56:13,549 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 10:56:13,550 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 10:56:13,550 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 10:56:13,550 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 10:56:13,550 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 10:56:13,550 INFO  L87              Difference]: Start difference. First operand 7900 states and 8268 transitions. Second operand  has 3 states, 3 states have (on average 203.0) internal successors, (609), 3 states have internal predecessors, (609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:56:14,074 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 10:56:14,074 INFO  L93              Difference]: Finished difference Result 16456 states and 17205 transitions.
[2025-03-03 10:56:14,074 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 10:56:14,075 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 203.0) internal successors, (609), 3 states have internal predecessors, (609), 0 states have call successors, (0), 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 1568
[2025-03-03 10:56:14,075 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 10:56:14,084 INFO  L225             Difference]: With dead ends: 16456
[2025-03-03 10:56:14,085 INFO  L226             Difference]: Without dead ends: 8887
[2025-03-03 10:56:14,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-03-03 10:56:14,091 INFO  L435           NwaCegarLoop]: 433 mSDtfsCounter, 224 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 755 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-03 10:56:14,092 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 439 Invalid, 763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 755 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-03 10:56:14,097 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 8887 states.
[2025-03-03 10:56:14,143 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 8887 to 8887.
[2025-03-03 10:56:14,150 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 8887 states, 8886 states have (on average 1.0423137519693901) internal successors, (9262), 8886 states have internal predecessors, (9262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:56:14,158 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8887 states to 8887 states and 9262 transitions.
[2025-03-03 10:56:14,158 INFO  L78                 Accepts]: Start accepts. Automaton has 8887 states and 9262 transitions. Word has length 1568
[2025-03-03 10:56:14,159 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 10:56:14,159 INFO  L471      AbstractCegarLoop]: Abstraction has 8887 states and 9262 transitions.
[2025-03-03 10:56:14,159 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 203.0) internal successors, (609), 3 states have internal predecessors, (609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:56:14,159 INFO  L276                IsEmpty]: Start isEmpty. Operand 8887 states and 9262 transitions.
[2025-03-03 10:56:14,175 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1587
[2025-03-03 10:56:14,176 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 10:56:14,176 INFO  L218           NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 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]
[2025-03-03 10:56:14,176 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2025-03-03 10:56:14,176 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 10:56:14,177 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 10:56:14,177 INFO  L85        PathProgramCache]: Analyzing trace with hash -1774912970, now seen corresponding path program 1 times
[2025-03-03 10:56:14,177 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 10:56:14,177 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776079561]
[2025-03-03 10:56:14,178 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:56:14,178 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 10:56:14,254 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1586 statements into 1 equivalence classes.
[2025-03-03 10:56:14,300 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1586 of 1586 statements.
[2025-03-03 10:56:14,300 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:56:14,300 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:56:15,269 INFO  L134       CoverageAnalysis]: Checked inductivity of 4913 backedges. 3177 proven. 189 refuted. 0 times theorem prover too weak. 1547 trivial. 0 not checked.
[2025-03-03 10:56:15,270 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 10:56:15,270 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776079561]
[2025-03-03 10:56:15,270 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776079561] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 10:56:15,270 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1848996345]
[2025-03-03 10:56:15,270 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:56:15,270 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 10:56:15,270 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 10:56:15,272 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-03 10:56:15,273 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2025-03-03 10:56:15,374 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1586 statements into 1 equivalence classes.
[2025-03-03 10:56:15,551 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1586 of 1586 statements.
[2025-03-03 10:56:15,551 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:56:15,552 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:56:15,557 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1839 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-03-03 10:56:15,575 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 10:56:16,337 INFO  L134       CoverageAnalysis]: Checked inductivity of 4913 backedges. 2722 proven. 0 refuted. 0 times theorem prover too weak. 2191 trivial. 0 not checked.
[2025-03-03 10:56:16,337 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-03 10:56:16,338 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1848996345] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 10:56:16,338 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-03 10:56:16,338 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6
[2025-03-03 10:56:16,338 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902523312]
[2025-03-03 10:56:16,338 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 10:56:16,339 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 10:56:16,339 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 10:56:16,339 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 10:56:16,339 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2025-03-03 10:56:16,340 INFO  L87              Difference]: Start difference. First operand 8887 states and 9262 transitions. Second operand  has 3 states, 3 states have (on average 168.0) internal successors, (504), 3 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:56:16,833 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 10:56:16,833 INFO  L93              Difference]: Finished difference Result 17443 states and 18191 transitions.
[2025-03-03 10:56:16,833 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 10:56:16,833 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 168.0) internal successors, (504), 3 states have internal predecessors, (504), 0 states have call successors, (0), 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 1586
[2025-03-03 10:56:16,834 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 10:56:16,844 INFO  L225             Difference]: With dead ends: 17443
[2025-03-03 10:56:16,844 INFO  L226             Difference]: Without dead ends: 8887
[2025-03-03 10:56:16,850 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 1590 GetRequests, 1586 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2025-03-03 10:56:16,851 INFO  L435           NwaCegarLoop]: 371 mSDtfsCounter, 112 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 770 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-03 10:56:16,851 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 377 Invalid, 788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 770 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-03 10:56:16,857 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 8887 states.
[2025-03-03 10:56:16,898 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 8887 to 8887.
[2025-03-03 10:56:16,904 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 8887 states, 8886 states have (on average 1.036799459824443) internal successors, (9213), 8886 states have internal predecessors, (9213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:56:16,911 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8887 states to 8887 states and 9213 transitions.
[2025-03-03 10:56:16,912 INFO  L78                 Accepts]: Start accepts. Automaton has 8887 states and 9213 transitions. Word has length 1586
[2025-03-03 10:56:16,913 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 10:56:16,913 INFO  L471      AbstractCegarLoop]: Abstraction has 8887 states and 9213 transitions.
[2025-03-03 10:56:16,913 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 168.0) internal successors, (504), 3 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:56:16,913 INFO  L276                IsEmpty]: Start isEmpty. Operand 8887 states and 9213 transitions.
[2025-03-03 10:56:16,929 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1677
[2025-03-03 10:56:16,929 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 10:56:16,930 INFO  L218           NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 10:56:16,938 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0
[2025-03-03 10:56:17,134 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12
[2025-03-03 10:56:17,134 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 10:56:17,135 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 10:56:17,135 INFO  L85        PathProgramCache]: Analyzing trace with hash -1461311387, now seen corresponding path program 1 times
[2025-03-03 10:56:17,135 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 10:56:17,135 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094854149]
[2025-03-03 10:56:17,135 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:56:17,135 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 10:56:17,211 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1676 statements into 1 equivalence classes.
[2025-03-03 10:56:17,268 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1676 of 1676 statements.
[2025-03-03 10:56:17,268 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:56:17,268 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:56:18,395 INFO  L134       CoverageAnalysis]: Checked inductivity of 4963 backedges. 3682 proven. 132 refuted. 0 times theorem prover too weak. 1149 trivial. 0 not checked.
[2025-03-03 10:56:18,396 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 10:56:18,396 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094854149]
[2025-03-03 10:56:18,396 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094854149] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 10:56:18,396 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [629461556]
[2025-03-03 10:56:18,396 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:56:18,396 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 10:56:18,396 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 10:56:18,398 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-03 10:56:18,425 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2025-03-03 10:56:18,536 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1676 statements into 1 equivalence classes.
[2025-03-03 10:56:18,749 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1676 of 1676 statements.
[2025-03-03 10:56:18,749 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:56:18,749 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:56:18,755 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1938 conjuncts, 7 conjuncts are in the unsatisfiable core
[2025-03-03 10:56:18,768 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 10:56:20,843 INFO  L134       CoverageAnalysis]: Checked inductivity of 4963 backedges. 2196 proven. 201 refuted. 0 times theorem prover too weak. 2566 trivial. 0 not checked.
[2025-03-03 10:56:20,843 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-03 10:56:23,789 INFO  L134       CoverageAnalysis]: Checked inductivity of 4963 backedges. 2196 proven. 201 refuted. 0 times theorem prover too weak. 2566 trivial. 0 not checked.
[2025-03-03 10:56:23,789 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [629461556] provided 0 perfect and 2 imperfect interpolant sequences
[2025-03-03 10:56:23,789 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-03-03 10:56:23,790 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 9
[2025-03-03 10:56:23,790 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599116607]
[2025-03-03 10:56:23,790 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-03-03 10:56:23,792 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2025-03-03 10:56:23,792 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 10:56:23,793 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2025-03-03 10:56:23,793 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2025-03-03 10:56:23,793 INFO  L87              Difference]: Start difference. First operand 8887 states and 9213 transitions. Second operand  has 9 states, 9 states have (on average 204.77777777777777) internal successors, (1843), 9 states have internal predecessors, (1843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:56:27,906 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 10:56:27,907 INFO  L93              Difference]: Finished difference Result 33566 states and 34834 transitions.
[2025-03-03 10:56:27,907 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2025-03-03 10:56:27,907 INFO  L78                 Accepts]: Start accepts. Automaton has  has 9 states, 9 states have (on average 204.77777777777777) internal successors, (1843), 9 states have internal predecessors, (1843), 0 states have call successors, (0), 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 1676
[2025-03-03 10:56:27,908 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 10:56:27,932 INFO  L225             Difference]: With dead ends: 33566
[2025-03-03 10:56:27,932 INFO  L226             Difference]: Without dead ends: 25010
[2025-03-03 10:56:27,942 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3377 GetRequests, 3359 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380
[2025-03-03 10:56:27,943 INFO  L435           NwaCegarLoop]: 21 mSDtfsCounter, 3206 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 8083 mSolverCounterSat, 632 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3206 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 8715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 632 IncrementalHoareTripleChecker+Valid, 8083 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time
[2025-03-03 10:56:27,943 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [3206 Valid, 104 Invalid, 8715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [632 Valid, 8083 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time]
[2025-03-03 10:56:27,956 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 25010 states.
[2025-03-03 10:56:28,094 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 25010 to 18428.
[2025-03-03 10:56:28,110 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 18428 states, 18427 states have (on average 1.0354371302979324) internal successors, (19080), 18427 states have internal predecessors, (19080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:56:28,127 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 18428 states to 18428 states and 19080 transitions.
[2025-03-03 10:56:28,128 INFO  L78                 Accepts]: Start accepts. Automaton has 18428 states and 19080 transitions. Word has length 1676
[2025-03-03 10:56:28,128 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 10:56:28,128 INFO  L471      AbstractCegarLoop]: Abstraction has 18428 states and 19080 transitions.
[2025-03-03 10:56:28,128 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 204.77777777777777) internal successors, (1843), 9 states have internal predecessors, (1843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:56:28,129 INFO  L276                IsEmpty]: Start isEmpty. Operand 18428 states and 19080 transitions.
[2025-03-03 10:56:28,156 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1769
[2025-03-03 10:56:28,156 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 10:56:28,157 INFO  L218           NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 10:56:28,165 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0
[2025-03-03 10:56:28,357 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 10:56:28,358 INFO  L396      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 10:56:28,359 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 10:56:28,360 INFO  L85        PathProgramCache]: Analyzing trace with hash 1507936812, now seen corresponding path program 1 times
[2025-03-03 10:56:28,360 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 10:56:28,360 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168454479]
[2025-03-03 10:56:28,360 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:56:28,360 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 10:56:28,439 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1768 statements into 1 equivalence classes.
[2025-03-03 10:56:28,457 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1768 of 1768 statements.
[2025-03-03 10:56:28,457 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:56:28,457 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:56:30,390 INFO  L134       CoverageAnalysis]: Checked inductivity of 5872 backedges. 2310 proven. 156 refuted. 0 times theorem prover too weak. 3406 trivial. 0 not checked.
[2025-03-03 10:56:30,390 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 10:56:30,390 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168454479]
[2025-03-03 10:56:30,390 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168454479] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 10:56:30,390 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [483551284]
[2025-03-03 10:56:30,390 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:56:30,390 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 10:56:30,391 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 10:56:30,392 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-03 10:56:30,393 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2025-03-03 10:56:30,499 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1768 statements into 1 equivalence classes.
[2025-03-03 10:56:30,680 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1768 of 1768 statements.
[2025-03-03 10:56:30,680 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:56:30,680 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:56:30,686 INFO  L256         TraceCheckSpWp]: Trace formula consists of 2049 conjuncts, 4 conjuncts are in the unsatisfiable core
[2025-03-03 10:56:30,698 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 10:56:31,259 INFO  L134       CoverageAnalysis]: Checked inductivity of 5872 backedges. 2466 proven. 0 refuted. 0 times theorem prover too weak. 3406 trivial. 0 not checked.
[2025-03-03 10:56:31,260 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-03 10:56:31,260 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [483551284] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 10:56:31,260 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-03 10:56:31,260 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7
[2025-03-03 10:56:31,261 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714613049]
[2025-03-03 10:56:31,261 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 10:56:31,261 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 10:56:31,261 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 10:56:31,262 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 10:56:31,262 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2025-03-03 10:56:31,262 INFO  L87              Difference]: Start difference. First operand 18428 states and 19080 transitions. Second operand  has 3 states, 3 states have (on average 243.66666666666666) internal successors, (731), 3 states have internal predecessors, (731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:56:31,923 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 10:56:31,923 INFO  L93              Difference]: Finished difference Result 37841 states and 39185 transitions.
[2025-03-03 10:56:31,924 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 10:56:31,924 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 243.66666666666666) internal successors, (731), 3 states have internal predecessors, (731), 0 states have call successors, (0), 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 1768
[2025-03-03 10:56:31,924 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 10:56:31,940 INFO  L225             Difference]: With dead ends: 37841
[2025-03-03 10:56:31,940 INFO  L226             Difference]: Without dead ends: 19744
[2025-03-03 10:56:31,948 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 1772 GetRequests, 1767 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-03-03 10:56:31,949 INFO  L435           NwaCegarLoop]: 91 mSDtfsCounter, 173 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 761 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 761 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-03 10:56:31,949 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 96 Invalid, 799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 761 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-03 10:56:31,960 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 19744 states.
[2025-03-03 10:56:32,067 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 19744 to 19415.
[2025-03-03 10:56:32,081 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 19415 states, 19414 states have (on average 1.033532502317915) internal successors, (20065), 19414 states have internal predecessors, (20065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:56:32,098 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 19415 states to 19415 states and 20065 transitions.
[2025-03-03 10:56:32,098 INFO  L78                 Accepts]: Start accepts. Automaton has 19415 states and 20065 transitions. Word has length 1768
[2025-03-03 10:56:32,099 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 10:56:32,099 INFO  L471      AbstractCegarLoop]: Abstraction has 19415 states and 20065 transitions.
[2025-03-03 10:56:32,099 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 243.66666666666666) internal successors, (731), 3 states have internal predecessors, (731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:56:32,099 INFO  L276                IsEmpty]: Start isEmpty. Operand 19415 states and 20065 transitions.
[2025-03-03 10:56:32,185 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 2069
[2025-03-03 10:56:32,185 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 10:56:32,187 INFO  L218           NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 10:56:32,196 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0
[2025-03-03 10:56:32,388 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14
[2025-03-03 10:56:32,389 INFO  L396      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 10:56:32,389 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 10:56:32,390 INFO  L85        PathProgramCache]: Analyzing trace with hash 903268121, now seen corresponding path program 1 times
[2025-03-03 10:56:32,390 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 10:56:32,390 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951803435]
[2025-03-03 10:56:32,390 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:56:32,390 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 10:56:32,502 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2068 statements into 1 equivalence classes.
[2025-03-03 10:56:32,559 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2068 of 2068 statements.
[2025-03-03 10:56:32,559 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:56:32,559 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:56:33,600 INFO  L134       CoverageAnalysis]: Checked inductivity of 7645 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 7547 trivial. 0 not checked.
[2025-03-03 10:56:33,600 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 10:56:33,600 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951803435]
[2025-03-03 10:56:33,600 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951803435] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 10:56:33,600 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 10:56:33,600 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 10:56:33,600 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112246393]
[2025-03-03 10:56:33,601 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 10:56:33,601 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 10:56:33,601 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 10:56:33,602 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 10:56:33,602 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 10:56:33,602 INFO  L87              Difference]: Start difference. First operand 19415 states and 20065 transitions. Second operand  has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:56:34,194 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 10:56:34,194 INFO  L93              Difference]: Finished difference Result 43105 states and 44531 transitions.
[2025-03-03 10:56:34,195 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 10:56:34,195 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2068
[2025-03-03 10:56:34,196 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 10:56:34,216 INFO  L225             Difference]: With dead ends: 43105
[2025-03-03 10:56:34,216 INFO  L226             Difference]: Without dead ends: 23692
[2025-03-03 10:56:34,228 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-03-03 10:56:34,230 INFO  L435           NwaCegarLoop]: 36 mSDtfsCounter, 326 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 882 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-03 10:56:34,230 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 41 Invalid, 882 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 791 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-03 10:56:34,243 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 23692 states.
[2025-03-03 10:56:34,427 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 23692 to 20073.
[2025-03-03 10:56:34,441 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 20073 states, 20072 states have (on average 1.0338282184137106) internal successors, (20751), 20072 states have internal predecessors, (20751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:56:34,458 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 20073 states to 20073 states and 20751 transitions.
[2025-03-03 10:56:34,459 INFO  L78                 Accepts]: Start accepts. Automaton has 20073 states and 20751 transitions. Word has length 2068
[2025-03-03 10:56:34,460 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 10:56:34,460 INFO  L471      AbstractCegarLoop]: Abstraction has 20073 states and 20751 transitions.
[2025-03-03 10:56:34,460 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:56:34,460 INFO  L276                IsEmpty]: Start isEmpty. Operand 20073 states and 20751 transitions.
[2025-03-03 10:56:34,488 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 2112
[2025-03-03 10:56:34,488 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 10:56:34,489 INFO  L218           NwaCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 10:56:34,490 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2025-03-03 10:56:34,490 INFO  L396      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 10:56:34,491 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 10:56:34,491 INFO  L85        PathProgramCache]: Analyzing trace with hash 781176228, now seen corresponding path program 1 times
[2025-03-03 10:56:34,491 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 10:56:34,491 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078070110]
[2025-03-03 10:56:34,491 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:56:34,492 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 10:56:34,608 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2111 statements into 1 equivalence classes.
[2025-03-03 10:56:34,660 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2111 of 2111 statements.
[2025-03-03 10:56:34,660 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:56:34,660 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:56:37,567 INFO  L134       CoverageAnalysis]: Checked inductivity of 8721 backedges. 4930 proven. 1581 refuted. 0 times theorem prover too weak. 2210 trivial. 0 not checked.
[2025-03-03 10:56:37,567 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 10:56:37,567 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078070110]
[2025-03-03 10:56:37,568 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078070110] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 10:56:37,568 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [178410917]
[2025-03-03 10:56:37,568 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:56:37,568 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 10:56:37,568 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 10:56:37,569 INFO  L229       MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-03 10:56:37,578 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2025-03-03 10:56:37,691 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2111 statements into 1 equivalence classes.
[2025-03-03 10:56:37,926 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2111 of 2111 statements.
[2025-03-03 10:56:37,926 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:56:37,927 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:56:37,934 INFO  L256         TraceCheckSpWp]: Trace formula consists of 2439 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-03-03 10:56:37,963 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 10:56:38,145 INFO  L134       CoverageAnalysis]: Checked inductivity of 8721 backedges. 1645 proven. 0 refuted. 0 times theorem prover too weak. 7076 trivial. 0 not checked.
[2025-03-03 10:56:38,145 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-03 10:56:38,145 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [178410917] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 10:56:38,145 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-03 10:56:38,145 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6
[2025-03-03 10:56:38,145 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803354657]
[2025-03-03 10:56:38,146 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 10:56:38,146 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 10:56:38,146 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 10:56:38,147 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 10:56:38,147 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2025-03-03 10:56:38,147 INFO  L87              Difference]: Start difference. First operand 20073 states and 20751 transitions. Second operand  has 3 states, 3 states have (on average 162.0) internal successors, (486), 3 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:56:38,753 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 10:56:38,753 INFO  L93              Difference]: Finished difference Result 41131 states and 42501 transitions.
[2025-03-03 10:56:38,754 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 10:56:38,754 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 162.0) internal successors, (486), 3 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2111
[2025-03-03 10:56:38,755 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 10:56:38,772 INFO  L225             Difference]: With dead ends: 41131
[2025-03-03 10:56:38,772 INFO  L226             Difference]: Without dead ends: 21060
[2025-03-03 10:56:38,784 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2116 GetRequests, 2112 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2025-03-03 10:56:38,785 INFO  L435           NwaCegarLoop]: 423 mSDtfsCounter, 161 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 795 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 848 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 795 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-03 10:56:38,785 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 429 Invalid, 848 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 795 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-03 10:56:38,797 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 21060 states.
[2025-03-03 10:56:38,992 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 21060 to 18099.
[2025-03-03 10:56:39,005 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 18099 states, 18098 states have (on average 1.0309979003204774) internal successors, (18659), 18098 states have internal predecessors, (18659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:56:39,026 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 18099 states to 18099 states and 18659 transitions.
[2025-03-03 10:56:39,028 INFO  L78                 Accepts]: Start accepts. Automaton has 18099 states and 18659 transitions. Word has length 2111
[2025-03-03 10:56:39,029 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 10:56:39,029 INFO  L471      AbstractCegarLoop]: Abstraction has 18099 states and 18659 transitions.
[2025-03-03 10:56:39,030 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 162.0) internal successors, (486), 3 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:56:39,030 INFO  L276                IsEmpty]: Start isEmpty. Operand 18099 states and 18659 transitions.
[2025-03-03 10:56:39,082 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 2272
[2025-03-03 10:56:39,082 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 10:56:39,082 INFO  L218           NwaCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 10:56:39,089 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0
[2025-03-03 10:56:39,287 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16
[2025-03-03 10:56:39,287 INFO  L396      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 10:56:39,288 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 10:56:39,288 INFO  L85        PathProgramCache]: Analyzing trace with hash -218125748, now seen corresponding path program 1 times
[2025-03-03 10:56:39,288 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 10:56:39,288 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914917709]
[2025-03-03 10:56:39,288 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:56:39,288 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 10:56:39,402 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2271 statements into 1 equivalence classes.
[2025-03-03 10:56:39,465 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2271 of 2271 statements.
[2025-03-03 10:56:39,466 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:56:39,466 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:56:41,251 INFO  L134       CoverageAnalysis]: Checked inductivity of 9220 backedges. 4236 proven. 0 refuted. 0 times theorem prover too weak. 4984 trivial. 0 not checked.
[2025-03-03 10:56:41,252 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 10:56:41,252 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914917709]
[2025-03-03 10:56:41,252 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914917709] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 10:56:41,252 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 10:56:41,253 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 10:56:41,253 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713520519]
[2025-03-03 10:56:41,253 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 10:56:41,254 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 10:56:41,254 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 10:56:41,254 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 10:56:41,254 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 10:56:41,255 INFO  L87              Difference]: Start difference. First operand 18099 states and 18659 transitions. Second operand  has 3 states, 3 states have (on average 229.0) internal successors, (687), 3 states have internal predecessors, (687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:56:41,847 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 10:56:41,847 INFO  L93              Difference]: Finished difference Result 39486 states and 40680 transitions.
[2025-03-03 10:56:41,848 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 10:56:41,848 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 229.0) internal successors, (687), 3 states have internal predecessors, (687), 0 states have call successors, (0), 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 2271
[2025-03-03 10:56:41,848 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 10:56:41,864 INFO  L225             Difference]: With dead ends: 39486
[2025-03-03 10:56:41,864 INFO  L226             Difference]: Without dead ends: 21389
[2025-03-03 10:56:41,875 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-03-03 10:56:41,875 INFO  L435           NwaCegarLoop]: 52 mSDtfsCounter, 207 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 769 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-03 10:56:41,875 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 57 Invalid, 855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 769 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-03 10:56:41,884 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 21389 states.
[2025-03-03 10:56:42,023 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 21389 to 19086.
[2025-03-03 10:56:42,035 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 19086 states, 19085 states have (on average 1.0296567985328793) internal successors, (19651), 19085 states have internal predecessors, (19651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:56:42,053 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 19086 states to 19086 states and 19651 transitions.
[2025-03-03 10:56:42,054 INFO  L78                 Accepts]: Start accepts. Automaton has 19086 states and 19651 transitions. Word has length 2271
[2025-03-03 10:56:42,054 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 10:56:42,054 INFO  L471      AbstractCegarLoop]: Abstraction has 19086 states and 19651 transitions.
[2025-03-03 10:56:42,055 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 229.0) internal successors, (687), 3 states have internal predecessors, (687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:56:42,055 INFO  L276                IsEmpty]: Start isEmpty. Operand 19086 states and 19651 transitions.
[2025-03-03 10:56:42,110 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 2313
[2025-03-03 10:56:42,110 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 10:56:42,111 INFO  L218           NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 10:56:42,111 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2025-03-03 10:56:42,112 INFO  L396      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 10:56:42,114 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 10:56:42,114 INFO  L85        PathProgramCache]: Analyzing trace with hash 1894627783, now seen corresponding path program 1 times
[2025-03-03 10:56:42,114 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 10:56:42,114 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275334108]
[2025-03-03 10:56:42,114 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:56:42,115 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 10:56:42,236 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2312 statements into 1 equivalence classes.
[2025-03-03 10:56:42,313 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2312 of 2312 statements.
[2025-03-03 10:56:42,313 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:56:42,313 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:56:46,239 INFO  L134       CoverageAnalysis]: Checked inductivity of 10022 backedges. 6566 proven. 553 refuted. 0 times theorem prover too weak. 2903 trivial. 0 not checked.
[2025-03-03 10:56:46,239 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 10:56:46,239 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275334108]
[2025-03-03 10:56:46,239 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275334108] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 10:56:46,239 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1701978083]
[2025-03-03 10:56:46,240 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:56:46,240 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 10:56:46,240 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 10:56:46,242 INFO  L229       MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-03 10:56:46,243 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process
[2025-03-03 10:56:46,373 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2312 statements into 1 equivalence classes.
[2025-03-03 10:56:46,617 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2312 of 2312 statements.
[2025-03-03 10:56:46,617 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:56:46,620 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:56:46,628 INFO  L256         TraceCheckSpWp]: Trace formula consists of 2670 conjuncts, 4 conjuncts are in the unsatisfiable core
[2025-03-03 10:56:46,640 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 10:56:46,798 INFO  L134       CoverageAnalysis]: Checked inductivity of 10022 backedges. 5619 proven. 0 refuted. 0 times theorem prover too weak. 4403 trivial. 0 not checked.
[2025-03-03 10:56:46,798 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-03 10:56:46,798 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1701978083] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 10:56:46,798 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-03 10:56:46,798 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7
[2025-03-03 10:56:46,799 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225054880]
[2025-03-03 10:56:46,799 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 10:56:46,800 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 10:56:46,800 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 10:56:46,800 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 10:56:46,800 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2025-03-03 10:56:46,801 INFO  L87              Difference]: Start difference. First operand 19086 states and 19651 transitions. Second operand  has 3 states, 3 states have (on average 229.33333333333334) internal successors, (688), 3 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:56:47,348 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 10:56:47,349 INFO  L93              Difference]: Finished difference Result 38828 states and 39975 transitions.
[2025-03-03 10:56:47,349 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 10:56:47,349 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 229.33333333333334) internal successors, (688), 3 states have internal predecessors, (688), 0 states have call successors, (0), 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 2312
[2025-03-03 10:56:47,350 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 10:56:47,364 INFO  L225             Difference]: With dead ends: 38828
[2025-03-03 10:56:47,364 INFO  L226             Difference]: Without dead ends: 19744
[2025-03-03 10:56:47,373 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2319 GetRequests, 2314 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2025-03-03 10:56:47,373 INFO  L435           NwaCegarLoop]: 432 mSDtfsCounter, 263 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 770 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-03 10:56:47,373 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 438 Invalid, 773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 770 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-03 10:56:47,381 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 19744 states.
[2025-03-03 10:56:47,478 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 19744 to 19086.
[2025-03-03 10:56:47,488 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 19086 states, 19085 states have (on average 1.0296044013623264) internal successors, (19650), 19085 states have internal predecessors, (19650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:56:47,503 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 19086 states to 19086 states and 19650 transitions.
[2025-03-03 10:56:47,504 INFO  L78                 Accepts]: Start accepts. Automaton has 19086 states and 19650 transitions. Word has length 2312
[2025-03-03 10:56:47,505 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 10:56:47,505 INFO  L471      AbstractCegarLoop]: Abstraction has 19086 states and 19650 transitions.
[2025-03-03 10:56:47,505 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 229.33333333333334) internal successors, (688), 3 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:56:47,505 INFO  L276                IsEmpty]: Start isEmpty. Operand 19086 states and 19650 transitions.
[2025-03-03 10:56:47,589 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 2397
[2025-03-03 10:56:47,589 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 10:56:47,590 INFO  L218           NwaCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 10:56:47,599 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0
[2025-03-03 10:56:47,790 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 10:56:47,791 INFO  L396      AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 10:56:47,791 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 10:56:47,792 INFO  L85        PathProgramCache]: Analyzing trace with hash -905135605, now seen corresponding path program 1 times
[2025-03-03 10:56:47,792 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 10:56:47,792 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893564953]
[2025-03-03 10:56:47,792 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:56:47,792 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 10:56:47,896 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2396 statements into 1 equivalence classes.
[2025-03-03 10:56:47,960 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2396 of 2396 statements.
[2025-03-03 10:56:47,961 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:56:47,961 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:56:50,285 INFO  L134       CoverageAnalysis]: Checked inductivity of 11315 backedges. 7816 proven. 153 refuted. 0 times theorem prover too weak. 3346 trivial. 0 not checked.
[2025-03-03 10:56:50,285 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 10:56:50,285 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893564953]
[2025-03-03 10:56:50,286 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893564953] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 10:56:50,286 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1689263181]
[2025-03-03 10:56:50,286 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:56:50,286 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 10:56:50,286 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 10:56:50,288 INFO  L229       MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-03 10:56:50,289 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process
[2025-03-03 10:56:50,417 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2396 statements into 1 equivalence classes.
[2025-03-03 10:56:50,668 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2396 of 2396 statements.
[2025-03-03 10:56:50,668 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:56:50,668 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:56:50,676 INFO  L256         TraceCheckSpWp]: Trace formula consists of 2762 conjuncts, 3 conjuncts are in the unsatisfiable core
[2025-03-03 10:56:50,691 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 10:56:50,815 INFO  L134       CoverageAnalysis]: Checked inductivity of 11315 backedges. 6174 proven. 0 refuted. 0 times theorem prover too weak. 5141 trivial. 0 not checked.
[2025-03-03 10:56:50,815 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-03 10:56:50,816 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1689263181] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 10:56:50,816 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-03 10:56:50,816 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7
[2025-03-03 10:56:50,816 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676981088]
[2025-03-03 10:56:50,816 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 10:56:50,817 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 10:56:50,817 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 10:56:50,818 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 10:56:50,818 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2025-03-03 10:56:50,818 INFO  L87              Difference]: Start difference. First operand 19086 states and 19650 transitions. Second operand  has 3 states, 3 states have (on average 227.66666666666666) internal successors, (683), 3 states have internal predecessors, (683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:56:51,477 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 10:56:51,477 INFO  L93              Difference]: Finished difference Result 39815 states and 41011 transitions.
[2025-03-03 10:56:51,478 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 10:56:51,478 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 227.66666666666666) internal successors, (683), 3 states have internal predecessors, (683), 0 states have call successors, (0), 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 2396
[2025-03-03 10:56:51,478 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 10:56:51,495 INFO  L225             Difference]: With dead ends: 39815
[2025-03-03 10:56:51,495 INFO  L226             Difference]: Without dead ends: 20731
[2025-03-03 10:56:51,507 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2401 GetRequests, 2396 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2025-03-03 10:56:51,507 INFO  L435           NwaCegarLoop]: 420 mSDtfsCounter, 223 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 801 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 801 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-03 10:56:51,507 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 425 Invalid, 849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 801 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-03 10:56:51,517 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 20731 states.
[2025-03-03 10:56:51,678 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 20731 to 20731.
[2025-03-03 10:56:51,691 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 20731 states, 20730 states have (on average 1.0277375783888085) internal successors, (21305), 20730 states have internal predecessors, (21305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:56:51,715 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 20731 states to 20731 states and 21305 transitions.
[2025-03-03 10:56:51,715 INFO  L78                 Accepts]: Start accepts. Automaton has 20731 states and 21305 transitions. Word has length 2396
[2025-03-03 10:56:51,716 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 10:56:51,716 INFO  L471      AbstractCegarLoop]: Abstraction has 20731 states and 21305 transitions.
[2025-03-03 10:56:51,716 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 227.66666666666666) internal successors, (683), 3 states have internal predecessors, (683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:56:51,716 INFO  L276                IsEmpty]: Start isEmpty. Operand 20731 states and 21305 transitions.
[2025-03-03 10:56:51,777 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 2509
[2025-03-03 10:56:51,777 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 10:56:51,778 INFO  L218           NwaCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 10:56:51,786 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0
[2025-03-03 10:56:51,978 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 10:56:51,978 INFO  L396      AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 10:56:51,979 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 10:56:51,979 INFO  L85        PathProgramCache]: Analyzing trace with hash 980660221, now seen corresponding path program 1 times
[2025-03-03 10:56:51,979 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 10:56:51,979 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963684654]
[2025-03-03 10:56:51,979 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:56:51,980 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 10:56:52,084 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2508 statements into 1 equivalence classes.
[2025-03-03 10:56:52,150 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2508 of 2508 statements.
[2025-03-03 10:56:52,151 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:56:52,151 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:56:54,522 INFO  L134       CoverageAnalysis]: Checked inductivity of 12061 backedges. 8681 proven. 91 refuted. 0 times theorem prover too weak. 3289 trivial. 0 not checked.
[2025-03-03 10:56:54,522 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 10:56:54,522 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963684654]
[2025-03-03 10:56:54,523 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963684654] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 10:56:54,523 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2075652833]
[2025-03-03 10:56:54,523 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:56:54,523 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 10:56:54,523 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 10:56:54,525 INFO  L229       MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-03 10:56:54,526 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process
[2025-03-03 10:56:54,704 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2508 statements into 1 equivalence classes.
[2025-03-03 10:56:54,970 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2508 of 2508 statements.
[2025-03-03 10:56:54,970 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:56:54,970 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:56:54,977 INFO  L256         TraceCheckSpWp]: Trace formula consists of 2877 conjuncts, 4 conjuncts are in the unsatisfiable core
[2025-03-03 10:56:54,989 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 10:56:55,327 INFO  L134       CoverageAnalysis]: Checked inductivity of 12061 backedges. 7264 proven. 0 refuted. 0 times theorem prover too weak. 4797 trivial. 0 not checked.
[2025-03-03 10:56:55,327 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-03 10:56:55,327 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2075652833] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 10:56:55,327 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-03 10:56:55,328 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8
[2025-03-03 10:56:55,328 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142048801]
[2025-03-03 10:56:55,328 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 10:56:55,329 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-03 10:56:55,329 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 10:56:55,329 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-03 10:56:55,329 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2025-03-03 10:56:55,329 INFO  L87              Difference]: Start difference. First operand 20731 states and 21305 transitions. Second operand  has 4 states, 4 states have (on average 193.75) internal successors, (775), 4 states have internal predecessors, (775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:56:56,259 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 10:56:56,259 INFO  L93              Difference]: Finished difference Result 42447 states and 43617 transitions.
[2025-03-03 10:56:56,260 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 10:56:56,260 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 193.75) internal successors, (775), 4 states have internal predecessors, (775), 0 states have call successors, (0), 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 2508
[2025-03-03 10:56:56,261 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 10:56:56,275 INFO  L225             Difference]: With dead ends: 42447
[2025-03-03 10:56:56,275 INFO  L226             Difference]: Without dead ends: 21718
[2025-03-03 10:56:56,285 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2513 GetRequests, 2507 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2025-03-03 10:56:56,286 INFO  L435           NwaCegarLoop]: 52 mSDtfsCounter, 495 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 1192 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 495 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 1245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time
[2025-03-03 10:56:56,286 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [495 Valid, 62 Invalid, 1245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1192 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2025-03-03 10:56:56,296 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 21718 states.
[2025-03-03 10:56:56,398 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 21718 to 21060.
[2025-03-03 10:56:56,411 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 21060 states, 21059 states have (on average 1.0276366399164252) internal successors, (21641), 21059 states have internal predecessors, (21641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:56:56,428 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 21060 states to 21060 states and 21641 transitions.
[2025-03-03 10:56:56,429 INFO  L78                 Accepts]: Start accepts. Automaton has 21060 states and 21641 transitions. Word has length 2508
[2025-03-03 10:56:56,430 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 10:56:56,430 INFO  L471      AbstractCegarLoop]: Abstraction has 21060 states and 21641 transitions.
[2025-03-03 10:56:56,430 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 193.75) internal successors, (775), 4 states have internal predecessors, (775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:56:56,430 INFO  L276                IsEmpty]: Start isEmpty. Operand 21060 states and 21641 transitions.
[2025-03-03 10:56:56,513 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 2638
[2025-03-03 10:56:56,513 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 10:56:56,514 INFO  L218           NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 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]
[2025-03-03 10:56:56,522 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0
[2025-03-03 10:56:56,714 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20
[2025-03-03 10:56:56,715 INFO  L396      AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 10:56:56,715 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 10:56:56,716 INFO  L85        PathProgramCache]: Analyzing trace with hash -1836637977, now seen corresponding path program 1 times
[2025-03-03 10:56:56,716 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 10:56:56,716 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212874783]
[2025-03-03 10:56:56,716 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:56:56,716 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 10:56:56,893 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2637 statements into 1 equivalence classes.
[2025-03-03 10:56:57,014 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2637 of 2637 statements.
[2025-03-03 10:56:57,015 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:56:57,015 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:56:59,050 INFO  L134       CoverageAnalysis]: Checked inductivity of 12253 backedges. 7737 proven. 0 refuted. 0 times theorem prover too weak. 4516 trivial. 0 not checked.
[2025-03-03 10:56:59,050 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 10:56:59,050 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212874783]
[2025-03-03 10:56:59,050 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212874783] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 10:56:59,050 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 10:56:59,051 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 10:56:59,051 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994346530]
[2025-03-03 10:56:59,051 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 10:56:59,051 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 10:56:59,052 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 10:56:59,052 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 10:56:59,052 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 10:56:59,052 INFO  L87              Difference]: Start difference. First operand 21060 states and 21641 transitions. Second operand  has 3 states, 3 states have (on average 297.3333333333333) internal successors, (892), 3 states have internal predecessors, (892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:56:59,657 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 10:56:59,657 INFO  L93              Difference]: Finished difference Result 45079 states and 46322 transitions.
[2025-03-03 10:56:59,657 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 10:56:59,657 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 297.3333333333333) internal successors, (892), 3 states have internal predecessors, (892), 0 states have call successors, (0), 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 2637
[2025-03-03 10:56:59,658 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 10:56:59,679 INFO  L225             Difference]: With dead ends: 45079
[2025-03-03 10:56:59,679 INFO  L226             Difference]: Without dead ends: 24021
[2025-03-03 10:56:59,692 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 10:56:59,695 INFO  L435           NwaCegarLoop]: 409 mSDtfsCounter, 41 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 815 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 854 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 815 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-03 10:56:59,695 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 415 Invalid, 854 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 815 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-03 10:56:59,718 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 24021 states.
[2025-03-03 10:56:59,855 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 24021 to 22047.
[2025-03-03 10:56:59,870 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 22047 states, 22046 states have (on average 1.0286673319423025) internal successors, (22678), 22046 states have internal predecessors, (22678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:56:59,887 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 22047 states to 22047 states and 22678 transitions.
[2025-03-03 10:56:59,888 INFO  L78                 Accepts]: Start accepts. Automaton has 22047 states and 22678 transitions. Word has length 2637
[2025-03-03 10:56:59,889 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 10:56:59,889 INFO  L471      AbstractCegarLoop]: Abstraction has 22047 states and 22678 transitions.
[2025-03-03 10:56:59,889 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 297.3333333333333) internal successors, (892), 3 states have internal predecessors, (892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:56:59,889 INFO  L276                IsEmpty]: Start isEmpty. Operand 22047 states and 22678 transitions.
[2025-03-03 10:56:59,924 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 2638
[2025-03-03 10:56:59,924 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 10:56:59,925 INFO  L218           NwaCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 10:56:59,925 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2025-03-03 10:56:59,925 INFO  L396      AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 10:56:59,925 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 10:56:59,926 INFO  L85        PathProgramCache]: Analyzing trace with hash 1754311998, now seen corresponding path program 1 times
[2025-03-03 10:56:59,926 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 10:56:59,926 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735953604]
[2025-03-03 10:56:59,926 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:56:59,926 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 10:57:00,036 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2637 statements into 1 equivalence classes.
[2025-03-03 10:57:00,112 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2637 of 2637 statements.
[2025-03-03 10:57:00,112 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:57:00,112 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:57:02,852 INFO  L134       CoverageAnalysis]: Checked inductivity of 12965 backedges. 9211 proven. 91 refuted. 0 times theorem prover too weak. 3663 trivial. 0 not checked.
[2025-03-03 10:57:02,853 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 10:57:02,853 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735953604]
[2025-03-03 10:57:02,853 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735953604] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 10:57:02,853 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2015323841]
[2025-03-03 10:57:02,853 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:57:02,853 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 10:57:02,853 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 10:57:02,854 INFO  L229       MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-03 10:57:02,855 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process
[2025-03-03 10:57:03,000 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2637 statements into 1 equivalence classes.
[2025-03-03 10:57:03,274 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2637 of 2637 statements.
[2025-03-03 10:57:03,274 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:57:03,274 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:57:03,283 INFO  L256         TraceCheckSpWp]: Trace formula consists of 3006 conjuncts, 3 conjuncts are in the unsatisfiable core
[2025-03-03 10:57:03,296 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 10:57:03,586 INFO  L134       CoverageAnalysis]: Checked inductivity of 12965 backedges. 8168 proven. 0 refuted. 0 times theorem prover too weak. 4797 trivial. 0 not checked.
[2025-03-03 10:57:03,586 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-03 10:57:03,586 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2015323841] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 10:57:03,586 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-03 10:57:03,586 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8
[2025-03-03 10:57:03,586 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110661341]
[2025-03-03 10:57:03,586 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 10:57:03,587 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-03 10:57:03,587 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 10:57:03,588 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-03 10:57:03,588 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2025-03-03 10:57:03,588 INFO  L87              Difference]: Start difference. First operand 22047 states and 22678 transitions. Second operand  has 4 states, 4 states have (on average 226.0) internal successors, (904), 4 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:57:04,348 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 10:57:04,349 INFO  L93              Difference]: Finished difference Result 44750 states and 46021 transitions.
[2025-03-03 10:57:04,349 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 10:57:04,349 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 226.0) internal successors, (904), 4 states have internal predecessors, (904), 0 states have call successors, (0), 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 2637
[2025-03-03 10:57:04,350 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 10:57:04,369 INFO  L225             Difference]: With dead ends: 44750
[2025-03-03 10:57:04,369 INFO  L226             Difference]: Without dead ends: 22705
[2025-03-03 10:57:04,381 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2642 GetRequests, 2636 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2025-03-03 10:57:04,381 INFO  L435           NwaCegarLoop]: 53 mSDtfsCounter, 466 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 1110 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 1196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 1110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-03-03 10:57:04,382 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [466 Valid, 62 Invalid, 1196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 1110 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-03-03 10:57:04,391 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 22705 states.
[2025-03-03 10:57:04,507 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 22705 to 21389.
[2025-03-03 10:57:04,521 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 21389 states, 21388 states have (on average 1.0285206657939032) internal successors, (21998), 21388 states have internal predecessors, (21998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:57:04,538 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 21389 states to 21389 states and 21998 transitions.
[2025-03-03 10:57:04,538 INFO  L78                 Accepts]: Start accepts. Automaton has 21389 states and 21998 transitions. Word has length 2637
[2025-03-03 10:57:04,539 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 10:57:04,539 INFO  L471      AbstractCegarLoop]: Abstraction has 21389 states and 21998 transitions.
[2025-03-03 10:57:04,539 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 226.0) internal successors, (904), 4 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:57:04,539 INFO  L276                IsEmpty]: Start isEmpty. Operand 21389 states and 21998 transitions.
[2025-03-03 10:57:04,618 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 2650
[2025-03-03 10:57:04,618 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 10:57:04,619 INFO  L218           NwaCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 10:57:04,627 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0
[2025-03-03 10:57:04,819 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 10:57:04,819 INFO  L396      AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 10:57:04,820 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 10:57:04,820 INFO  L85        PathProgramCache]: Analyzing trace with hash 1051753019, now seen corresponding path program 1 times
[2025-03-03 10:57:04,820 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 10:57:04,821 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247353675]
[2025-03-03 10:57:04,821 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:57:04,821 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 10:57:04,926 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2649 statements into 1 equivalence classes.
[2025-03-03 10:57:05,000 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2649 of 2649 statements.
[2025-03-03 10:57:05,000 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:57:05,000 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:57:08,266 INFO  L134       CoverageAnalysis]: Checked inductivity of 12191 backedges. 7956 proven. 0 refuted. 0 times theorem prover too weak. 4235 trivial. 0 not checked.
[2025-03-03 10:57:08,266 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 10:57:08,267 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247353675]
[2025-03-03 10:57:08,267 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247353675] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 10:57:08,267 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 10:57:08,267 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-03 10:57:08,267 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115865644]
[2025-03-03 10:57:08,267 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 10:57:08,268 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-03 10:57:08,268 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 10:57:08,268 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-03 10:57:08,268 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-03 10:57:08,268 INFO  L87              Difference]: Start difference. First operand 21389 states and 21998 transitions. Second operand  has 4 states, 4 states have (on average 229.5) internal successors, (918), 4 states have internal predecessors, (918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:57:09,179 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 10:57:09,179 INFO  L93              Difference]: Finished difference Result 46395 states and 47731 transitions.
[2025-03-03 10:57:09,179 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 10:57:09,180 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 229.5) internal successors, (918), 4 states have internal predecessors, (918), 0 states have call successors, (0), 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 2649
[2025-03-03 10:57:09,180 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 10:57:09,204 INFO  L225             Difference]: With dead ends: 46395
[2025-03-03 10:57:09,204 INFO  L226             Difference]: Without dead ends: 25008
[2025-03-03 10:57:09,218 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-03 10:57:09,219 INFO  L435           NwaCegarLoop]: 37 mSDtfsCounter, 308 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 1494 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 1613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 1494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time
[2025-03-03 10:57:09,219 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 47 Invalid, 1613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 1494 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2025-03-03 10:57:09,231 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 25008 states.
[2025-03-03 10:57:09,421 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 25008 to 22376.
[2025-03-03 10:57:09,432 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 22376 states, 22375 states have (on average 1.0279329608938548) internal successors, (23000), 22375 states have internal predecessors, (23000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:57:09,450 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 22376 states to 22376 states and 23000 transitions.
[2025-03-03 10:57:09,450 INFO  L78                 Accepts]: Start accepts. Automaton has 22376 states and 23000 transitions. Word has length 2649
[2025-03-03 10:57:09,451 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 10:57:09,451 INFO  L471      AbstractCegarLoop]: Abstraction has 22376 states and 23000 transitions.
[2025-03-03 10:57:09,451 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 229.5) internal successors, (918), 4 states have internal predecessors, (918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:57:09,451 INFO  L276                IsEmpty]: Start isEmpty. Operand 22376 states and 23000 transitions.
[2025-03-03 10:57:09,489 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 2767
[2025-03-03 10:57:09,489 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 10:57:09,490 INFO  L218           NwaCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 10:57:09,490 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2025-03-03 10:57:09,490 INFO  L396      AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 10:57:09,491 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 10:57:09,491 INFO  L85        PathProgramCache]: Analyzing trace with hash 249458095, now seen corresponding path program 1 times
[2025-03-03 10:57:09,491 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 10:57:09,491 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713581061]
[2025-03-03 10:57:09,491 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:57:09,491 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 10:57:09,604 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2766 statements into 1 equivalence classes.
[2025-03-03 10:57:09,684 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2766 of 2766 statements.
[2025-03-03 10:57:09,684 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:57:09,684 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:57:13,678 INFO  L134       CoverageAnalysis]: Checked inductivity of 13501 backedges. 8551 proven. 79 refuted. 0 times theorem prover too weak. 4871 trivial. 0 not checked.
[2025-03-03 10:57:13,678 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 10:57:13,679 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713581061]
[2025-03-03 10:57:13,679 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713581061] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 10:57:13,679 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1465148657]
[2025-03-03 10:57:13,679 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:57:13,679 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 10:57:13,679 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 10:57:13,681 INFO  L229       MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-03 10:57:13,681 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process
[2025-03-03 10:57:13,832 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2766 statements into 1 equivalence classes.
[2025-03-03 10:57:14,109 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2766 of 2766 statements.
[2025-03-03 10:57:14,109 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:57:14,109 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:57:14,118 INFO  L256         TraceCheckSpWp]: Trace formula consists of 3144 conjuncts, 5 conjuncts are in the unsatisfiable core
[2025-03-03 10:57:14,130 INFO  L279         TraceCheckSpWp]: Computing forward predicates...