./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem17_label42.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/Problem17_label42.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 96107ddac20ae25720715e53c2e276b0ff7d668effb9cd422fe5eafc03582006
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-798a7b3-m
[2025-03-03 11:01:14,306 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-03-03 11:01:14,365 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2025-03-03 11:01:14,369 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-03-03 11:01:14,369 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-03-03 11:01:14,389 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-03-03 11:01:14,390 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-03-03 11:01:14,390 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-03-03 11:01:14,391 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-03-03 11:01:14,391 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-03-03 11:01:14,391 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-03-03 11:01:14,392 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-03-03 11:01:14,392 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-03-03 11:01:14,392 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-03-03 11:01:14,392 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-03-03 11:01:14,393 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-03-03 11:01:14,393 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-03-03 11:01:14,393 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-03-03 11:01:14,393 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-03-03 11:01:14,393 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-03-03 11:01:14,393 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-03-03 11:01:14,393 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-03-03 11:01:14,393 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-03-03 11:01:14,393 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-03-03 11:01:14,393 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-03-03 11:01:14,393 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-03-03 11:01:14,393 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-03-03 11:01:14,393 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-03-03 11:01:14,394 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-03-03 11:01:14,394 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-03-03 11:01:14,394 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-03-03 11:01:14,394 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-03-03 11:01:14,394 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-03 11:01:14,394 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-03-03 11:01:14,394 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-03-03 11:01:14,394 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-03-03 11:01:14,394 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-03-03 11:01:14,395 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-03-03 11:01:14,395 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-03-03 11:01:14,395 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-03-03 11:01:14,395 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-03-03 11:01:14,395 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-03-03 11:01:14,395 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-03-03 11:01:14,395 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 -> 96107ddac20ae25720715e53c2e276b0ff7d668effb9cd422fe5eafc03582006
[2025-03-03 11:01:14,631 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-03-03 11:01:14,639 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-03-03 11:01:14,641 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-03-03 11:01:14,642 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-03-03 11:01:14,643 INFO  L274        PluginConnector]: CDTParser initialized
[2025-03-03 11:01:14,643 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem17_label42.c
[2025-03-03 11:01:15,831 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95a2096dc/424a55a06eb7429c8e316007345a6f9a/FLAG183b47a6f
[2025-03-03 11:01:16,243 INFO  L384              CDTParser]: Found 1 translation units.
[2025-03-03 11:01:16,244 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label42.c
[2025-03-03 11:01:16,267 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95a2096dc/424a55a06eb7429c8e316007345a6f9a/FLAG183b47a6f
[2025-03-03 11:01:16,399 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95a2096dc/424a55a06eb7429c8e316007345a6f9a
[2025-03-03 11:01:16,402 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-03-03 11:01:16,403 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-03-03 11:01:16,405 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-03-03 11:01:16,406 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-03-03 11:01:16,409 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-03-03 11:01:16,411 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:01:16" (1/1) ...
[2025-03-03 11:01:16,412 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c952fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:01:16, skipping insertion in model container
[2025-03-03 11:01:16,412 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:01:16" (1/1) ...
[2025-03-03 11:01:16,478 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-03-03 11:01:16,646 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/Problem17_label42.c[6070,6083]
[2025-03-03 11:01:17,005 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-03 11:01:17,015 INFO  L200         MainTranslator]: Completed pre-run
[2025-03-03 11:01:17,030 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/Problem17_label42.c[6070,6083]
[2025-03-03 11:01:17,222 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-03 11:01:17,234 INFO  L204         MainTranslator]: Completed translation
[2025-03-03 11:01:17,235 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:01:17 WrapperNode
[2025-03-03 11:01:17,236 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-03-03 11:01:17,236 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-03-03 11:01:17,236 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-03-03 11:01:17,236 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-03-03 11:01:17,241 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:01:17" (1/1) ...
[2025-03-03 11:01:17,273 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:01:17" (1/1) ...
[2025-03-03 11:01:17,466 INFO  L138                Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 2610
[2025-03-03 11:01:17,466 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-03-03 11:01:17,466 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-03-03 11:01:17,467 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-03-03 11:01:17,467 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-03-03 11:01:17,473 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:01:17" (1/1) ...
[2025-03-03 11:01:17,473 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:01:17" (1/1) ...
[2025-03-03 11:01:17,508 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:01:17" (1/1) ...
[2025-03-03 11:01:17,634 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 11:01:17,636 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:01:17" (1/1) ...
[2025-03-03 11:01:17,636 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:01:17" (1/1) ...
[2025-03-03 11:01:17,699 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:01:17" (1/1) ...
[2025-03-03 11:01:17,713 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:01:17" (1/1) ...
[2025-03-03 11:01:17,728 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:01:17" (1/1) ...
[2025-03-03 11:01:17,740 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:01:17" (1/1) ...
[2025-03-03 11:01:17,776 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-03-03 11:01:17,778 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-03-03 11:01:17,778 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-03-03 11:01:17,779 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-03-03 11:01:17,779 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:01:17" (1/1) ...
[2025-03-03 11:01:17,784 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-03 11:01:17,794 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 11:01:17,807 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 11:01:17,812 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 11:01:17,825 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-03-03 11:01:17,826 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-03-03 11:01:17,826 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-03-03 11:01:17,826 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-03-03 11:01:17,872 INFO  L256             CfgBuilder]: Building ICFG
[2025-03-03 11:01:17,873 INFO  L286             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-03-03 11:01:20,339 INFO  L1325  $ProcedureCfgBuilder]: dead code at ProgramPoint L1653: havoc calculate_output_#t~ret7#1;
[2025-03-03 11:01:20,441 INFO  L?                        ?]: Removed 372 outVars from TransFormulas that were not future-live.
[2025-03-03 11:01:20,441 INFO  L307             CfgBuilder]: Performing block encoding
[2025-03-03 11:01:20,465 INFO  L331             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-03-03 11:01:20,465 INFO  L336             CfgBuilder]: Removed 0 assume(true) statements.
[2025-03-03 11:01:20,465 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:01:20 BoogieIcfgContainer
[2025-03-03 11:01:20,465 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-03-03 11:01:20,470 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-03-03 11:01:20,470 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-03-03 11:01:20,473 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-03-03 11:01:20,474 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 11:01:16" (1/3) ...
[2025-03-03 11:01:20,474 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62b872bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:01:20, skipping insertion in model container
[2025-03-03 11:01:20,474 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:01:17" (2/3) ...
[2025-03-03 11:01:20,474 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62b872bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:01:20, skipping insertion in model container
[2025-03-03 11:01:20,474 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:01:20" (3/3) ...
[2025-03-03 11:01:20,475 INFO  L128   eAbstractionObserver]: Analyzing ICFG Problem17_label42.c
[2025-03-03 11:01:20,486 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-03-03 11:01:20,487 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG Problem17_label42.c that has 1 procedures, 590 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-03-03 11:01:20,546 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-03-03 11:01:20,557 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;@48edca20, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-03-03 11:01:20,557 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-03-03 11:01:20,563 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 590 states, 588 states have (on average 1.804421768707483) internal successors, (1061), 589 states have internal predecessors, (1061), 0 states have call successors, (0), 0 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 11:01:20,568 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 41
[2025-03-03 11:01:20,568 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 11:01:20,568 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 11:01:20,569 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 11:01:20,573 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 11:01:20,573 INFO  L85        PathProgramCache]: Analyzing trace with hash 325557195, now seen corresponding path program 1 times
[2025-03-03 11:01:20,578 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 11:01:20,581 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44282666]
[2025-03-03 11:01:20,581 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 11:01:20,581 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 11:01:20,641 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes.
[2025-03-03 11:01:20,662 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements.
[2025-03-03 11:01:20,662 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 11:01:20,662 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 11:01:20,815 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 11:01:20,816 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 11:01:20,816 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44282666]
[2025-03-03 11:01:20,816 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44282666] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 11:01:20,816 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 11:01:20,816 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-03 11:01:20,817 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570961319]
[2025-03-03 11:01:20,818 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 11:01:20,820 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 11:01:20,821 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 11:01:20,834 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 11:01:20,834 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 11:01:20,837 INFO  L87              Difference]: Start difference. First operand  has 590 states, 588 states have (on average 1.804421768707483) internal successors, (1061), 589 states have internal predecessors, (1061), 0 states have call successors, (0), 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 13.333333333333334) internal successors, (40), 2 states have internal predecessors, (40), 0 states have call successors, (0), 0 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 11:01:22,863 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 11:01:22,864 INFO  L93              Difference]: Finished difference Result 1642 states and 3021 transitions.
[2025-03-03 11:01:22,865 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 11:01:22,866 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 2 states have internal predecessors, (40), 0 states have call successors, (0), 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 40
[2025-03-03 11:01:22,866 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 11:01:22,876 INFO  L225             Difference]: With dead ends: 1642
[2025-03-03 11:01:22,880 INFO  L226             Difference]: Without dead ends: 975
[2025-03-03 11:01:22,884 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 11:01:22,885 INFO  L435           NwaCegarLoop]: 475 mSDtfsCounter, 450 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 1413 mSolverCounterSat, 372 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 450 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 1785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 372 IncrementalHoareTripleChecker+Valid, 1413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time
[2025-03-03 11:01:22,886 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [450 Valid, 551 Invalid, 1785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [372 Valid, 1413 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time]
[2025-03-03 11:01:22,898 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 975 states.
[2025-03-03 11:01:22,932 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 972.
[2025-03-03 11:01:22,935 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 972 states, 971 states have (on average 1.5077239958805355) internal successors, (1464), 971 states have internal predecessors, (1464), 0 states have call successors, (0), 0 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 11:01:22,939 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 972 states and 1464 transitions.
[2025-03-03 11:01:22,940 INFO  L78                 Accepts]: Start accepts. Automaton has 972 states and 1464 transitions. Word has length 40
[2025-03-03 11:01:22,940 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 11:01:22,940 INFO  L471      AbstractCegarLoop]: Abstraction has 972 states and 1464 transitions.
[2025-03-03 11:01:22,941 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 2 states have internal predecessors, (40), 0 states have call successors, (0), 0 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 11:01:22,941 INFO  L276                IsEmpty]: Start isEmpty. Operand 972 states and 1464 transitions.
[2025-03-03 11:01:22,943 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 111
[2025-03-03 11:01:22,943 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 11:01:22,943 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:01:22,943 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2025-03-03 11:01:22,943 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 11:01:22,944 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 11:01:22,944 INFO  L85        PathProgramCache]: Analyzing trace with hash 1581656435, now seen corresponding path program 1 times
[2025-03-03 11:01:22,944 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 11:01:22,944 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126419011]
[2025-03-03 11:01:22,944 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 11:01:22,944 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 11:01:22,964 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes.
[2025-03-03 11:01:23,009 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements.
[2025-03-03 11:01:23,010 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 11:01:23,010 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 11:01:23,210 INFO  L134       CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 11:01:23,211 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 11:01:23,211 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126419011]
[2025-03-03 11:01:23,211 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126419011] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 11:01:23,211 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 11:01:23,211 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 11:01:23,211 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055538835]
[2025-03-03 11:01:23,211 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 11:01:23,212 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 11:01:23,212 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 11:01:23,212 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 11:01:23,213 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 11:01:23,213 INFO  L87              Difference]: Start difference. First operand 972 states and 1464 transitions. Second operand  has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 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 11:01:24,949 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 11:01:24,950 INFO  L93              Difference]: Finished difference Result 2814 states and 4242 transitions.
[2025-03-03 11:01:24,950 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 11:01:24,950 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 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 110
[2025-03-03 11:01:24,951 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 11:01:24,957 INFO  L225             Difference]: With dead ends: 2814
[2025-03-03 11:01:24,957 INFO  L226             Difference]: Without dead ends: 1844
[2025-03-03 11:01:24,958 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 11:01:24,959 INFO  L435           NwaCegarLoop]: 853 mSDtfsCounter, 451 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 1283 mSolverCounterSat, 414 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 451 SdHoareTripleChecker+Valid, 921 SdHoareTripleChecker+Invalid, 1697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 414 IncrementalHoareTripleChecker+Valid, 1283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time
[2025-03-03 11:01:24,960 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [451 Valid, 921 Invalid, 1697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [414 Valid, 1283 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time]
[2025-03-03 11:01:24,964 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1844 states.
[2025-03-03 11:01:25,000 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1844 to 1842.
[2025-03-03 11:01:25,003 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1842 states, 1841 states have (on average 1.3601303639326452) internal successors, (2504), 1841 states have internal predecessors, (2504), 0 states have call successors, (0), 0 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 11:01:25,008 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1842 states to 1842 states and 2504 transitions.
[2025-03-03 11:01:25,009 INFO  L78                 Accepts]: Start accepts. Automaton has 1842 states and 2504 transitions. Word has length 110
[2025-03-03 11:01:25,010 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 11:01:25,010 INFO  L471      AbstractCegarLoop]: Abstraction has 1842 states and 2504 transitions.
[2025-03-03 11:01:25,011 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 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 11:01:25,011 INFO  L276                IsEmpty]: Start isEmpty. Operand 1842 states and 2504 transitions.
[2025-03-03 11:01:25,014 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 133
[2025-03-03 11:01:25,015 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 11:01:25,015 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:01:25,016 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-03-03 11:01:25,016 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 11:01:25,016 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 11:01:25,016 INFO  L85        PathProgramCache]: Analyzing trace with hash 1196892648, now seen corresponding path program 1 times
[2025-03-03 11:01:25,016 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 11:01:25,016 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161903617]
[2025-03-03 11:01:25,016 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 11:01:25,016 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 11:01:25,041 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes.
[2025-03-03 11:01:25,058 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements.
[2025-03-03 11:01:25,058 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 11:01:25,058 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 11:01:25,224 INFO  L134       CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 11:01:25,225 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 11:01:25,225 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161903617]
[2025-03-03 11:01:25,225 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161903617] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 11:01:25,225 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 11:01:25,225 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-03 11:01:25,225 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032486326]
[2025-03-03 11:01:25,225 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 11:01:25,225 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 11:01:25,225 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 11:01:25,226 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 11:01:25,226 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 11:01:25,226 INFO  L87              Difference]: Start difference. First operand 1842 states and 2504 transitions. Second operand  has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 0 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 11:01:27,038 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 11:01:27,038 INFO  L93              Difference]: Finished difference Result 5395 states and 7326 transitions.
[2025-03-03 11:01:27,039 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 11:01:27,039 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 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 132
[2025-03-03 11:01:27,039 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 11:01:27,048 INFO  L225             Difference]: With dead ends: 5395
[2025-03-03 11:01:27,049 INFO  L226             Difference]: Without dead ends: 2701
[2025-03-03 11:01:27,054 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 11:01:27,055 INFO  L435           NwaCegarLoop]: 515 mSDtfsCounter, 368 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 1629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 548 IncrementalHoareTripleChecker+Valid, 1081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time
[2025-03-03 11:01:27,055 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 590 Invalid, 1629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 1081 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time]
[2025-03-03 11:01:27,058 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2701 states.
[2025-03-03 11:01:27,091 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2701 to 2701.
[2025-03-03 11:01:27,094 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2701 states, 2700 states have (on average 1.191851851851852) internal successors, (3218), 2700 states have internal predecessors, (3218), 0 states have call successors, (0), 0 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 11:01:27,100 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2701 states to 2701 states and 3218 transitions.
[2025-03-03 11:01:27,101 INFO  L78                 Accepts]: Start accepts. Automaton has 2701 states and 3218 transitions. Word has length 132
[2025-03-03 11:01:27,101 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 11:01:27,101 INFO  L471      AbstractCegarLoop]: Abstraction has 2701 states and 3218 transitions.
[2025-03-03 11:01:27,101 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 0 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 11:01:27,102 INFO  L276                IsEmpty]: Start isEmpty. Operand 2701 states and 3218 transitions.
[2025-03-03 11:01:27,104 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 193
[2025-03-03 11:01:27,104 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 11:01:27,104 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-03-03 11:01:27,104 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-03-03 11:01:27,104 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 11:01:27,105 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 11:01:27,105 INFO  L85        PathProgramCache]: Analyzing trace with hash -1024359760, now seen corresponding path program 1 times
[2025-03-03 11:01:27,105 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 11:01:27,105 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547329906]
[2025-03-03 11:01:27,105 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 11:01:27,105 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 11:01:27,127 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes.
[2025-03-03 11:01:27,143 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements.
[2025-03-03 11:01:27,143 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 11:01:27,143 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 11:01:27,311 INFO  L134       CoverageAnalysis]: Checked inductivity of 143 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 11:01:27,311 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 11:01:27,311 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547329906]
[2025-03-03 11:01:27,311 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547329906] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 11:01:27,311 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 11:01:27,311 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 11:01:27,311 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805782978]
[2025-03-03 11:01:27,311 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 11:01:27,312 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 11:01:27,312 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 11:01:27,312 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 11:01:27,312 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 11:01:27,313 INFO  L87              Difference]: Start difference. First operand 2701 states and 3218 transitions. Second operand  has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 0 states have call successors, (0), 0 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 11:01:28,844 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 11:01:28,845 INFO  L93              Difference]: Finished difference Result 7108 states and 8598 transitions.
[2025-03-03 11:01:28,845 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 11:01:28,845 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 0 states have call successors, (0), 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 192
[2025-03-03 11:01:28,848 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 11:01:28,858 INFO  L225             Difference]: With dead ends: 7108
[2025-03-03 11:01:28,858 INFO  L226             Difference]: Without dead ends: 4409
[2025-03-03 11:01:28,861 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 11:01:28,862 INFO  L435           NwaCegarLoop]: 726 mSDtfsCounter, 496 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 1136 mSolverCounterSat, 306 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 784 SdHoareTripleChecker+Invalid, 1442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 306 IncrementalHoareTripleChecker+Valid, 1136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time
[2025-03-03 11:01:28,862 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 784 Invalid, 1442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [306 Valid, 1136 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time]
[2025-03-03 11:01:28,865 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 4409 states.
[2025-03-03 11:01:28,901 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 4409 to 4409.
[2025-03-03 11:01:28,905 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 4409 states, 4408 states have (on average 1.1705989110707804) internal successors, (5160), 4408 states have internal predecessors, (5160), 0 states have call successors, (0), 0 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 11:01:28,911 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4409 states to 4409 states and 5160 transitions.
[2025-03-03 11:01:28,911 INFO  L78                 Accepts]: Start accepts. Automaton has 4409 states and 5160 transitions. Word has length 192
[2025-03-03 11:01:28,911 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 11:01:28,911 INFO  L471      AbstractCegarLoop]: Abstraction has 4409 states and 5160 transitions.
[2025-03-03 11:01:28,912 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 0 states have call successors, (0), 0 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 11:01:28,912 INFO  L276                IsEmpty]: Start isEmpty. Operand 4409 states and 5160 transitions.
[2025-03-03 11:01:28,913 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 195
[2025-03-03 11:01:28,913 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 11:01:28,913 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-03-03 11:01:28,913 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-03-03 11:01:28,913 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 11:01:28,914 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 11:01:28,914 INFO  L85        PathProgramCache]: Analyzing trace with hash 1764381387, now seen corresponding path program 1 times
[2025-03-03 11:01:28,914 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 11:01:28,914 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416433420]
[2025-03-03 11:01:28,914 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 11:01:28,914 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 11:01:28,927 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes.
[2025-03-03 11:01:28,939 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements.
[2025-03-03 11:01:28,939 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 11:01:28,940 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 11:01:29,005 INFO  L134       CoverageAnalysis]: Checked inductivity of 145 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked.
[2025-03-03 11:01:29,005 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 11:01:29,005 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416433420]
[2025-03-03 11:01:29,005 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416433420] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 11:01:29,005 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 11:01:29,005 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 11:01:29,006 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321422875]
[2025-03-03 11:01:29,006 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 11:01:29,006 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 11:01:29,006 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 11:01:29,006 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 11:01:29,006 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 11:01:29,007 INFO  L87              Difference]: Start difference. First operand 4409 states and 5160 transitions. Second operand  has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 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 11:01:30,269 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 11:01:30,269 INFO  L93              Difference]: Finished difference Result 10936 states and 12970 transitions.
[2025-03-03 11:01:30,269 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 11:01:30,269 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 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 11:01:30,270 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 11:01:30,284 INFO  L225             Difference]: With dead ends: 10936
[2025-03-03 11:01:30,284 INFO  L226             Difference]: Without dead ends: 6528
[2025-03-03 11:01:30,289 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 11:01:30,290 INFO  L435           NwaCegarLoop]: 383 mSDtfsCounter, 411 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1215 mSolverCounterSat, 274 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 411 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 1489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 274 IncrementalHoareTripleChecker+Valid, 1215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time
[2025-03-03 11:01:30,290 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [411 Valid, 445 Invalid, 1489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [274 Valid, 1215 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time]
[2025-03-03 11:01:30,296 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 6528 states.
[2025-03-03 11:01:30,340 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 6528 to 4382.
[2025-03-03 11:01:30,344 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 4382 states, 4381 states have (on average 1.1684546907098836) internal successors, (5119), 4381 states have internal predecessors, (5119), 0 states have call successors, (0), 0 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 11:01:30,350 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4382 states to 4382 states and 5119 transitions.
[2025-03-03 11:01:30,350 INFO  L78                 Accepts]: Start accepts. Automaton has 4382 states and 5119 transitions. Word has length 194
[2025-03-03 11:01:30,350 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 11:01:30,350 INFO  L471      AbstractCegarLoop]: Abstraction has 4382 states and 5119 transitions.
[2025-03-03 11:01:30,350 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 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 11:01:30,351 INFO  L276                IsEmpty]: Start isEmpty. Operand 4382 states and 5119 transitions.
[2025-03-03 11:01:30,353 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 261
[2025-03-03 11:01:30,353 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 11:01:30,354 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-03-03 11:01:30,354 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-03-03 11:01:30,354 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 11:01:30,354 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 11:01:30,354 INFO  L85        PathProgramCache]: Analyzing trace with hash -146938669, now seen corresponding path program 1 times
[2025-03-03 11:01:30,354 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 11:01:30,355 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691485410]
[2025-03-03 11:01:30,355 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 11:01:30,355 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 11:01:30,373 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 260 statements into 1 equivalence classes.
[2025-03-03 11:01:30,391 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 260 of 260 statements.
[2025-03-03 11:01:30,392 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 11:01:30,393 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 11:01:30,705 INFO  L134       CoverageAnalysis]: Checked inductivity of 157 backedges. 75 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 11:01:30,706 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 11:01:30,706 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691485410]
[2025-03-03 11:01:30,706 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691485410] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 11:01:30,706 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [548171514]
[2025-03-03 11:01:30,706 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 11:01:30,707 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 11:01:30,707 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 11:01:30,710 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 11:01:30,711 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 11:01:30,756 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 260 statements into 1 equivalence classes.
[2025-03-03 11:01:30,806 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 260 of 260 statements.
[2025-03-03 11:01:30,806 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 11:01:30,806 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 11:01:30,809 INFO  L256         TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 4 conjuncts are in the unsatisfiable core
[2025-03-03 11:01:30,816 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 11:01:31,084 INFO  L134       CoverageAnalysis]: Checked inductivity of 157 backedges. 75 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 11:01:31,085 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-03 11:01:31,384 INFO  L134       CoverageAnalysis]: Checked inductivity of 157 backedges. 157 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 11:01:31,385 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [548171514] provided 1 perfect and 1 imperfect interpolant sequences
[2025-03-03 11:01:31,385 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences.
[2025-03-03 11:01:31,385 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5
[2025-03-03 11:01:31,385 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275246438]
[2025-03-03 11:01:31,385 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 11:01:31,385 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-03 11:01:31,385 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 11:01:31,386 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-03 11:01:31,386 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-03-03 11:01:31,386 INFO  L87              Difference]: Start difference. First operand 4382 states and 5119 transitions. Second operand  has 4 states, 4 states have (on average 65.0) internal successors, (260), 3 states have internal predecessors, (260), 0 states have call successors, (0), 0 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 11:01:33,644 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 11:01:33,644 INFO  L93              Difference]: Finished difference Result 15171 states and 17882 transitions.
[2025-03-03 11:01:33,644 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 11:01:33,645 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 65.0) internal successors, (260), 3 states have internal predecessors, (260), 0 states have call successors, (0), 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 260
[2025-03-03 11:01:33,645 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 11:01:33,665 INFO  L225             Difference]: With dead ends: 15171
[2025-03-03 11:01:33,665 INFO  L226             Difference]: Without dead ends: 10791
[2025-03-03 11:01:33,668 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 521 GetRequests, 517 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-03-03 11:01:33,668 INFO  L435           NwaCegarLoop]: 83 mSDtfsCounter, 980 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 2171 mSolverCounterSat, 1021 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 980 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 3192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1021 IncrementalHoareTripleChecker+Valid, 2171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time
[2025-03-03 11:01:33,668 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [980 Valid, 144 Invalid, 3192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1021 Valid, 2171 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time]
[2025-03-03 11:01:33,675 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 10791 states.
[2025-03-03 11:01:33,769 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 10791 to 10789.
[2025-03-03 11:01:33,783 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 10789 states, 10788 states have (on average 1.1710233592880979) internal successors, (12633), 10788 states have internal predecessors, (12633), 0 states have call successors, (0), 0 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 11:01:33,796 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10789 states to 10789 states and 12633 transitions.
[2025-03-03 11:01:33,796 INFO  L78                 Accepts]: Start accepts. Automaton has 10789 states and 12633 transitions. Word has length 260
[2025-03-03 11:01:33,796 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 11:01:33,796 INFO  L471      AbstractCegarLoop]: Abstraction has 10789 states and 12633 transitions.
[2025-03-03 11:01:33,797 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 65.0) internal successors, (260), 3 states have internal predecessors, (260), 0 states have call successors, (0), 0 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 11:01:33,797 INFO  L276                IsEmpty]: Start isEmpty. Operand 10789 states and 12633 transitions.
[2025-03-03 11:01:33,799 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 273
[2025-03-03 11:01:33,799 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 11:01:33,800 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 11:01:33,806 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 11:01:34,004 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5
[2025-03-03 11:01:34,004 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 11:01:34,004 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 11:01:34,005 INFO  L85        PathProgramCache]: Analyzing trace with hash 1183904302, now seen corresponding path program 1 times
[2025-03-03 11:01:34,005 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 11:01:34,005 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634539388]
[2025-03-03 11:01:34,005 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 11:01:34,005 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 11:01:34,026 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes.
[2025-03-03 11:01:34,042 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements.
[2025-03-03 11:01:34,042 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 11:01:34,042 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 11:01:34,157 INFO  L134       CoverageAnalysis]: Checked inductivity of 327 backedges. 208 proven. 0 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked.
[2025-03-03 11:01:34,157 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 11:01:34,157 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634539388]
[2025-03-03 11:01:34,157 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634539388] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 11:01:34,157 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 11:01:34,157 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 11:01:34,157 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650308539]
[2025-03-03 11:01:34,157 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 11:01:34,158 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 11:01:34,158 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 11:01:34,158 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 11:01:34,158 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 11:01:34,158 INFO  L87              Difference]: Start difference. First operand 10789 states and 12633 transitions. Second operand  has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 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 11:01:35,474 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 11:01:35,475 INFO  L93              Difference]: Finished difference Result 23703 states and 27793 transitions.
[2025-03-03 11:01:35,475 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 11:01:35,475 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 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 272
[2025-03-03 11:01:35,476 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 11:01:35,495 INFO  L225             Difference]: With dead ends: 23703
[2025-03-03 11:01:35,495 INFO  L226             Difference]: Without dead ends: 12491
[2025-03-03 11:01:35,503 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 11:01:35,504 INFO  L435           NwaCegarLoop]: 773 mSDtfsCounter, 383 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 1194 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 842 SdHoareTripleChecker+Invalid, 1400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 1194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time
[2025-03-03 11:01:35,504 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [383 Valid, 842 Invalid, 1400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 1194 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time]
[2025-03-03 11:01:35,511 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 12491 states.
[2025-03-03 11:01:35,592 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 12491 to 12491.
[2025-03-03 11:01:35,609 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 12491 states, 12490 states have (on average 1.1501200960768614) internal successors, (14365), 12490 states have internal predecessors, (14365), 0 states have call successors, (0), 0 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 11:01:35,623 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 12491 states to 12491 states and 14365 transitions.
[2025-03-03 11:01:35,623 INFO  L78                 Accepts]: Start accepts. Automaton has 12491 states and 14365 transitions. Word has length 272
[2025-03-03 11:01:35,623 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 11:01:35,624 INFO  L471      AbstractCegarLoop]: Abstraction has 12491 states and 14365 transitions.
[2025-03-03 11:01:35,628 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 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 11:01:35,628 INFO  L276                IsEmpty]: Start isEmpty. Operand 12491 states and 14365 transitions.
[2025-03-03 11:01:35,631 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 313
[2025-03-03 11:01:35,632 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 11:01:35,632 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 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 11:01:35,632 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-03-03 11:01:35,632 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 11:01:35,632 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 11:01:35,632 INFO  L85        PathProgramCache]: Analyzing trace with hash -276502895, now seen corresponding path program 1 times
[2025-03-03 11:01:35,633 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 11:01:35,633 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900034736]
[2025-03-03 11:01:35,633 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 11:01:35,633 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 11:01:35,653 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 312 statements into 1 equivalence classes.
[2025-03-03 11:01:35,673 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 312 of 312 statements.
[2025-03-03 11:01:35,673 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 11:01:35,673 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 11:01:35,868 INFO  L134       CoverageAnalysis]: Checked inductivity of 361 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked.
[2025-03-03 11:01:35,869 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 11:01:35,869 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900034736]
[2025-03-03 11:01:35,869 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900034736] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 11:01:35,869 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 11:01:35,869 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 11:01:35,869 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582557180]
[2025-03-03 11:01:35,869 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 11:01:35,869 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 11:01:35,870 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 11:01:35,870 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 11:01:35,870 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 11:01:35,871 INFO  L87              Difference]: Start difference. First operand 12491 states and 14365 transitions. Second operand  has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 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 11:01:37,484 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 11:01:37,485 INFO  L93              Difference]: Finished difference Result 34380 states and 39414 transitions.
[2025-03-03 11:01:37,486 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 11:01:37,486 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 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 312
[2025-03-03 11:01:37,486 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 11:01:37,519 INFO  L225             Difference]: With dead ends: 34380
[2025-03-03 11:01:37,519 INFO  L226             Difference]: Without dead ends: 21459
[2025-03-03 11:01:37,533 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 11:01:37,533 INFO  L435           NwaCegarLoop]: 267 mSDtfsCounter, 465 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 1345 mSolverCounterSat, 231 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 465 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 1576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 231 IncrementalHoareTripleChecker+Valid, 1345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time
[2025-03-03 11:01:37,534 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [465 Valid, 321 Invalid, 1576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [231 Valid, 1345 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time]
[2025-03-03 11:01:37,553 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 21459 states.
[2025-03-03 11:01:37,694 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 21459 to 20587.
[2025-03-03 11:01:37,714 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 20587 states, 20586 states have (on average 1.130477023219664) internal successors, (23272), 20586 states have internal predecessors, (23272), 0 states have call successors, (0), 0 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 11:01:37,734 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 20587 states to 20587 states and 23272 transitions.
[2025-03-03 11:01:37,735 INFO  L78                 Accepts]: Start accepts. Automaton has 20587 states and 23272 transitions. Word has length 312
[2025-03-03 11:01:37,736 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 11:01:37,736 INFO  L471      AbstractCegarLoop]: Abstraction has 20587 states and 23272 transitions.
[2025-03-03 11:01:37,736 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 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 11:01:37,737 INFO  L276                IsEmpty]: Start isEmpty. Operand 20587 states and 23272 transitions.
[2025-03-03 11:01:37,741 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 335
[2025-03-03 11:01:37,741 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 11:01:37,741 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:01:37,741 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-03-03 11:01:37,742 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 11:01:37,742 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 11:01:37,742 INFO  L85        PathProgramCache]: Analyzing trace with hash 1201827189, now seen corresponding path program 1 times
[2025-03-03 11:01:37,742 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 11:01:37,742 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805276491]
[2025-03-03 11:01:37,742 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 11:01:37,742 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 11:01:37,770 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 334 statements into 1 equivalence classes.
[2025-03-03 11:01:37,872 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 334 of 334 statements.
[2025-03-03 11:01:37,873 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 11:01:37,873 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 11:01:38,030 INFO  L134       CoverageAnalysis]: Checked inductivity of 342 backedges. 269 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked.
[2025-03-03 11:01:38,031 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 11:01:38,031 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805276491]
[2025-03-03 11:01:38,031 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805276491] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 11:01:38,031 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 11:01:38,031 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 11:01:38,031 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449959647]
[2025-03-03 11:01:38,031 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 11:01:38,032 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 11:01:38,032 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 11:01:38,032 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 11:01:38,032 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 11:01:38,032 INFO  L87              Difference]: Start difference. First operand 20587 states and 23272 transitions. Second operand  has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 0 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 11:01:39,430 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 11:01:39,431 INFO  L93              Difference]: Finished difference Result 48853 states and 55183 transitions.
[2025-03-03 11:01:39,431 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 11:01:39,431 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 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 334
[2025-03-03 11:01:39,431 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 11:01:39,471 INFO  L225             Difference]: With dead ends: 48853
[2025-03-03 11:01:39,471 INFO  L226             Difference]: Without dead ends: 28268
[2025-03-03 11:01:39,490 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 11:01:39,491 INFO  L435           NwaCegarLoop]: 796 mSDtfsCounter, 325 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 1371 mSolverCounterSat, 161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 854 SdHoareTripleChecker+Invalid, 1532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 1371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time
[2025-03-03 11:01:39,492 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 854 Invalid, 1532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 1371 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time]
[2025-03-03 11:01:39,514 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 28268 states.
[2025-03-03 11:01:39,819 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 28268 to 26547.
[2025-03-03 11:01:39,839 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 26547 states, 26546 states have (on average 1.1210728546673698) internal successors, (29760), 26546 states have internal predecessors, (29760), 0 states have call successors, (0), 0 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 11:01:39,864 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 26547 states to 26547 states and 29760 transitions.
[2025-03-03 11:01:39,865 INFO  L78                 Accepts]: Start accepts. Automaton has 26547 states and 29760 transitions. Word has length 334
[2025-03-03 11:01:39,865 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 11:01:39,865 INFO  L471      AbstractCegarLoop]: Abstraction has 26547 states and 29760 transitions.
[2025-03-03 11:01:39,865 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 0 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 11:01:39,865 INFO  L276                IsEmpty]: Start isEmpty. Operand 26547 states and 29760 transitions.
[2025-03-03 11:01:39,870 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 340
[2025-03-03 11:01:39,870 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 11:01:39,870 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:01:39,870 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-03-03 11:01:39,870 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 11:01:39,872 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 11:01:39,872 INFO  L85        PathProgramCache]: Analyzing trace with hash -1299763519, now seen corresponding path program 1 times
[2025-03-03 11:01:39,872 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 11:01:39,872 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172702220]
[2025-03-03 11:01:39,872 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 11:01:39,872 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 11:01:39,897 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 339 statements into 1 equivalence classes.
[2025-03-03 11:01:39,918 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 339 of 339 statements.
[2025-03-03 11:01:39,919 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 11:01:39,919 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 11:01:40,081 INFO  L134       CoverageAnalysis]: Checked inductivity of 352 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked.
[2025-03-03 11:01:40,082 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 11:01:40,082 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172702220]
[2025-03-03 11:01:40,082 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172702220] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 11:01:40,082 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 11:01:40,082 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 11:01:40,082 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226517834]
[2025-03-03 11:01:40,082 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 11:01:40,083 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 11:01:40,083 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 11:01:40,084 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 11:01:40,084 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 11:01:40,084 INFO  L87              Difference]: Start difference. First operand 26547 states and 29760 transitions. Second operand  has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 0 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 11:01:41,276 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 11:01:41,277 INFO  L93              Difference]: Finished difference Result 56941 states and 64030 transitions.
[2025-03-03 11:01:41,277 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 11:01:41,277 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 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 339
[2025-03-03 11:01:41,277 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 11:01:41,310 INFO  L225             Difference]: With dead ends: 56941
[2025-03-03 11:01:41,310 INFO  L226             Difference]: Without dead ends: 29965
[2025-03-03 11:01:41,328 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 11:01:41,328 INFO  L435           NwaCegarLoop]: 735 mSDtfsCounter, 441 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 1254 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 800 SdHoareTripleChecker+Invalid, 1405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 1254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time
[2025-03-03 11:01:41,329 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [441 Valid, 800 Invalid, 1405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 1254 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2025-03-03 11:01:41,348 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 29965 states.
[2025-03-03 11:01:41,616 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 29965 to 29960.
[2025-03-03 11:01:41,637 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 29960 states, 29959 states have (on average 1.1189959611469007) internal successors, (33524), 29959 states have internal predecessors, (33524), 0 states have call successors, (0), 0 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 11:01:41,664 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 29960 states to 29960 states and 33524 transitions.
[2025-03-03 11:01:41,665 INFO  L78                 Accepts]: Start accepts. Automaton has 29960 states and 33524 transitions. Word has length 339
[2025-03-03 11:01:41,665 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 11:01:41,665 INFO  L471      AbstractCegarLoop]: Abstraction has 29960 states and 33524 transitions.
[2025-03-03 11:01:41,665 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 0 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 11:01:41,665 INFO  L276                IsEmpty]: Start isEmpty. Operand 29960 states and 33524 transitions.
[2025-03-03 11:01:41,670 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 384
[2025-03-03 11:01:41,671 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 11:01:41,671 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:01:41,671 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-03-03 11:01:41,671 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 11:01:41,672 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 11:01:41,672 INFO  L85        PathProgramCache]: Analyzing trace with hash 1121473997, now seen corresponding path program 1 times
[2025-03-03 11:01:41,672 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 11:01:41,672 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669669819]
[2025-03-03 11:01:41,672 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 11:01:41,672 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 11:01:41,695 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 383 statements into 1 equivalence classes.
[2025-03-03 11:01:41,711 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 383 of 383 statements.
[2025-03-03 11:01:41,711 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 11:01:41,711 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 11:01:41,838 INFO  L134       CoverageAnalysis]: Checked inductivity of 382 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked.
[2025-03-03 11:01:41,838 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 11:01:41,838 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669669819]
[2025-03-03 11:01:41,838 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669669819] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 11:01:41,838 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 11:01:41,838 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 11:01:41,838 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624472896]
[2025-03-03 11:01:41,838 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 11:01:41,838 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 11:01:41,838 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 11:01:41,839 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 11:01:41,839 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 11:01:41,839 INFO  L87              Difference]: Start difference. First operand 29960 states and 33524 transitions. Second operand  has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 11:01:43,419 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 11:01:43,419 INFO  L93              Difference]: Finished difference Result 64174 states and 71908 transitions.
[2025-03-03 11:01:43,419 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 11:01:43,420 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 383
[2025-03-03 11:01:43,420 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 11:01:43,483 INFO  L225             Difference]: With dead ends: 64174
[2025-03-03 11:01:43,486 INFO  L226             Difference]: Without dead ends: 33791
[2025-03-03 11:01:43,525 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 11:01:43,525 INFO  L435           NwaCegarLoop]: 792 mSDtfsCounter, 401 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 1193 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 401 SdHoareTripleChecker+Valid, 863 SdHoareTripleChecker+Invalid, 1286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 1193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time
[2025-03-03 11:01:43,526 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [401 Valid, 863 Invalid, 1286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 1193 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time]
[2025-03-03 11:01:43,564 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 33791 states.
[2025-03-03 11:01:43,831 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 33791 to 33789.
[2025-03-03 11:01:43,854 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 33789 states, 33788 states have (on average 1.1113709009115662) internal successors, (37551), 33788 states have internal predecessors, (37551), 0 states have call successors, (0), 0 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 11:01:43,895 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 33789 states to 33789 states and 37551 transitions.
[2025-03-03 11:01:43,895 INFO  L78                 Accepts]: Start accepts. Automaton has 33789 states and 37551 transitions. Word has length 383
[2025-03-03 11:01:43,895 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 11:01:43,895 INFO  L471      AbstractCegarLoop]: Abstraction has 33789 states and 37551 transitions.
[2025-03-03 11:01:43,896 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 11:01:43,896 INFO  L276                IsEmpty]: Start isEmpty. Operand 33789 states and 37551 transitions.
[2025-03-03 11:01:43,903 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 404
[2025-03-03 11:01:43,904 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 11:01:43,904 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:01:43,904 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-03-03 11:01:43,904 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 11:01:43,904 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 11:01:43,905 INFO  L85        PathProgramCache]: Analyzing trace with hash -1657107864, now seen corresponding path program 1 times
[2025-03-03 11:01:43,905 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 11:01:43,905 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728217995]
[2025-03-03 11:01:43,905 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 11:01:43,905 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 11:01:43,942 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 403 statements into 1 equivalence classes.
[2025-03-03 11:01:43,966 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 403 of 403 statements.
[2025-03-03 11:01:43,967 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 11:01:43,967 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 11:01:44,118 INFO  L134       CoverageAnalysis]: Checked inductivity of 342 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 229 trivial. 0 not checked.
[2025-03-03 11:01:44,118 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 11:01:44,119 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728217995]
[2025-03-03 11:01:44,119 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728217995] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 11:01:44,119 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 11:01:44,119 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 11:01:44,119 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967935899]
[2025-03-03 11:01:44,119 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 11:01:44,119 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 11:01:44,119 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 11:01:44,120 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 11:01:44,120 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 11:01:44,120 INFO  L87              Difference]: Start difference. First operand 33789 states and 37551 transitions. Second operand  has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 0 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 11:01:45,475 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 11:01:45,475 INFO  L93              Difference]: Finished difference Result 76973 states and 85473 transitions.
[2025-03-03 11:01:45,476 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 11:01:45,476 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 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 403
[2025-03-03 11:01:45,476 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 11:01:45,520 INFO  L225             Difference]: With dead ends: 76973
[2025-03-03 11:01:45,520 INFO  L226             Difference]: Without dead ends: 42751
[2025-03-03 11:01:45,541 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 11:01:45,542 INFO  L435           NwaCegarLoop]: 127 mSDtfsCounter, 492 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 1242 mSolverCounterSat, 320 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 492 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 1562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 320 IncrementalHoareTripleChecker+Valid, 1242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time
[2025-03-03 11:01:45,542 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [492 Valid, 165 Invalid, 1562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [320 Valid, 1242 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time]
[2025-03-03 11:01:45,570 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 42751 states.
[2025-03-03 11:01:45,836 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 42751 to 41451.
[2025-03-03 11:01:45,861 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 41451 states, 41450 states have (on average 1.1109047044632088) internal successors, (46047), 41450 states have internal predecessors, (46047), 0 states have call successors, (0), 0 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 11:01:45,898 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 41451 states to 41451 states and 46047 transitions.
[2025-03-03 11:01:45,898 INFO  L78                 Accepts]: Start accepts. Automaton has 41451 states and 46047 transitions. Word has length 403
[2025-03-03 11:01:45,899 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 11:01:45,899 INFO  L471      AbstractCegarLoop]: Abstraction has 41451 states and 46047 transitions.
[2025-03-03 11:01:45,899 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 0 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 11:01:45,899 INFO  L276                IsEmpty]: Start isEmpty. Operand 41451 states and 46047 transitions.
[2025-03-03 11:01:45,907 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 476
[2025-03-03 11:01:45,907 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 11:01:45,907 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:01:45,908 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2025-03-03 11:01:45,908 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 11:01:45,908 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 11:01:45,908 INFO  L85        PathProgramCache]: Analyzing trace with hash 515317902, now seen corresponding path program 1 times
[2025-03-03 11:01:45,908 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 11:01:45,908 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195305783]
[2025-03-03 11:01:45,908 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 11:01:45,908 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 11:01:45,937 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 475 statements into 1 equivalence classes.
[2025-03-03 11:01:45,957 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 475 of 475 statements.
[2025-03-03 11:01:45,957 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 11:01:45,957 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 11:01:46,191 INFO  L134       CoverageAnalysis]: Checked inductivity of 382 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked.
[2025-03-03 11:01:46,191 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 11:01:46,191 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195305783]
[2025-03-03 11:01:46,191 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195305783] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 11:01:46,191 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 11:01:46,192 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 11:01:46,192 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585410213]
[2025-03-03 11:01:46,192 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 11:01:46,192 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 11:01:46,192 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 11:01:46,193 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 11:01:46,193 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 11:01:46,193 INFO  L87              Difference]: Start difference. First operand 41451 states and 46047 transitions. Second operand  has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 0 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 11:01:47,630 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 11:01:47,630 INFO  L93              Difference]: Finished difference Result 90146 states and 100105 transitions.
[2025-03-03 11:01:47,631 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 11:01:47,632 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 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 475
[2025-03-03 11:01:47,632 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 11:01:47,678 INFO  L225             Difference]: With dead ends: 90146
[2025-03-03 11:01:47,678 INFO  L226             Difference]: Without dead ends: 48269
[2025-03-03 11:01:47,703 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 11:01:47,704 INFO  L435           NwaCegarLoop]: 127 mSDtfsCounter, 488 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 1208 mSolverCounterSat, 329 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 488 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 1537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 329 IncrementalHoareTripleChecker+Valid, 1208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time
[2025-03-03 11:01:47,704 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [488 Valid, 156 Invalid, 1537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [329 Valid, 1208 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time]
[2025-03-03 11:01:47,737 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 48269 states.
[2025-03-03 11:01:47,977 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 48269 to 41005.
[2025-03-03 11:01:48,006 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 41005 states, 41004 states have (on average 1.1108916203297239) internal successors, (45551), 41004 states have internal predecessors, (45551), 0 states have call successors, (0), 0 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 11:01:48,042 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 41005 states to 41005 states and 45551 transitions.
[2025-03-03 11:01:48,043 INFO  L78                 Accepts]: Start accepts. Automaton has 41005 states and 45551 transitions. Word has length 475
[2025-03-03 11:01:48,043 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 11:01:48,043 INFO  L471      AbstractCegarLoop]: Abstraction has 41005 states and 45551 transitions.
[2025-03-03 11:01:48,043 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 0 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 11:01:48,043 INFO  L276                IsEmpty]: Start isEmpty. Operand 41005 states and 45551 transitions.
[2025-03-03 11:01:48,054 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 561
[2025-03-03 11:01:48,055 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 11:01:48,055 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-03-03 11:01:48,055 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2025-03-03 11:01:48,055 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 11:01:48,055 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 11:01:48,055 INFO  L85        PathProgramCache]: Analyzing trace with hash -461291878, now seen corresponding path program 1 times
[2025-03-03 11:01:48,056 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 11:01:48,056 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042446372]
[2025-03-03 11:01:48,056 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 11:01:48,056 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 11:01:48,089 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 560 statements into 1 equivalence classes.
[2025-03-03 11:01:48,108 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 560 of 560 statements.
[2025-03-03 11:01:48,108 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 11:01:48,108 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 11:01:48,271 INFO  L134       CoverageAnalysis]: Checked inductivity of 674 backedges. 391 proven. 0 refuted. 0 times theorem prover too weak. 283 trivial. 0 not checked.
[2025-03-03 11:01:48,271 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 11:01:48,271 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042446372]
[2025-03-03 11:01:48,271 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042446372] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 11:01:48,271 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 11:01:48,272 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 11:01:48,272 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704092725]
[2025-03-03 11:01:48,272 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 11:01:48,273 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 11:01:48,273 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 11:01:48,273 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 11:01:48,273 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 11:01:48,273 INFO  L87              Difference]: Start difference. First operand 41005 states and 45551 transitions. Second operand  has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 0 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 11:01:49,524 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 11:01:49,524 INFO  L93              Difference]: Finished difference Result 93910 states and 104403 transitions.
[2025-03-03 11:01:49,524 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 11:01:49,525 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 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 560
[2025-03-03 11:01:49,525 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 11:01:49,575 INFO  L225             Difference]: With dead ends: 93910
[2025-03-03 11:01:49,576 INFO  L226             Difference]: Without dead ends: 49070
[2025-03-03 11:01:49,601 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 11:01:49,601 INFO  L435           NwaCegarLoop]: 683 mSDtfsCounter, 485 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 1173 mSolverCounterSat, 240 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 485 SdHoareTripleChecker+Valid, 730 SdHoareTripleChecker+Invalid, 1413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 240 IncrementalHoareTripleChecker+Valid, 1173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time
[2025-03-03 11:01:49,602 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [485 Valid, 730 Invalid, 1413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [240 Valid, 1173 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2025-03-03 11:01:49,627 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 49070 states.
[2025-03-03 11:01:49,898 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 49070 to 49061.
[2025-03-03 11:01:49,928 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 49061 states, 49060 states have (on average 1.098960456583775) internal successors, (53915), 49060 states have internal predecessors, (53915), 0 states have call successors, (0), 0 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 11:01:49,969 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 49061 states to 49061 states and 53915 transitions.
[2025-03-03 11:01:49,970 INFO  L78                 Accepts]: Start accepts. Automaton has 49061 states and 53915 transitions. Word has length 560
[2025-03-03 11:01:49,970 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 11:01:49,970 INFO  L471      AbstractCegarLoop]: Abstraction has 49061 states and 53915 transitions.
[2025-03-03 11:01:49,970 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 0 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 11:01:49,970 INFO  L276                IsEmpty]: Start isEmpty. Operand 49061 states and 53915 transitions.
[2025-03-03 11:01:49,993 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 698
[2025-03-03 11:01:49,993 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 11:01:49,993 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:01:49,993 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2025-03-03 11:01:49,993 INFO  L396      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 11:01:49,994 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 11:01:49,994 INFO  L85        PathProgramCache]: Analyzing trace with hash -489728679, now seen corresponding path program 1 times
[2025-03-03 11:01:49,994 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 11:01:49,994 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529577540]
[2025-03-03 11:01:49,994 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 11:01:49,994 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 11:01:50,110 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 697 statements into 1 equivalence classes.
[2025-03-03 11:01:50,152 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 697 of 697 statements.
[2025-03-03 11:01:50,152 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 11:01:50,152 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 11:01:50,377 INFO  L134       CoverageAnalysis]: Checked inductivity of 721 backedges. 414 proven. 0 refuted. 0 times theorem prover too weak. 307 trivial. 0 not checked.
[2025-03-03 11:01:50,378 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 11:01:50,378 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529577540]
[2025-03-03 11:01:50,378 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529577540] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 11:01:50,378 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 11:01:50,378 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 11:01:50,378 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298801094]
[2025-03-03 11:01:50,378 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 11:01:50,379 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 11:01:50,379 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 11:01:50,380 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 11:01:50,380 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 11:01:50,380 INFO  L87              Difference]: Start difference. First operand 49061 states and 53915 transitions. Second operand  has 3 states, 3 states have (on average 158.33333333333334) internal successors, (475), 3 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 11:01:51,716 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 11:01:51,716 INFO  L93              Difference]: Finished difference Result 107897 states and 118799 transitions.
[2025-03-03 11:01:51,716 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 11:01:51,716 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 158.33333333333334) internal successors, (475), 3 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 697
[2025-03-03 11:01:51,717 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 11:01:51,770 INFO  L225             Difference]: With dead ends: 107897
[2025-03-03 11:01:51,770 INFO  L226             Difference]: Without dead ends: 58413
[2025-03-03 11:01:51,799 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 11:01:51,800 INFO  L435           NwaCegarLoop]: 316 mSDtfsCounter, 440 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 1182 mSolverCounterSat, 178 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 440 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 1360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 178 IncrementalHoareTripleChecker+Valid, 1182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time
[2025-03-03 11:01:51,800 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [440 Valid, 372 Invalid, 1360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [178 Valid, 1182 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2025-03-03 11:01:51,829 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 58413 states.
[2025-03-03 11:01:52,185 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 58413 to 53305.
[2025-03-03 11:01:52,226 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 53305 states, 53304 states have (on average 1.0955087798289058) internal successors, (58395), 53304 states have internal predecessors, (58395), 0 states have call successors, (0), 0 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 11:01:52,276 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 53305 states to 53305 states and 58395 transitions.
[2025-03-03 11:01:52,277 INFO  L78                 Accepts]: Start accepts. Automaton has 53305 states and 58395 transitions. Word has length 697
[2025-03-03 11:01:52,277 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 11:01:52,277 INFO  L471      AbstractCegarLoop]: Abstraction has 53305 states and 58395 transitions.
[2025-03-03 11:01:52,277 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 158.33333333333334) internal successors, (475), 3 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 11:01:52,278 INFO  L276                IsEmpty]: Start isEmpty. Operand 53305 states and 58395 transitions.
[2025-03-03 11:01:52,298 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 701
[2025-03-03 11:01:52,299 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 11:01:52,299 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:01:52,299 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2025-03-03 11:01:52,299 INFO  L396      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 11:01:52,299 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 11:01:52,300 INFO  L85        PathProgramCache]: Analyzing trace with hash 661300580, now seen corresponding path program 1 times
[2025-03-03 11:01:52,300 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 11:01:52,300 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503489860]
[2025-03-03 11:01:52,300 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 11:01:52,300 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 11:01:52,422 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 700 statements into 1 equivalence classes.
[2025-03-03 11:01:52,450 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 700 of 700 statements.
[2025-03-03 11:01:52,450 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 11:01:52,450 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 11:01:52,624 INFO  L134       CoverageAnalysis]: Checked inductivity of 768 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 617 trivial. 0 not checked.
[2025-03-03 11:01:52,624 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 11:01:52,624 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503489860]
[2025-03-03 11:01:52,624 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503489860] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 11:01:52,624 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 11:01:52,624 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 11:01:52,624 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914817691]
[2025-03-03 11:01:52,625 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 11:01:52,625 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 11:01:52,625 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 11:01:52,625 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 11:01:52,625 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 11:01:52,625 INFO  L87              Difference]: Start difference. First operand 53305 states and 58395 transitions. Second operand  has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 0 states have call successors, (0), 0 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 11:01:54,032 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 11:01:54,032 INFO  L93              Difference]: Finished difference Result 111691 states and 122312 transitions.
[2025-03-03 11:01:54,033 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 11:01:54,033 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 0 states have call successors, (0), 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 700
[2025-03-03 11:01:54,033 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 11:01:54,094 INFO  L225             Difference]: With dead ends: 111691
[2025-03-03 11:01:54,094 INFO  L226             Difference]: Without dead ends: 56260
[2025-03-03 11:01:54,123 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 11:01:54,124 INFO  L435           NwaCegarLoop]: 678 mSDtfsCounter, 456 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 1096 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 722 SdHoareTripleChecker+Invalid, 1294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 1096 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time
[2025-03-03 11:01:54,124 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [456 Valid, 722 Invalid, 1294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 1096 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2025-03-03 11:01:54,160 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 56260 states.
[2025-03-03 11:01:54,513 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 56260 to 53281.
[2025-03-03 11:01:54,547 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 53281 states, 53280 states have (on average 1.0747935435435436) internal successors, (57265), 53280 states have internal predecessors, (57265), 0 states have call successors, (0), 0 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 11:01:54,595 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 53281 states to 53281 states and 57265 transitions.
[2025-03-03 11:01:54,596 INFO  L78                 Accepts]: Start accepts. Automaton has 53281 states and 57265 transitions. Word has length 700
[2025-03-03 11:01:54,596 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 11:01:54,596 INFO  L471      AbstractCegarLoop]: Abstraction has 53281 states and 57265 transitions.
[2025-03-03 11:01:54,596 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 0 states have call successors, (0), 0 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 11:01:54,596 INFO  L276                IsEmpty]: Start isEmpty. Operand 53281 states and 57265 transitions.
[2025-03-03 11:01:54,710 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 734
[2025-03-03 11:01:54,710 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 11:01:54,710 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-03-03 11:01:54,710 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2025-03-03 11:01:54,710 INFO  L396      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 11:01:54,711 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 11:01:54,711 INFO  L85        PathProgramCache]: Analyzing trace with hash 634453437, now seen corresponding path program 1 times
[2025-03-03 11:01:54,711 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 11:01:54,711 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477999519]
[2025-03-03 11:01:54,711 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 11:01:54,711 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 11:01:54,755 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 733 statements into 1 equivalence classes.
[2025-03-03 11:01:54,781 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 733 of 733 statements.
[2025-03-03 11:01:54,781 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 11:01:54,781 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 11:01:54,993 INFO  L134       CoverageAnalysis]: Checked inductivity of 569 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 455 trivial. 0 not checked.
[2025-03-03 11:01:54,993 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 11:01:54,993 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477999519]
[2025-03-03 11:01:54,993 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477999519] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 11:01:54,993 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 11:01:54,994 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-03 11:01:54,994 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250075887]
[2025-03-03 11:01:54,994 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 11:01:54,994 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 11:01:54,994 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 11:01:54,995 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 11:01:54,995 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 11:01:54,996 INFO  L87              Difference]: Start difference. First operand 53281 states and 57265 transitions. Second operand  has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 2 states have internal predecessors, (362), 0 states have call successors, (0), 0 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 11:01:55,647 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 11:01:55,647 INFO  L93              Difference]: Finished difference Result 101860 states and 109486 transitions.
[2025-03-03 11:01:55,647 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 11:01:55,648 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 2 states have internal predecessors, (362), 0 states have call successors, (0), 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 733
[2025-03-03 11:01:55,648 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 11:01:55,690 INFO  L225             Difference]: With dead ends: 101860
[2025-03-03 11:01:55,690 INFO  L226             Difference]: Without dead ends: 48581
[2025-03-03 11:01:55,721 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 11:01:55,721 INFO  L435           NwaCegarLoop]: 70 mSDtfsCounter, 359 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 609 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-03 11:01:55,721 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 70 Invalid, 614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 609 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-03 11:01:55,753 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 48581 states.
[2025-03-03 11:01:56,064 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 48581 to 48579.
[2025-03-03 11:01:56,097 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 48579 states, 48578 states have (on average 1.0747869405903907) internal successors, (52211), 48578 states have internal predecessors, (52211), 0 states have call successors, (0), 0 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 11:01:56,138 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 48579 states to 48579 states and 52211 transitions.
[2025-03-03 11:01:56,139 INFO  L78                 Accepts]: Start accepts. Automaton has 48579 states and 52211 transitions. Word has length 733
[2025-03-03 11:01:56,140 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 11:01:56,140 INFO  L471      AbstractCegarLoop]: Abstraction has 48579 states and 52211 transitions.
[2025-03-03 11:01:56,140 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 2 states have internal predecessors, (362), 0 states have call successors, (0), 0 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 11:01:56,140 INFO  L276                IsEmpty]: Start isEmpty. Operand 48579 states and 52211 transitions.
[2025-03-03 11:01:56,179 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1397
[2025-03-03 11:01:56,179 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 11:01:56,180 INFO  L218           NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:01:56,180 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2025-03-03 11:01:56,180 INFO  L396      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 11:01:56,181 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 11:01:56,181 INFO  L85        PathProgramCache]: Analyzing trace with hash 1170524657, now seen corresponding path program 1 times
[2025-03-03 11:01:56,181 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 11:01:56,181 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862716332]
[2025-03-03 11:01:56,181 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 11:01:56,181 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 11:01:56,330 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1396 statements into 1 equivalence classes.
[2025-03-03 11:01:56,385 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1396 of 1396 statements.
[2025-03-03 11:01:56,385 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 11:01:56,385 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 11:01:56,959 INFO  L134       CoverageAnalysis]: Checked inductivity of 2477 backedges. 1829 proven. 0 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked.
[2025-03-03 11:01:56,960 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 11:01:56,960 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862716332]
[2025-03-03 11:01:56,960 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862716332] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 11:01:56,960 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 11:01:56,960 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 11:01:56,960 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220893400]
[2025-03-03 11:01:56,960 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 11:01:56,961 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 11:01:56,961 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 11:01:56,962 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 11:01:56,962 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 11:01:56,963 INFO  L87              Difference]: Start difference. First operand 48579 states and 52211 transitions. Second operand  has 3 states, 3 states have (on average 342.0) internal successors, (1026), 3 states have internal predecessors, (1026), 0 states have call successors, (0), 0 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 11:01:58,300 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 11:01:58,300 INFO  L93              Difference]: Finished difference Result 101428 states and 108970 transitions.
[2025-03-03 11:01:58,300 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 11:01:58,301 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 342.0) internal successors, (1026), 3 states have internal predecessors, (1026), 0 states have call successors, (0), 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 1396
[2025-03-03 11:01:58,301 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 11:01:58,363 INFO  L225             Difference]: With dead ends: 101428
[2025-03-03 11:01:58,363 INFO  L226             Difference]: Without dead ends: 52851
[2025-03-03 11:01:58,390 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 11:01:58,390 INFO  L435           NwaCegarLoop]: 647 mSDtfsCounter, 91 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 1221 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 682 SdHoareTripleChecker+Invalid, 1308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 1221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time
[2025-03-03 11:01:58,390 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 682 Invalid, 1308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 1221 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2025-03-03 11:01:58,422 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 52851 states.
[2025-03-03 11:01:58,922 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 52851 to 51133.
[2025-03-03 11:01:58,958 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 51133 states, 51132 states have (on average 1.0728702182586247) internal successors, (54858), 51132 states have internal predecessors, (54858), 0 states have call successors, (0), 0 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 11:01:59,007 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 51133 states to 51133 states and 54858 transitions.
[2025-03-03 11:01:59,008 INFO  L78                 Accepts]: Start accepts. Automaton has 51133 states and 54858 transitions. Word has length 1396
[2025-03-03 11:01:59,009 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 11:01:59,009 INFO  L471      AbstractCegarLoop]: Abstraction has 51133 states and 54858 transitions.
[2025-03-03 11:01:59,009 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 342.0) internal successors, (1026), 3 states have internal predecessors, (1026), 0 states have call successors, (0), 0 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 11:01:59,009 INFO  L276                IsEmpty]: Start isEmpty. Operand 51133 states and 54858 transitions.
[2025-03-03 11:01:59,051 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1434
[2025-03-03 11:01:59,051 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 11:01:59,052 INFO  L218           NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 11:01:59,052 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2025-03-03 11:01:59,052 INFO  L396      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 11:01:59,052 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 11:01:59,053 INFO  L85        PathProgramCache]: Analyzing trace with hash 651153648, now seen corresponding path program 1 times
[2025-03-03 11:01:59,053 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 11:01:59,053 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989983364]
[2025-03-03 11:01:59,053 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 11:01:59,053 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 11:01:59,134 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1433 statements into 1 equivalence classes.
[2025-03-03 11:01:59,174 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1433 of 1433 statements.
[2025-03-03 11:01:59,175 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 11:01:59,175 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 11:01:59,491 INFO  L134       CoverageAnalysis]: Checked inductivity of 2526 backedges. 1840 proven. 0 refuted. 0 times theorem prover too weak. 686 trivial. 0 not checked.
[2025-03-03 11:01:59,492 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 11:01:59,492 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989983364]
[2025-03-03 11:01:59,492 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989983364] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 11:01:59,492 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 11:01:59,492 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 11:01:59,492 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003329435]
[2025-03-03 11:01:59,492 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 11:01:59,493 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 11:01:59,493 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 11:01:59,494 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 11:01:59,494 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 11:01:59,494 INFO  L87              Difference]: Start difference. First operand 51133 states and 54858 transitions. Second operand  has 3 states, 3 states have (on average 290.6666666666667) internal successors, (872), 3 states have internal predecessors, (872), 0 states have call successors, (0), 0 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 11:02:00,559 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 11:02:00,559 INFO  L93              Difference]: Finished difference Result 100986 states and 108280 transitions.
[2025-03-03 11:02:00,560 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 11:02:00,560 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 290.6666666666667) internal successors, (872), 3 states have internal predecessors, (872), 0 states have call successors, (0), 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 1433
[2025-03-03 11:02:00,560 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 11:02:00,614 INFO  L225             Difference]: With dead ends: 100986
[2025-03-03 11:02:00,614 INFO  L226             Difference]: Without dead ends: 49855
[2025-03-03 11:02:00,645 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 11:02:00,645 INFO  L435           NwaCegarLoop]: 603 mSDtfsCounter, 109 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 1094 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 1188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 1094 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time
[2025-03-03 11:02:00,645 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 650 Invalid, 1188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 1094 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2025-03-03 11:02:00,808 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 49855 states.
[2025-03-03 11:02:01,085 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 49855 to 49427.
[2025-03-03 11:02:01,115 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 49427 states, 49426 states have (on average 1.060008902197224) internal successors, (52392), 49426 states have internal predecessors, (52392), 0 states have call successors, (0), 0 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 11:02:01,161 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 49427 states to 49427 states and 52392 transitions.
[2025-03-03 11:02:01,161 INFO  L78                 Accepts]: Start accepts. Automaton has 49427 states and 52392 transitions. Word has length 1433
[2025-03-03 11:02:01,162 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 11:02:01,162 INFO  L471      AbstractCegarLoop]: Abstraction has 49427 states and 52392 transitions.
[2025-03-03 11:02:01,162 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 290.6666666666667) internal successors, (872), 3 states have internal predecessors, (872), 0 states have call successors, (0), 0 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 11:02:01,162 INFO  L276                IsEmpty]: Start isEmpty. Operand 49427 states and 52392 transitions.
[2025-03-03 11:02:01,211 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1448
[2025-03-03 11:02:01,212 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 11:02:01,212 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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]
[2025-03-03 11:02:01,212 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2025-03-03 11:02:01,212 INFO  L396      AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 11:02:01,213 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 11:02:01,213 INFO  L85        PathProgramCache]: Analyzing trace with hash -1771439426, now seen corresponding path program 1 times
[2025-03-03 11:02:01,213 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 11:02:01,213 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523832071]
[2025-03-03 11:02:01,214 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 11:02:01,214 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 11:02:01,298 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1447 statements into 1 equivalence classes.
[2025-03-03 11:02:01,359 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1447 of 1447 statements.
[2025-03-03 11:02:01,360 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 11:02:01,360 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 11:02:02,167 INFO  L134       CoverageAnalysis]: Checked inductivity of 2358 backedges. 1218 proven. 0 refuted. 0 times theorem prover too weak. 1140 trivial. 0 not checked.
[2025-03-03 11:02:02,167 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 11:02:02,167 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523832071]
[2025-03-03 11:02:02,167 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523832071] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 11:02:02,168 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 11:02:02,168 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-03 11:02:02,168 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793626030]
[2025-03-03 11:02:02,168 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 11:02:02,168 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-03 11:02:02,168 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 11:02:02,169 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-03 11:02:02,169 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-03 11:02:02,169 INFO  L87              Difference]: Start difference. First operand 49427 states and 52392 transitions. Second operand  has 4 states, 4 states have (on average 190.75) internal successors, (763), 4 states have internal predecessors, (763), 0 states have call successors, (0), 0 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 11:02:04,139 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 11:02:04,140 INFO  L93              Difference]: Finished difference Result 116312 states and 122932 transitions.
[2025-03-03 11:02:04,140 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 11:02:04,140 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 190.75) internal successors, (763), 4 states have internal predecessors, (763), 0 states have call successors, (0), 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 1447
[2025-03-03 11:02:04,141 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 11:02:04,142 INFO  L225             Difference]: With dead ends: 116312
[2025-03-03 11:02:04,142 INFO  L226             Difference]: Without dead ends: 0
[2025-03-03 11:02:04,176 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 11:02:04,177 INFO  L435           NwaCegarLoop]: 47 mSDtfsCounter, 569 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 2231 mSolverCounterSat, 433 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 569 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 2664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 433 IncrementalHoareTripleChecker+Valid, 2231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time
[2025-03-03 11:02:04,177 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [569 Valid, 92 Invalid, 2664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [433 Valid, 2231 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time]
[2025-03-03 11:02:04,177 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2025-03-03 11:02:04,177 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2025-03-03 11:02:04,177 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 11:02:04,177 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2025-03-03 11:02:04,178 INFO  L78                 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1447
[2025-03-03 11:02:04,178 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 11:02:04,178 INFO  L471      AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2025-03-03 11:02:04,178 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 190.75) internal successors, (763), 4 states have internal predecessors, (763), 0 states have call successors, (0), 0 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 11:02:04,178 INFO  L276                IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2025-03-03 11:02:04,178 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2025-03-03 11:02:04,180 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2025-03-03 11:02:04,181 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2025-03-03 11:02:04,183 INFO  L422         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 11:02:04,184 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.
[2025-03-03 11:02:08,032 INFO  L170   ceAbstractionStarter]: Computing trace abstraction results
[2025-03-03 11:02:08,053 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 11:02:08 BoogieIcfgContainer
[2025-03-03 11:02:08,054 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2025-03-03 11:02:08,054 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2025-03-03 11:02:08,054 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2025-03-03 11:02:08,054 INFO  L274        PluginConnector]: Witness Printer initialized
[2025-03-03 11:02:08,055 INFO  L184        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:01:20" (3/4) ...
[2025-03-03 11:02:08,056 INFO  L146         WitnessPrinter]: Generating witness for correct program
[2025-03-03 11:02:08,086 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges
[2025-03-03 11:02:08,089 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges
[2025-03-03 11:02:08,101 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges
[2025-03-03 11:02:08,104 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges
[2025-03-03 11:02:08,382 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml
[2025-03-03 11:02:08,382 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml
[2025-03-03 11:02:08,383 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2025-03-03 11:02:08,383 INFO  L158              Benchmark]: Toolchain (without parser) took 51980.45ms. Allocated memory was 167.8MB in the beginning and 587.2MB in the end (delta: 419.4MB). Free memory was 113.7MB in the beginning and 382.9MB in the end (delta: -269.2MB). Peak memory consumption was 318.4MB. Max. memory is 16.1GB.
[2025-03-03 11:02:08,388 INFO  L158              Benchmark]: CDTParser took 0.92ms. Allocated memory is still 201.3MB. Free memory is still 115.8MB. There was no memory consumed. Max. memory is 16.1GB.
[2025-03-03 11:02:08,388 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 830.69ms. Allocated memory is still 167.8MB. Free memory was 113.7MB in the beginning and 81.8MB in the end (delta: 32.0MB). Peak memory consumption was 101.3MB. Max. memory is 16.1GB.
[2025-03-03 11:02:08,388 INFO  L158              Benchmark]: Boogie Procedure Inliner took 229.74ms. Allocated memory is still 167.8MB. Free memory was 81.8MB in the beginning and 76.6MB in the end (delta: 5.2MB). Peak memory consumption was 35.2MB. Max. memory is 16.1GB.
[2025-03-03 11:02:08,388 INFO  L158              Benchmark]: Boogie Preprocessor took 310.13ms. Allocated memory was 167.8MB in the beginning and 444.6MB in the end (delta: 276.8MB). Free memory was 76.6MB in the beginning and 326.3MB in the end (delta: -249.8MB). Peak memory consumption was 63.0MB. Max. memory is 16.1GB.
[2025-03-03 11:02:08,388 INFO  L158              Benchmark]: IcfgBuilder took 2687.23ms. Allocated memory is still 444.6MB. Free memory was 326.3MB in the beginning and 199.3MB in the end (delta: 127.1MB). Peak memory consumption was 229.1MB. Max. memory is 16.1GB.
[2025-03-03 11:02:08,388 INFO  L158              Benchmark]: TraceAbstraction took 47583.51ms. Allocated memory was 444.6MB in the beginning and 2.0GB in the end (delta: 1.6GB). Free memory was 199.3MB in the beginning and 1.7GB in the end (delta: -1.5GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB.
[2025-03-03 11:02:08,388 INFO  L158              Benchmark]: Witness Printer took 328.34ms. Allocated memory was 2.0GB in the beginning and 587.2MB in the end (delta: -1.4GB). Free memory was 1.7GB in the beginning and 382.9MB in the end (delta: 1.3GB). Peak memory consumption was 2.3MB. Max. memory is 16.1GB.
[2025-03-03 11:02:08,390 INFO  L338   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 0.92ms. Allocated memory is still 201.3MB. Free memory is still 115.8MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 830.69ms. Allocated memory is still 167.8MB. Free memory was 113.7MB in the beginning and 81.8MB in the end (delta: 32.0MB). Peak memory consumption was 101.3MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 229.74ms. Allocated memory is still 167.8MB. Free memory was 81.8MB in the beginning and 76.6MB in the end (delta: 5.2MB). Peak memory consumption was 35.2MB. Max. memory is 16.1GB.
 * Boogie Preprocessor took 310.13ms. Allocated memory was 167.8MB in the beginning and 444.6MB in the end (delta: 276.8MB). Free memory was 76.6MB in the beginning and 326.3MB in the end (delta: -249.8MB). Peak memory consumption was 63.0MB. Max. memory is 16.1GB.
 * IcfgBuilder took 2687.23ms. Allocated memory is still 444.6MB. Free memory was 326.3MB in the beginning and 199.3MB in the end (delta: 127.1MB). Peak memory consumption was 229.1MB. Max. memory is 16.1GB.
 * TraceAbstraction took 47583.51ms. Allocated memory was 444.6MB in the beginning and 2.0GB in the end (delta: 1.6GB). Free memory was 199.3MB in the beginning and 1.7GB in the end (delta: -1.5GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB.
 * Witness Printer took 328.34ms. Allocated memory was 2.0GB in the beginning and 587.2MB in the end (delta: -1.4GB). Free memory was 1.7GB in the beginning and 382.9MB in the end (delta: 1.3GB). Peak memory consumption was 2.3MB. Max. memory is 16.1GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: ErrorAutomatonStatistics
    NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0
  - PositiveResult [Line: 138]: a call to reach_error is unreachable
    For all program executions holds that a call to reach_error is unreachable at this location
  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 1 procedures, 590 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 43.7s, OverallIterations: 20, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.4s, AutomataDifference: 30.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8660 SdHoareTripleChecker+Valid, 26.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8660 mSDsluCounter, 10754 SdHoareTripleChecker+Invalid, 22.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1058 mSDsCounter, 5661 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 25712 IncrementalHoareTripleChecker+Invalid, 31373 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5661 mSolverCounterUnsat, 9696 mSDtfsCounter, 25712 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 576 GetRequests, 552 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=53305occurred in iteration=15, InterpolantAutomatonStates: 62, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.3s AutomataMinimizationTime, 20 MinimizatonAttempts, 23561 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 5.2s InterpolantComputationTime, 10672 NumberOfCodeBlocks, 10672 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 10910 ConstructedInterpolants, 0 QuantifiedInterpolants, 18476 SizeOfPredicates, 0 NumberOfNonLiveVariables, 366 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 22 InterpolantComputations, 20 PerfectInterpolantSequences, 13250/13414 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available
  - AllSpecificationsHoldResult: All specifications hold
    1 specifications checked. All of them hold
  - InvariantResult [Line: 2590]: Location Invariant
    Derived location invariant: (((((((((((((((((((a24 == 3) && (a21 <= 124)) && (a26 <= 217)) && (((long long) a14 + 114) <= 0)) || ((((a24 == 3) && (a21 <= 124)) && (((long long) a14 + 182) <= 0)) && (a28 <= 599997))) || (((a24 == 3) && (a21 <= 124)) && (a26 <= 123))) || (((a21 <= 124) && (((long long) a14 + 182) <= 0)) && (a24 == 2))) || (((a21 <= 124) && (a24 == 1)) && (a28 <= 300))) || ((((a24 == 1) && (((((long long) a26 * 9) >= 0) ? (((long long) a26 * 9) / 10) : ((((long long) a26 * 9) / 10) - 1)) <= 555071)) && (((long long) a14 + 84) <= 0)) && (218 <= a26))) || (((a21 <= 124) && (a24 == 2)) && (a28 <= 599997))) || ((((a24 == 3) && (a21 <= 124)) && (((long long) a14 + 114) <= 0)) && (a28 <= 133))) || (((a24 == 1) && (((long long) a14 + 84) <= 0)) && (a28 <= 300))) || (((((a21 <= 124) && (a24 == 1)) && (((((long long) a26 * 9) >= 0) ? (((long long) a26 * 9) / 10) : ((((long long) a26 * 9) / 10) - 1)) <= 555071)) && (218 <= a26)) && (a28 <= 599997))) || (((a24 == 1) && (a26 <= 217)) && (0 <= ((long long) a14 + 83)))) || ((((a21 <= 124) && (a24 == 2)) && (((long long) a14 + 84) <= 0)) && (0 <= ((long long) a14 + 113)))) || ((((a21 <= 124) && (((((long long) a26 * 9) >= 0) ? (((long long) a26 * 9) / 10) : ((((long long) a26 * 9) / 10) - 1)) <= 555071)) && (a24 == 2)) && (((long long) a14 + 114) <= 0))) || ((a24 == 1) && (a26 <= 123))) || (((a21 <= 124) && (a24 == 2)) && (a26 <= 123))) || ((a24 == 1) && (((long long) a14 + 114) <= 0)))
RESULT: Ultimate proved your program to be correct!
[2025-03-03 11:02:08,414 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0
Received shutdown request...
--- End real Ultimate output ---

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