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


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


Checking for ERROR reachability
Using default analysis
Version 8fc3dc66
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/Problem03_label55.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 892d3c9e0b7c167d810581087b0633fb7bb5cd8a7fe1ab934154adc1945085ff
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-8fc3dc6-m
[2025-03-16 14:12:12,718 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-03-16 14:12:12,771 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2025-03-16 14:12:12,779 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-03-16 14:12:12,779 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-03-16 14:12:12,797 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-03-16 14:12:12,799 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-03-16 14:12:12,799 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-03-16 14:12:12,799 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-03-16 14:12:12,800 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-03-16 14:12:12,800 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-03-16 14:12:12,800 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-03-16 14:12:12,800 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-03-16 14:12:12,800 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-03-16 14:12:12,801 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-03-16 14:12:12,801 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-03-16 14:12:12,801 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-03-16 14:12:12,801 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-03-16 14:12:12,801 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-03-16 14:12:12,801 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-03-16 14:12:12,802 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-03-16 14:12:12,802 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-03-16 14:12:12,802 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-03-16 14:12:12,802 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-03-16 14:12:12,802 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-03-16 14:12:12,802 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-03-16 14:12:12,802 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-03-16 14:12:12,802 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-03-16 14:12:12,802 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-03-16 14:12:12,802 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-03-16 14:12:12,802 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-03-16 14:12:12,802 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-03-16 14:12:12,802 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-16 14:12:12,802 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-03-16 14:12:12,802 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-03-16 14:12:12,802 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-03-16 14:12:12,802 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-03-16 14:12:12,802 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-03-16 14:12:12,802 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-03-16 14:12:12,802 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-03-16 14:12:12,802 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-03-16 14:12:12,802 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-03-16 14:12:12,802 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-03-16 14:12:12,802 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 -> 892d3c9e0b7c167d810581087b0633fb7bb5cd8a7fe1ab934154adc1945085ff
[2025-03-16 14:12:13,022 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-03-16 14:12:13,027 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-03-16 14:12:13,029 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-03-16 14:12:13,029 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-03-16 14:12:13,029 INFO  L274        PluginConnector]: CDTParser initialized
[2025-03-16 14:12:13,030 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem03_label55.c
[2025-03-16 14:12:14,202 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4f9da149/efc14f43c0c2491a8cfc345c7e4def75/FLAG22227d38f
[2025-03-16 14:12:14,561 INFO  L384              CDTParser]: Found 1 translation units.
[2025-03-16 14:12:14,563 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label55.c
[2025-03-16 14:12:14,578 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4f9da149/efc14f43c0c2491a8cfc345c7e4def75/FLAG22227d38f
[2025-03-16 14:12:14,751 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4f9da149/efc14f43c0c2491a8cfc345c7e4def75
[2025-03-16 14:12:14,754 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-03-16 14:12:14,755 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-03-16 14:12:14,755 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-03-16 14:12:14,755 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-03-16 14:12:14,759 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-03-16 14:12:14,759 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 02:12:14" (1/1) ...
[2025-03-16 14:12:14,759 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63c85b5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:12:14, skipping insertion in model container
[2025-03-16 14:12:14,760 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 02:12:14" (1/1) ...
[2025-03-16 14:12:14,797 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-03-16 14:12:15,083 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/Problem03_label55.c[56086,56099]
[2025-03-16 14:12:15,108 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-16 14:12:15,116 INFO  L200         MainTranslator]: Completed pre-run
[2025-03-16 14:12:15,223 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/Problem03_label55.c[56086,56099]
[2025-03-16 14:12:15,234 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-16 14:12:15,246 INFO  L204         MainTranslator]: Completed translation
[2025-03-16 14:12:15,248 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:12:15 WrapperNode
[2025-03-16 14:12:15,248 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-03-16 14:12:15,249 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-03-16 14:12:15,249 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-03-16 14:12:15,249 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-03-16 14:12:15,253 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:12:15" (1/1) ...
[2025-03-16 14:12:15,283 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:12:15" (1/1) ...
[2025-03-16 14:12:15,361 INFO  L138                Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1769
[2025-03-16 14:12:15,361 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-03-16 14:12:15,362 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-03-16 14:12:15,362 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-03-16 14:12:15,362 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-03-16 14:12:15,368 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:12:15" (1/1) ...
[2025-03-16 14:12:15,369 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:12:15" (1/1) ...
[2025-03-16 14:12:15,380 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:12:15" (1/1) ...
[2025-03-16 14:12:15,403 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-16 14:12:15,403 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:12:15" (1/1) ...
[2025-03-16 14:12:15,403 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:12:15" (1/1) ...
[2025-03-16 14:12:15,444 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:12:15" (1/1) ...
[2025-03-16 14:12:15,450 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:12:15" (1/1) ...
[2025-03-16 14:12:15,457 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:12:15" (1/1) ...
[2025-03-16 14:12:15,463 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:12:15" (1/1) ...
[2025-03-16 14:12:15,473 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-03-16 14:12:15,474 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-03-16 14:12:15,474 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-03-16 14:12:15,474 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-03-16 14:12:15,475 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:12:15" (1/1) ...
[2025-03-16 14:12:15,479 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-16 14:12:15,489 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-16 14:12:15,501 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-16 14:12:15,506 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-16 14:12:15,519 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-03-16 14:12:15,520 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-03-16 14:12:15,520 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-03-16 14:12:15,520 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-03-16 14:12:15,583 INFO  L256             CfgBuilder]: Building ICFG
[2025-03-16 14:12:15,584 INFO  L286             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-03-16 14:12:16,930 INFO  L?                        ?]: Removed 147 outVars from TransFormulas that were not future-live.
[2025-03-16 14:12:16,930 INFO  L307             CfgBuilder]: Performing block encoding
[2025-03-16 14:12:16,945 INFO  L331             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-03-16 14:12:16,947 INFO  L336             CfgBuilder]: Removed 0 assume(true) statements.
[2025-03-16 14:12:16,947 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:12:16 BoogieIcfgContainer
[2025-03-16 14:12:16,947 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-03-16 14:12:16,949 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-03-16 14:12:16,949 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-03-16 14:12:16,952 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-03-16 14:12:16,953 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 02:12:14" (1/3) ...
[2025-03-16 14:12:16,953 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15016309 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 02:12:16, skipping insertion in model container
[2025-03-16 14:12:16,953 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:12:15" (2/3) ...
[2025-03-16 14:12:16,953 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15016309 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 02:12:16, skipping insertion in model container
[2025-03-16 14:12:16,954 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:12:16" (3/3) ...
[2025-03-16 14:12:16,955 INFO  L128   eAbstractionObserver]: Analyzing ICFG Problem03_label55.c
[2025-03-16 14:12:16,965 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-03-16 14:12:16,970 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG Problem03_label55.c that has 1 procedures, 241 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-03-16 14:12:17,023 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-03-16 14:12:17,033 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;@2bfe6ccd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-03-16 14:12:17,034 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-03-16 14:12:17,037 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 241 states, 239 states have (on average 1.9121338912133892) internal successors, (457), 240 states have internal predecessors, (457), 0 states have call successors, (0), 0 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-16 14:12:17,046 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 162
[2025-03-16 14:12:17,047 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 14:12:17,047 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:12:17,048 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 14:12:17,052 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 14:12:17,052 INFO  L85        PathProgramCache]: Analyzing trace with hash 1383479476, now seen corresponding path program 1 times
[2025-03-16 14:12:17,057 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 14:12:17,058 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256295260]
[2025-03-16 14:12:17,058 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 14:12:17,060 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 14:12:17,171 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes.
[2025-03-16 14:12:17,311 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements.
[2025-03-16 14:12:17,312 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 14:12:17,312 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 14:12:17,565 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-16 14:12:17,565 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 14:12:17,566 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256295260]
[2025-03-16 14:12:17,567 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256295260] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 14:12:17,567 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 14:12:17,568 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-16 14:12:17,569 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45435061]
[2025-03-16 14:12:17,569 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 14:12:17,572 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2025-03-16 14:12:17,572 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 14:12:17,587 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2025-03-16 14:12:17,588 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-03-16 14:12:17,590 INFO  L87              Difference]: Start difference. First operand  has 241 states, 239 states have (on average 1.9121338912133892) internal successors, (457), 240 states have internal predecessors, (457), 0 states have call successors, (0), 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 2 states, 2 states have (on average 80.5) internal successors, (161), 2 states have internal predecessors, (161), 0 states have call successors, (0), 0 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-16 14:12:17,626 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 14:12:17,629 INFO  L93              Difference]: Finished difference Result 481 states and 913 transitions.
[2025-03-16 14:12:17,630 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2025-03-16 14:12:17,631 INFO  L78                 Accepts]: Start accepts. Automaton has  has 2 states, 2 states have (on average 80.5) internal successors, (161), 2 states have internal predecessors, (161), 0 states have call successors, (0), 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 161
[2025-03-16 14:12:17,631 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 14:12:17,639 INFO  L225             Difference]: With dead ends: 481
[2025-03-16 14:12:17,640 INFO  L226             Difference]: Without dead ends: 238
[2025-03-16 14:12:17,643 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-03-16 14:12:17,646 INFO  L435           NwaCegarLoop]: 395 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-16 14:12:17,646 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-16 14:12:17,658 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 238 states.
[2025-03-16 14:12:17,680 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238.
[2025-03-16 14:12:17,681 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 238 states, 237 states have (on average 1.6540084388185654) internal successors, (392), 237 states have internal predecessors, (392), 0 states have call successors, (0), 0 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-16 14:12:17,686 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 392 transitions.
[2025-03-16 14:12:17,688 INFO  L78                 Accepts]: Start accepts. Automaton has 238 states and 392 transitions. Word has length 161
[2025-03-16 14:12:17,689 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 14:12:17,690 INFO  L471      AbstractCegarLoop]: Abstraction has 238 states and 392 transitions.
[2025-03-16 14:12:17,690 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 80.5) internal successors, (161), 2 states have internal predecessors, (161), 0 states have call successors, (0), 0 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-16 14:12:17,691 INFO  L276                IsEmpty]: Start isEmpty. Operand 238 states and 392 transitions.
[2025-03-16 14:12:17,692 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 162
[2025-03-16 14:12:17,694 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 14:12:17,695 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:12:17,695 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2025-03-16 14:12:17,695 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 14:12:17,695 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 14:12:17,696 INFO  L85        PathProgramCache]: Analyzing trace with hash -327462444, now seen corresponding path program 1 times
[2025-03-16 14:12:17,696 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 14:12:17,696 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337514278]
[2025-03-16 14:12:17,696 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 14:12:17,696 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 14:12:17,750 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes.
[2025-03-16 14:12:17,807 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements.
[2025-03-16 14:12:17,812 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 14:12:17,812 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 14:12:18,117 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-16 14:12:18,119 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 14:12:18,119 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337514278]
[2025-03-16 14:12:18,119 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337514278] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 14:12:18,119 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 14:12:18,119 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-16 14:12:18,119 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343983159]
[2025-03-16 14:12:18,120 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 14:12:18,121 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 14:12:18,121 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 14:12:18,122 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 14:12:18,123 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 14:12:18,123 INFO  L87              Difference]: Start difference. First operand 238 states and 392 transitions. Second operand  has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 2 states have internal predecessors, (161), 0 states have call successors, (0), 0 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-16 14:12:18,845 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 14:12:18,845 INFO  L93              Difference]: Finished difference Result 701 states and 1160 transitions.
[2025-03-16 14:12:18,845 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 14:12:18,846 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 2 states have internal predecessors, (161), 0 states have call successors, (0), 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 161
[2025-03-16 14:12:18,846 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 14:12:18,850 INFO  L225             Difference]: With dead ends: 701
[2025-03-16 14:12:18,850 INFO  L226             Difference]: Without dead ends: 464
[2025-03-16 14:12:18,851 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-16 14:12:18,853 INFO  L435           NwaCegarLoop]: 100 mSDtfsCounter, 110 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 613 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-03-16 14:12:18,853 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 132 Invalid, 713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 613 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-03-16 14:12:18,854 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 464 states.
[2025-03-16 14:12:18,873 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 458.
[2025-03-16 14:12:18,876 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 458 states, 457 states have (on average 1.5579868708971554) internal successors, (712), 457 states have internal predecessors, (712), 0 states have call successors, (0), 0 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-16 14:12:18,878 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 712 transitions.
[2025-03-16 14:12:18,878 INFO  L78                 Accepts]: Start accepts. Automaton has 458 states and 712 transitions. Word has length 161
[2025-03-16 14:12:18,878 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 14:12:18,878 INFO  L471      AbstractCegarLoop]: Abstraction has 458 states and 712 transitions.
[2025-03-16 14:12:18,878 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 2 states have internal predecessors, (161), 0 states have call successors, (0), 0 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-16 14:12:18,879 INFO  L276                IsEmpty]: Start isEmpty. Operand 458 states and 712 transitions.
[2025-03-16 14:12:18,880 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 170
[2025-03-16 14:12:18,881 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 14:12:18,881 INFO  L218           NwaCegarLoop]: trace histogram [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]
[2025-03-16 14:12:18,881 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-03-16 14:12:18,881 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 14:12:18,882 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 14:12:18,882 INFO  L85        PathProgramCache]: Analyzing trace with hash -441594394, now seen corresponding path program 1 times
[2025-03-16 14:12:18,882 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 14:12:18,882 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36493148]
[2025-03-16 14:12:18,882 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 14:12:18,882 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 14:12:18,921 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes.
[2025-03-16 14:12:18,935 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements.
[2025-03-16 14:12:18,935 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 14:12:18,935 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 14:12:19,019 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-16 14:12:19,020 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 14:12:19,020 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36493148]
[2025-03-16 14:12:19,020 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36493148] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 14:12:19,020 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 14:12:19,020 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-16 14:12:19,020 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312614011]
[2025-03-16 14:12:19,020 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 14:12:19,020 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 14:12:19,020 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 14:12:19,021 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 14:12:19,021 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 14:12:19,021 INFO  L87              Difference]: Start difference. First operand 458 states and 712 transitions. Second operand  has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 2 states have internal predecessors, (169), 0 states have call successors, (0), 0 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-16 14:12:19,676 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 14:12:19,676 INFO  L93              Difference]: Finished difference Result 1342 states and 2101 transitions.
[2025-03-16 14:12:19,676 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 14:12:19,676 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 2 states have internal predecessors, (169), 0 states have call successors, (0), 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 169
[2025-03-16 14:12:19,677 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 14:12:19,679 INFO  L225             Difference]: With dead ends: 1342
[2025-03-16 14:12:19,679 INFO  L226             Difference]: Without dead ends: 885
[2025-03-16 14:12:19,680 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-16 14:12:19,681 INFO  L435           NwaCegarLoop]: 75 mSDtfsCounter, 249 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-16 14:12:19,681 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 89 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-16 14:12:19,682 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 885 states.
[2025-03-16 14:12:19,697 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 867.
[2025-03-16 14:12:19,699 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 867 states, 866 states have (on average 1.5346420323325636) internal successors, (1329), 866 states have internal predecessors, (1329), 0 states have call successors, (0), 0 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-16 14:12:19,702 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 867 states to 867 states and 1329 transitions.
[2025-03-16 14:12:19,703 INFO  L78                 Accepts]: Start accepts. Automaton has 867 states and 1329 transitions. Word has length 169
[2025-03-16 14:12:19,704 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 14:12:19,704 INFO  L471      AbstractCegarLoop]: Abstraction has 867 states and 1329 transitions.
[2025-03-16 14:12:19,704 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 2 states have internal predecessors, (169), 0 states have call successors, (0), 0 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-16 14:12:19,704 INFO  L276                IsEmpty]: Start isEmpty. Operand 867 states and 1329 transitions.
[2025-03-16 14:12:19,706 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 171
[2025-03-16 14:12:19,706 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 14:12:19,706 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-16 14:12:19,707 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-03-16 14:12:19,707 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 14:12:19,707 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 14:12:19,707 INFO  L85        PathProgramCache]: Analyzing trace with hash 1898836236, now seen corresponding path program 1 times
[2025-03-16 14:12:19,707 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 14:12:19,707 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079111111]
[2025-03-16 14:12:19,707 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 14:12:19,708 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 14:12:19,745 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes.
[2025-03-16 14:12:19,750 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements.
[2025-03-16 14:12:19,752 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 14:12:19,752 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 14:12:19,905 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-16 14:12:19,907 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 14:12:19,907 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079111111]
[2025-03-16 14:12:19,907 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079111111] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 14:12:19,907 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 14:12:19,908 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-16 14:12:19,908 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997473932]
[2025-03-16 14:12:19,908 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 14:12:19,908 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 14:12:19,908 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 14:12:19,909 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 14:12:19,909 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 14:12:19,909 INFO  L87              Difference]: Start difference. First operand 867 states and 1329 transitions. Second operand  has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 2 states have internal predecessors, (170), 0 states have call successors, (0), 0 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-16 14:12:20,515 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 14:12:20,516 INFO  L93              Difference]: Finished difference Result 2545 states and 3910 transitions.
[2025-03-16 14:12:20,516 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 14:12:20,517 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 2 states have internal predecessors, (170), 0 states have call successors, (0), 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 170
[2025-03-16 14:12:20,517 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 14:12:20,522 INFO  L225             Difference]: With dead ends: 2545
[2025-03-16 14:12:20,522 INFO  L226             Difference]: Without dead ends: 1679
[2025-03-16 14:12:20,523 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-16 14:12:20,526 INFO  L435           NwaCegarLoop]: 158 mSDtfsCounter, 213 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 568 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-16 14:12:20,527 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 191 Invalid, 694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 568 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-16 14:12:20,528 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1679 states.
[2025-03-16 14:12:20,561 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1679 to 1679.
[2025-03-16 14:12:20,563 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1679 states, 1678 states have (on average 1.3444576877234804) internal successors, (2256), 1678 states have internal predecessors, (2256), 0 states have call successors, (0), 0 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-16 14:12:20,567 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1679 states to 1679 states and 2256 transitions.
[2025-03-16 14:12:20,567 INFO  L78                 Accepts]: Start accepts. Automaton has 1679 states and 2256 transitions. Word has length 170
[2025-03-16 14:12:20,567 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 14:12:20,567 INFO  L471      AbstractCegarLoop]: Abstraction has 1679 states and 2256 transitions.
[2025-03-16 14:12:20,567 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 2 states have internal predecessors, (170), 0 states have call successors, (0), 0 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-16 14:12:20,567 INFO  L276                IsEmpty]: Start isEmpty. Operand 1679 states and 2256 transitions.
[2025-03-16 14:12:20,570 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 174
[2025-03-16 14:12:20,570 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 14:12:20,570 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-16 14:12:20,570 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-03-16 14:12:20,570 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 14:12:20,571 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 14:12:20,571 INFO  L85        PathProgramCache]: Analyzing trace with hash 1802077532, now seen corresponding path program 1 times
[2025-03-16 14:12:20,571 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 14:12:20,571 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106308035]
[2025-03-16 14:12:20,571 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 14:12:20,571 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 14:12:20,592 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes.
[2025-03-16 14:12:20,596 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements.
[2025-03-16 14:12:20,597 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 14:12:20,597 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 14:12:20,807 INFO  L134       CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-16 14:12:20,807 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 14:12:20,807 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106308035]
[2025-03-16 14:12:20,807 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106308035] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 14:12:20,807 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 14:12:20,807 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-16 14:12:20,807 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979446838]
[2025-03-16 14:12:20,807 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 14:12:20,807 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 14:12:20,807 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 14:12:20,808 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 14:12:20,808 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 14:12:20,808 INFO  L87              Difference]: Start difference. First operand 1679 states and 2256 transitions. Second operand  has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 2 states have internal predecessors, (173), 0 states have call successors, (0), 0 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-16 14:12:21,524 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 14:12:21,524 INFO  L93              Difference]: Finished difference Result 5009 states and 6730 transitions.
[2025-03-16 14:12:21,524 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 14:12:21,524 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 2 states have internal predecessors, (173), 0 states have call successors, (0), 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 173
[2025-03-16 14:12:21,524 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 14:12:21,533 INFO  L225             Difference]: With dead ends: 5009
[2025-03-16 14:12:21,533 INFO  L226             Difference]: Without dead ends: 3331
[2025-03-16 14:12:21,536 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-16 14:12:21,536 INFO  L435           NwaCegarLoop]: 71 mSDtfsCounter, 286 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 682 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 682 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-03-16 14:12:21,537 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 97 Invalid, 754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 682 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-03-16 14:12:21,539 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3331 states.
[2025-03-16 14:12:21,577 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3331 to 3328.
[2025-03-16 14:12:21,581 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3328 states, 3327 states have (on average 1.321009918845807) internal successors, (4395), 3327 states have internal predecessors, (4395), 0 states have call successors, (0), 0 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-16 14:12:21,590 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3328 states to 3328 states and 4395 transitions.
[2025-03-16 14:12:21,590 INFO  L78                 Accepts]: Start accepts. Automaton has 3328 states and 4395 transitions. Word has length 173
[2025-03-16 14:12:21,590 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 14:12:21,590 INFO  L471      AbstractCegarLoop]: Abstraction has 3328 states and 4395 transitions.
[2025-03-16 14:12:21,591 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 2 states have internal predecessors, (173), 0 states have call successors, (0), 0 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-16 14:12:21,591 INFO  L276                IsEmpty]: Start isEmpty. Operand 3328 states and 4395 transitions.
[2025-03-16 14:12:21,594 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 177
[2025-03-16 14:12:21,594 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 14:12:21,594 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:12:21,595 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-03-16 14:12:21,595 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 14:12:21,595 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 14:12:21,595 INFO  L85        PathProgramCache]: Analyzing trace with hash -232367997, now seen corresponding path program 1 times
[2025-03-16 14:12:21,595 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 14:12:21,595 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199210553]
[2025-03-16 14:12:21,595 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 14:12:21,596 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 14:12:21,618 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes.
[2025-03-16 14:12:21,633 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements.
[2025-03-16 14:12:21,633 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 14:12:21,633 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 14:12:21,867 INFO  L134       CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-16 14:12:21,867 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 14:12:21,867 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199210553]
[2025-03-16 14:12:21,868 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199210553] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-16 14:12:21,868 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [833252184]
[2025-03-16 14:12:21,868 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 14:12:21,868 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-16 14:12:21,868 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-16 14:12:21,871 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-16 14:12:21,873 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-16 14:12:21,928 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes.
[2025-03-16 14:12:21,975 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements.
[2025-03-16 14:12:21,975 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 14:12:21,975 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 14:12:21,978 INFO  L256         TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-03-16 14:12:21,987 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-16 14:12:22,176 INFO  L134       CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2025-03-16 14:12:22,177 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-16 14:12:22,177 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [833252184] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 14:12:22,177 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-16 14:12:22,177 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5
[2025-03-16 14:12:22,177 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185451303]
[2025-03-16 14:12:22,177 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 14:12:22,177 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 14:12:22,177 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 14:12:22,178 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 14:12:22,178 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-16 14:12:22,178 INFO  L87              Difference]: Start difference. First operand 3328 states and 4395 transitions. Second operand  has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 0 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-16 14:12:22,860 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 14:12:22,860 INFO  L93              Difference]: Finished difference Result 8286 states and 11244 transitions.
[2025-03-16 14:12:22,861 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 14:12:22,861 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 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 176
[2025-03-16 14:12:22,863 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 14:12:22,875 INFO  L225             Difference]: With dead ends: 8286
[2025-03-16 14:12:22,876 INFO  L226             Difference]: Without dead ends: 4959
[2025-03-16 14:12:22,880 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-16 14:12:22,881 INFO  L435           NwaCegarLoop]: 371 mSDtfsCounter, 79 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 175 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 175 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-16 14:12:22,881 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 399 Invalid, 701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [175 Valid, 526 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-16 14:12:22,886 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 4959 states.
[2025-03-16 14:12:22,950 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 4959 to 4955.
[2025-03-16 14:12:22,956 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 4955 states, 4954 states have (on average 1.259184497375858) internal successors, (6238), 4954 states have internal predecessors, (6238), 0 states have call successors, (0), 0 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-16 14:12:22,966 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4955 states to 4955 states and 6238 transitions.
[2025-03-16 14:12:22,966 INFO  L78                 Accepts]: Start accepts. Automaton has 4955 states and 6238 transitions. Word has length 176
[2025-03-16 14:12:22,967 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 14:12:22,967 INFO  L471      AbstractCegarLoop]: Abstraction has 4955 states and 6238 transitions.
[2025-03-16 14:12:22,967 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 0 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-16 14:12:22,967 INFO  L276                IsEmpty]: Start isEmpty. Operand 4955 states and 6238 transitions.
[2025-03-16 14:12:22,972 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 218
[2025-03-16 14:12:22,972 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 14:12:22,973 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:12:22,982 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-16 14:12:23,173 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-16 14:12:23,174 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 14:12:23,176 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 14:12:23,176 INFO  L85        PathProgramCache]: Analyzing trace with hash -2136557464, now seen corresponding path program 1 times
[2025-03-16 14:12:23,176 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 14:12:23,176 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644094397]
[2025-03-16 14:12:23,176 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 14:12:23,176 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 14:12:23,207 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes.
[2025-03-16 14:12:23,218 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements.
[2025-03-16 14:12:23,218 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 14:12:23,218 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 14:12:23,405 INFO  L134       CoverageAnalysis]: Checked inductivity of 75 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2025-03-16 14:12:23,406 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 14:12:23,406 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644094397]
[2025-03-16 14:12:23,406 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644094397] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 14:12:23,406 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 14:12:23,406 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-16 14:12:23,406 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172801332]
[2025-03-16 14:12:23,406 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 14:12:23,407 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-16 14:12:23,407 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 14:12:23,407 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-16 14:12:23,407 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-16 14:12:23,407 INFO  L87              Difference]: Start difference. First operand 4955 states and 6238 transitions. Second operand  has 4 states, 4 states have (on average 53.0) internal successors, (212), 3 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:12:24,070 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 14:12:24,070 INFO  L93              Difference]: Finished difference Result 9894 states and 12460 transitions.
[2025-03-16 14:12:24,071 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-16 14:12:24,071 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 53.0) internal successors, (212), 3 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 217
[2025-03-16 14:12:24,071 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 14:12:24,085 INFO  L225             Difference]: With dead ends: 9894
[2025-03-16 14:12:24,085 INFO  L226             Difference]: Without dead ends: 4940
[2025-03-16 14:12:24,091 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-16 14:12:24,092 INFO  L435           NwaCegarLoop]: 33 mSDtfsCounter, 798 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 200 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 798 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 200 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-16 14:12:24,092 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [798 Valid, 42 Invalid, 767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [200 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-16 14:12:24,096 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 4940 states.
[2025-03-16 14:12:24,148 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 4940 to 4928.
[2025-03-16 14:12:24,154 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 4928 states, 4927 states have (on average 1.2269129287598945) internal successors, (6045), 4927 states have internal predecessors, (6045), 0 states have call successors, (0), 0 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-16 14:12:24,161 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4928 states to 4928 states and 6045 transitions.
[2025-03-16 14:12:24,162 INFO  L78                 Accepts]: Start accepts. Automaton has 4928 states and 6045 transitions. Word has length 217
[2025-03-16 14:12:24,162 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 14:12:24,162 INFO  L471      AbstractCegarLoop]: Abstraction has 4928 states and 6045 transitions.
[2025-03-16 14:12:24,162 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 53.0) internal successors, (212), 3 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:12:24,163 INFO  L276                IsEmpty]: Start isEmpty. Operand 4928 states and 6045 transitions.
[2025-03-16 14:12:24,166 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 225
[2025-03-16 14:12:24,166 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 14:12:24,167 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-03-16 14:12:24,167 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-03-16 14:12:24,167 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 14:12:24,167 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 14:12:24,167 INFO  L85        PathProgramCache]: Analyzing trace with hash 1645178459, now seen corresponding path program 1 times
[2025-03-16 14:12:24,167 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 14:12:24,168 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754464514]
[2025-03-16 14:12:24,168 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 14:12:24,168 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 14:12:24,197 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes.
[2025-03-16 14:12:24,203 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements.
[2025-03-16 14:12:24,204 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 14:12:24,204 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 14:12:24,489 INFO  L134       CoverageAnalysis]: Checked inductivity of 62 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-16 14:12:24,489 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 14:12:24,489 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754464514]
[2025-03-16 14:12:24,489 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754464514] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 14:12:24,489 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 14:12:24,490 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-16 14:12:24,490 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368032717]
[2025-03-16 14:12:24,490 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 14:12:24,490 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 14:12:24,490 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 14:12:24,491 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 14:12:24,491 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 14:12:24,491 INFO  L87              Difference]: Start difference. First operand 4928 states and 6045 transitions. Second operand  has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 2 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:12:25,097 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 14:12:25,097 INFO  L93              Difference]: Finished difference Result 11497 states and 13971 transitions.
[2025-03-16 14:12:25,098 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 14:12:25,098 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 2 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 224
[2025-03-16 14:12:25,098 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 14:12:25,114 INFO  L225             Difference]: With dead ends: 11497
[2025-03-16 14:12:25,114 INFO  L226             Difference]: Without dead ends: 6570
[2025-03-16 14:12:25,121 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-16 14:12:25,121 INFO  L435           NwaCegarLoop]: 97 mSDtfsCounter, 159 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 600 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-16 14:12:25,122 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 113 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 600 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-16 14:12:25,127 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 6570 states.
[2025-03-16 14:12:25,202 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 6570 to 6566.
[2025-03-16 14:12:25,209 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 6566 states, 6565 states have (on average 1.202894135567403) internal successors, (7897), 6565 states have internal predecessors, (7897), 0 states have call successors, (0), 0 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-16 14:12:25,219 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6566 states to 6566 states and 7897 transitions.
[2025-03-16 14:12:25,220 INFO  L78                 Accepts]: Start accepts. Automaton has 6566 states and 7897 transitions. Word has length 224
[2025-03-16 14:12:25,220 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 14:12:25,220 INFO  L471      AbstractCegarLoop]: Abstraction has 6566 states and 7897 transitions.
[2025-03-16 14:12:25,220 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 2 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:12:25,220 INFO  L276                IsEmpty]: Start isEmpty. Operand 6566 states and 7897 transitions.
[2025-03-16 14:12:25,225 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 232
[2025-03-16 14:12:25,225 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 14:12:25,226 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:12:25,226 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-03-16 14:12:25,226 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 14:12:25,226 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 14:12:25,226 INFO  L85        PathProgramCache]: Analyzing trace with hash -1248561378, now seen corresponding path program 1 times
[2025-03-16 14:12:25,226 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 14:12:25,226 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900983785]
[2025-03-16 14:12:25,227 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 14:12:25,227 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 14:12:25,254 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 231 statements into 1 equivalence classes.
[2025-03-16 14:12:25,264 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 231 of 231 statements.
[2025-03-16 14:12:25,264 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 14:12:25,264 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 14:12:25,571 INFO  L134       CoverageAnalysis]: Checked inductivity of 75 backedges. 69 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-16 14:12:25,571 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 14:12:25,571 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900983785]
[2025-03-16 14:12:25,571 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900983785] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-16 14:12:25,572 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1981278054]
[2025-03-16 14:12:25,572 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 14:12:25,572 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-16 14:12:25,572 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-16 14:12:25,574 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-16 14:12:25,576 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2025-03-16 14:12:25,639 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 231 statements into 1 equivalence classes.
[2025-03-16 14:12:25,696 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 231 of 231 statements.
[2025-03-16 14:12:25,697 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 14:12:25,697 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 14:12:25,699 INFO  L256         TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 3 conjuncts are in the unsatisfiable core
[2025-03-16 14:12:25,705 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-16 14:12:25,901 INFO  L134       CoverageAnalysis]: Checked inductivity of 75 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-16 14:12:25,901 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-16 14:12:25,902 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1981278054] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 14:12:25,902 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-16 14:12:25,902 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5
[2025-03-16 14:12:25,902 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148042223]
[2025-03-16 14:12:25,902 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 14:12:25,902 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 14:12:25,902 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 14:12:25,905 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 14:12:25,905 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-16 14:12:25,905 INFO  L87              Difference]: Start difference. First operand 6566 states and 7897 transitions. Second operand  has 3 states, 3 states have (on average 77.0) internal successors, (231), 3 states have internal predecessors, (231), 0 states have call successors, (0), 0 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-16 14:12:26,516 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 14:12:26,516 INFO  L93              Difference]: Finished difference Result 18413 states and 22160 transitions.
[2025-03-16 14:12:26,516 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 14:12:26,517 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 77.0) internal successors, (231), 3 states have internal predecessors, (231), 0 states have call successors, (0), 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 231
[2025-03-16 14:12:26,517 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 14:12:26,551 INFO  L225             Difference]: With dead ends: 18413
[2025-03-16 14:12:26,551 INFO  L226             Difference]: Without dead ends: 11848
[2025-03-16 14:12:26,560 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-16 14:12:26,560 INFO  L435           NwaCegarLoop]: 132 mSDtfsCounter, 153 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-16 14:12:26,561 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 147 Invalid, 684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 603 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-16 14:12:26,571 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 11848 states.
[2025-03-16 14:12:26,683 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 11848 to 11846.
[2025-03-16 14:12:26,701 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 11846 states, 11845 states have (on average 1.1653018151118615) internal successors, (13803), 11845 states have internal predecessors, (13803), 0 states have call successors, (0), 0 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-16 14:12:26,718 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11846 states to 11846 states and 13803 transitions.
[2025-03-16 14:12:26,718 INFO  L78                 Accepts]: Start accepts. Automaton has 11846 states and 13803 transitions. Word has length 231
[2025-03-16 14:12:26,718 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 14:12:26,719 INFO  L471      AbstractCegarLoop]: Abstraction has 11846 states and 13803 transitions.
[2025-03-16 14:12:26,723 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 77.0) internal successors, (231), 3 states have internal predecessors, (231), 0 states have call successors, (0), 0 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-16 14:12:26,723 INFO  L276                IsEmpty]: Start isEmpty. Operand 11846 states and 13803 transitions.
[2025-03-16 14:12:26,731 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 241
[2025-03-16 14:12:26,731 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 14:12:26,732 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:12:26,738 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2025-03-16 14:12:26,932 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8
[2025-03-16 14:12:26,933 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 14:12:26,933 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 14:12:26,933 INFO  L85        PathProgramCache]: Analyzing trace with hash -299229867, now seen corresponding path program 1 times
[2025-03-16 14:12:26,933 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 14:12:26,933 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894476397]
[2025-03-16 14:12:26,933 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 14:12:26,933 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 14:12:26,965 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 240 statements into 1 equivalence classes.
[2025-03-16 14:12:27,009 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 240 of 240 statements.
[2025-03-16 14:12:27,010 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 14:12:27,010 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 14:12:27,753 INFO  L134       CoverageAnalysis]: Checked inductivity of 121 backedges. 74 proven. 6 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked.
[2025-03-16 14:12:27,753 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 14:12:27,753 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894476397]
[2025-03-16 14:12:27,753 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894476397] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-16 14:12:27,753 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1443245952]
[2025-03-16 14:12:27,753 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 14:12:27,753 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-16 14:12:27,753 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-16 14:12:27,756 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-16 14:12:27,758 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2025-03-16 14:12:27,813 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 240 statements into 1 equivalence classes.
[2025-03-16 14:12:27,867 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 240 of 240 statements.
[2025-03-16 14:12:27,867 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 14:12:27,867 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 14:12:27,870 INFO  L256         TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-03-16 14:12:27,873 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-16 14:12:28,023 INFO  L134       CoverageAnalysis]: Checked inductivity of 121 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked.
[2025-03-16 14:12:28,023 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-16 14:12:28,023 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1443245952] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 14:12:28,023 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-16 14:12:28,023 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6
[2025-03-16 14:12:28,024 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771273924]
[2025-03-16 14:12:28,024 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 14:12:28,024 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 14:12:28,024 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 14:12:28,025 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 14:12:28,025 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-03-16 14:12:28,025 INFO  L87              Difference]: Start difference. First operand 11846 states and 13803 transitions. Second operand  has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 3 states have internal predecessors, (205), 0 states have call successors, (0), 0 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-16 14:12:28,624 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 14:12:28,624 INFO  L93              Difference]: Finished difference Result 23703 states and 27627 transitions.
[2025-03-16 14:12:28,624 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 14:12:28,624 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 3 states have internal predecessors, (205), 0 states have call successors, (0), 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 240
[2025-03-16 14:12:28,625 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 14:12:28,643 INFO  L225             Difference]: With dead ends: 23703
[2025-03-16 14:12:28,643 INFO  L226             Difference]: Without dead ends: 11858
[2025-03-16 14:12:28,653 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 239 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-03-16 14:12:28,654 INFO  L435           NwaCegarLoop]: 343 mSDtfsCounter, 63 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 658 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-16 14:12:28,654 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 357 Invalid, 709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 658 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-16 14:12:28,663 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 11858 states.
[2025-03-16 14:12:28,754 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 11858 to 11846.
[2025-03-16 14:12:28,768 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 11846 states, 11845 states have (on average 1.151962853524694) internal successors, (13645), 11845 states have internal predecessors, (13645), 0 states have call successors, (0), 0 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-16 14:12:28,782 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11846 states to 11846 states and 13645 transitions.
[2025-03-16 14:12:28,783 INFO  L78                 Accepts]: Start accepts. Automaton has 11846 states and 13645 transitions. Word has length 240
[2025-03-16 14:12:28,783 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 14:12:28,784 INFO  L471      AbstractCegarLoop]: Abstraction has 11846 states and 13645 transitions.
[2025-03-16 14:12:28,784 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 3 states have internal predecessors, (205), 0 states have call successors, (0), 0 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-16 14:12:28,784 INFO  L276                IsEmpty]: Start isEmpty. Operand 11846 states and 13645 transitions.
[2025-03-16 14:12:28,792 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 258
[2025-03-16 14:12:28,792 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 14:12:28,792 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-03-16 14:12:28,799 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0
[2025-03-16 14:12:28,997 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-16 14:12:28,997 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 14:12:28,998 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 14:12:28,998 INFO  L85        PathProgramCache]: Analyzing trace with hash -1730025000, now seen corresponding path program 1 times
[2025-03-16 14:12:28,998 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 14:12:28,998 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598032114]
[2025-03-16 14:12:28,998 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 14:12:28,998 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 14:12:29,024 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 257 statements into 1 equivalence classes.
[2025-03-16 14:12:29,064 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 257 of 257 statements.
[2025-03-16 14:12:29,064 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 14:12:29,064 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 14:12:29,899 INFO  L134       CoverageAnalysis]: Checked inductivity of 95 backedges. 30 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-16 14:12:29,900 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 14:12:29,900 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598032114]
[2025-03-16 14:12:29,900 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598032114] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-16 14:12:29,900 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [623307365]
[2025-03-16 14:12:29,900 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 14:12:29,900 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-16 14:12:29,900 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-16 14:12:29,902 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-16 14:12:29,904 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2025-03-16 14:12:29,957 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 257 statements into 1 equivalence classes.
[2025-03-16 14:12:30,007 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 257 of 257 statements.
[2025-03-16 14:12:30,007 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 14:12:30,007 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 14:12:30,009 INFO  L256         TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-03-16 14:12:30,012 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-16 14:12:30,222 INFO  L134       CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked.
[2025-03-16 14:12:30,222 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-16 14:12:30,222 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [623307365] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 14:12:30,222 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-16 14:12:30,222 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6
[2025-03-16 14:12:30,222 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465857271]
[2025-03-16 14:12:30,222 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 14:12:30,223 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 14:12:30,223 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 14:12:30,223 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 14:12:30,223 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2025-03-16 14:12:30,223 INFO  L87              Difference]: Start difference. First operand 11846 states and 13645 transitions. Second operand  has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 2 states have internal predecessors, (163), 0 states have call successors, (0), 0 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-16 14:12:30,762 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 14:12:30,763 INFO  L93              Difference]: Finished difference Result 34289 states and 39496 transitions.
[2025-03-16 14:12:30,763 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 14:12:30,763 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 2 states have internal predecessors, (163), 0 states have call successors, (0), 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 257
[2025-03-16 14:12:30,763 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 14:12:30,801 INFO  L225             Difference]: With dead ends: 34289
[2025-03-16 14:12:30,801 INFO  L226             Difference]: Without dead ends: 22444
[2025-03-16 14:12:30,815 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 257 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2025-03-16 14:12:30,815 INFO  L435           NwaCegarLoop]: 98 mSDtfsCounter, 67 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 608 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 658 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-16 14:12:30,816 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 125 Invalid, 658 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 608 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-16 14:12:30,832 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 22444 states.
[2025-03-16 14:12:31,042 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 22444 to 19579.
[2025-03-16 14:12:31,060 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 19579 states, 19578 states have (on average 1.1594647052814384) internal successors, (22700), 19578 states have internal predecessors, (22700), 0 states have call successors, (0), 0 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-16 14:12:31,086 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 19579 states to 19579 states and 22700 transitions.
[2025-03-16 14:12:31,087 INFO  L78                 Accepts]: Start accepts. Automaton has 19579 states and 22700 transitions. Word has length 257
[2025-03-16 14:12:31,087 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 14:12:31,087 INFO  L471      AbstractCegarLoop]: Abstraction has 19579 states and 22700 transitions.
[2025-03-16 14:12:31,087 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 2 states have internal predecessors, (163), 0 states have call successors, (0), 0 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-16 14:12:31,087 INFO  L276                IsEmpty]: Start isEmpty. Operand 19579 states and 22700 transitions.
[2025-03-16 14:12:31,101 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 273
[2025-03-16 14:12:31,102 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 14:12:31,102 INFO  L218           NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:12:31,108 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0
[2025-03-16 14:12:31,302 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-16 14:12:31,302 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 14:12:31,303 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 14:12:31,303 INFO  L85        PathProgramCache]: Analyzing trace with hash 2064244569, now seen corresponding path program 1 times
[2025-03-16 14:12:31,303 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 14:12:31,303 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517745319]
[2025-03-16 14:12:31,303 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 14:12:31,303 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 14:12:31,346 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes.
[2025-03-16 14:12:31,361 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements.
[2025-03-16 14:12:31,361 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 14:12:31,361 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 14:12:31,446 INFO  L134       CoverageAnalysis]: Checked inductivity of 124 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-16 14:12:31,446 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 14:12:31,446 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517745319]
[2025-03-16 14:12:31,446 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517745319] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 14:12:31,446 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 14:12:31,447 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-16 14:12:31,447 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853726191]
[2025-03-16 14:12:31,447 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 14:12:31,447 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 14:12:31,447 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 14:12:31,448 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 14:12:31,448 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 14:12:31,448 INFO  L87              Difference]: Start difference. First operand 19579 states and 22700 transitions. Second operand  has 3 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 0 states have call successors, (0), 0 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-16 14:12:32,010 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 14:12:32,011 INFO  L93              Difference]: Finished difference Result 48905 states and 57050 transitions.
[2025-03-16 14:12:32,011 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 14:12:32,011 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 0 states have call successors, (0), 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-16 14:12:32,011 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 14:12:32,053 INFO  L225             Difference]: With dead ends: 48905
[2025-03-16 14:12:32,053 INFO  L226             Difference]: Without dead ends: 29327
[2025-03-16 14:12:32,071 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-16 14:12:32,071 INFO  L435           NwaCegarLoop]: 309 mSDtfsCounter, 239 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-16 14:12:32,071 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 324 Invalid, 668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 514 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-16 14:12:32,093 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 29327 states.
[2025-03-16 14:12:32,400 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 29327 to 29325.
[2025-03-16 14:12:32,429 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 29325 states, 29324 states have (on average 1.139442095212113) internal successors, (33413), 29324 states have internal predecessors, (33413), 0 states have call successors, (0), 0 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-16 14:12:32,464 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 29325 states to 29325 states and 33413 transitions.
[2025-03-16 14:12:32,465 INFO  L78                 Accepts]: Start accepts. Automaton has 29325 states and 33413 transitions. Word has length 272
[2025-03-16 14:12:32,465 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 14:12:32,465 INFO  L471      AbstractCegarLoop]: Abstraction has 29325 states and 33413 transitions.
[2025-03-16 14:12:32,465 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 0 states have call successors, (0), 0 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-16 14:12:32,465 INFO  L276                IsEmpty]: Start isEmpty. Operand 29325 states and 33413 transitions.
[2025-03-16 14:12:32,479 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 285
[2025-03-16 14:12:32,479 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 14:12:32,480 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-03-16 14:12:32,480 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2025-03-16 14:12:32,480 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 14:12:32,480 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 14:12:32,480 INFO  L85        PathProgramCache]: Analyzing trace with hash 1706837689, now seen corresponding path program 1 times
[2025-03-16 14:12:32,481 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 14:12:32,481 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353431345]
[2025-03-16 14:12:32,481 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 14:12:32,481 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 14:12:32,511 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 284 statements into 1 equivalence classes.
[2025-03-16 14:12:32,520 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 284 of 284 statements.
[2025-03-16 14:12:32,520 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 14:12:32,520 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 14:12:32,597 INFO  L134       CoverageAnalysis]: Checked inductivity of 148 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-16 14:12:32,597 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 14:12:32,597 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353431345]
[2025-03-16 14:12:32,597 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353431345] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 14:12:32,597 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 14:12:32,597 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-16 14:12:32,598 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366612990]
[2025-03-16 14:12:32,598 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 14:12:32,598 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 14:12:32,598 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 14:12:32,598 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 14:12:32,599 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 14:12:32,599 INFO  L87              Difference]: Start difference. First operand 29325 states and 33413 transitions. Second operand  has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 0 states have call successors, (0), 0 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-16 14:12:33,267 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 14:12:33,267 INFO  L93              Difference]: Finished difference Result 71444 states and 81298 transitions.
[2025-03-16 14:12:33,267 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 14:12:33,268 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 0 states have call successors, (0), 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 284
[2025-03-16 14:12:33,268 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 14:12:33,324 INFO  L225             Difference]: With dead ends: 71444
[2025-03-16 14:12:33,324 INFO  L226             Difference]: Without dead ends: 42120
[2025-03-16 14:12:33,338 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-16 14:12:33,338 INFO  L435           NwaCegarLoop]: 290 mSDtfsCounter, 222 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-16 14:12:33,339 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 305 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-16 14:12:33,363 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 42120 states.
[2025-03-16 14:12:33,588 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 42120 to 36225.
[2025-03-16 14:12:33,618 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 36225 states, 36224 states have (on average 1.1118319346289753) internal successors, (40275), 36224 states have internal predecessors, (40275), 0 states have call successors, (0), 0 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-16 14:12:33,652 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 36225 states to 36225 states and 40275 transitions.
[2025-03-16 14:12:33,654 INFO  L78                 Accepts]: Start accepts. Automaton has 36225 states and 40275 transitions. Word has length 284
[2025-03-16 14:12:33,654 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 14:12:33,655 INFO  L471      AbstractCegarLoop]: Abstraction has 36225 states and 40275 transitions.
[2025-03-16 14:12:33,655 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 0 states have call successors, (0), 0 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-16 14:12:33,655 INFO  L276                IsEmpty]: Start isEmpty. Operand 36225 states and 40275 transitions.
[2025-03-16 14:12:33,677 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 368
[2025-03-16 14:12:33,677 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 14:12:33,677 INFO  L218           NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:12:33,677 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2025-03-16 14:12:33,678 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 14:12:33,678 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 14:12:33,678 INFO  L85        PathProgramCache]: Analyzing trace with hash 215497224, now seen corresponding path program 1 times
[2025-03-16 14:12:33,679 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 14:12:33,679 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932074169]
[2025-03-16 14:12:33,679 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 14:12:33,679 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 14:12:33,717 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 367 statements into 1 equivalence classes.
[2025-03-16 14:12:33,723 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 367 of 367 statements.
[2025-03-16 14:12:33,723 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 14:12:33,723 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 14:12:34,830 INFO  L134       CoverageAnalysis]: Checked inductivity of 325 backedges. 111 proven. 6 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked.
[2025-03-16 14:12:34,830 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 14:12:34,830 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932074169]
[2025-03-16 14:12:34,830 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932074169] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-16 14:12:34,830 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1135467572]
[2025-03-16 14:12:34,830 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 14:12:34,831 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-16 14:12:34,831 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-16 14:12:34,832 INFO  L229       MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-16 14:12:34,834 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2025-03-16 14:12:34,926 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 367 statements into 1 equivalence classes.
[2025-03-16 14:12:35,018 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 367 of 367 statements.
[2025-03-16 14:12:35,018 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 14:12:35,019 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 14:12:35,021 INFO  L256         TraceCheckSpWp]: Trace formula consists of 639 conjuncts, 3 conjuncts are in the unsatisfiable core
[2025-03-16 14:12:35,026 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-16 14:12:35,164 INFO  L134       CoverageAnalysis]: Checked inductivity of 325 backedges. 240 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked.
[2025-03-16 14:12:35,164 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-16 14:12:35,164 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1135467572] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 14:12:35,164 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-16 14:12:35,164 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5
[2025-03-16 14:12:35,164 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533998958]
[2025-03-16 14:12:35,164 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 14:12:35,165 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 14:12:35,165 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 14:12:35,165 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 14:12:35,165 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-03-16 14:12:35,165 INFO  L87              Difference]: Start difference. First operand 36225 states and 40275 transitions. Second operand  has 3 states, 3 states have (on average 97.0) internal successors, (291), 2 states have internal predecessors, (291), 0 states have call successors, (0), 0 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-16 14:12:35,397 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 14:12:35,397 INFO  L93              Difference]: Finished difference Result 108261 states and 120389 transitions.
[2025-03-16 14:12:35,397 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 14:12:35,397 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 97.0) internal successors, (291), 2 states have internal predecessors, (291), 0 states have call successors, (0), 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 367
[2025-03-16 14:12:35,397 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 14:12:35,478 INFO  L225             Difference]: With dead ends: 108261
[2025-03-16 14:12:35,479 INFO  L226             Difference]: Without dead ends: 72037
[2025-03-16 14:12:35,512 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 366 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-03-16 14:12:35,512 INFO  L435           NwaCegarLoop]: 355 mSDtfsCounter, 219 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 699 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-16 14:12:35,512 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 699 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-16 14:12:35,563 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 72037 states.
[2025-03-16 14:12:36,081 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 72037 to 72033.
[2025-03-16 14:12:36,135 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 72033 states, 72032 states have (on average 1.1121446023989339) internal successors, (80110), 72032 states have internal predecessors, (80110), 0 states have call successors, (0), 0 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-16 14:12:36,211 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 72033 states to 72033 states and 80110 transitions.
[2025-03-16 14:12:36,212 INFO  L78                 Accepts]: Start accepts. Automaton has 72033 states and 80110 transitions. Word has length 367
[2025-03-16 14:12:36,212 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 14:12:36,212 INFO  L471      AbstractCegarLoop]: Abstraction has 72033 states and 80110 transitions.
[2025-03-16 14:12:36,212 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 97.0) internal successors, (291), 2 states have internal predecessors, (291), 0 states have call successors, (0), 0 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-16 14:12:36,212 INFO  L276                IsEmpty]: Start isEmpty. Operand 72033 states and 80110 transitions.
[2025-03-16 14:12:36,247 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 394
[2025-03-16 14:12:36,247 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 14:12:36,247 INFO  L218           NwaCegarLoop]: trace histogram [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, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-03-16 14:12:36,254 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0
[2025-03-16 14:12:36,447 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13
[2025-03-16 14:12:36,448 INFO  L396      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 14:12:36,448 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 14:12:36,448 INFO  L85        PathProgramCache]: Analyzing trace with hash -1654003366, now seen corresponding path program 1 times
[2025-03-16 14:12:36,448 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 14:12:36,448 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197710834]
[2025-03-16 14:12:36,448 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 14:12:36,448 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 14:12:36,486 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 393 statements into 1 equivalence classes.
[2025-03-16 14:12:36,509 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 393 of 393 statements.
[2025-03-16 14:12:36,509 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 14:12:36,509 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 14:12:36,607 INFO  L134       CoverageAnalysis]: Checked inductivity of 441 backedges. 325 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked.
[2025-03-16 14:12:36,607 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 14:12:36,607 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197710834]
[2025-03-16 14:12:36,607 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197710834] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 14:12:36,607 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 14:12:36,607 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-16 14:12:36,607 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581555571]
[2025-03-16 14:12:36,607 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 14:12:36,608 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 14:12:36,608 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 14:12:36,608 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 14:12:36,608 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 14:12:36,608 INFO  L87              Difference]: Start difference. First operand 72033 states and 80110 transitions. Second operand  has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 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-16 14:12:37,442 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 14:12:37,443 INFO  L93              Difference]: Finished difference Result 135119 states and 149934 transitions.
[2025-03-16 14:12:37,443 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 14:12:37,443 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 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 393
[2025-03-16 14:12:37,443 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 14:12:37,512 INFO  L225             Difference]: With dead ends: 135119
[2025-03-16 14:12:37,513 INFO  L226             Difference]: Without dead ends: 63087
[2025-03-16 14:12:37,543 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-16 14:12:37,544 INFO  L435           NwaCegarLoop]: 302 mSDtfsCounter, 225 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 555 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-16 14:12:37,544 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 321 Invalid, 642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 555 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-16 14:12:37,590 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 63087 states.
[2025-03-16 14:12:38,014 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 63087 to 63071.
[2025-03-16 14:12:38,058 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 63071 states, 63070 states have (on average 1.09613128270176) internal successors, (69133), 63070 states have internal predecessors, (69133), 0 states have call successors, (0), 0 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-16 14:12:38,120 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 63071 states to 63071 states and 69133 transitions.
[2025-03-16 14:12:38,121 INFO  L78                 Accepts]: Start accepts. Automaton has 63071 states and 69133 transitions. Word has length 393
[2025-03-16 14:12:38,122 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 14:12:38,122 INFO  L471      AbstractCegarLoop]: Abstraction has 63071 states and 69133 transitions.
[2025-03-16 14:12:38,122 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 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-16 14:12:38,122 INFO  L276                IsEmpty]: Start isEmpty. Operand 63071 states and 69133 transitions.
[2025-03-16 14:12:38,157 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 465
[2025-03-16 14:12:38,157 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 14:12:38,157 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:12:38,157 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2025-03-16 14:12:38,157 INFO  L396      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 14:12:38,158 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 14:12:38,158 INFO  L85        PathProgramCache]: Analyzing trace with hash 1155873406, now seen corresponding path program 1 times
[2025-03-16 14:12:38,158 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 14:12:38,158 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860617836]
[2025-03-16 14:12:38,158 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 14:12:38,158 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 14:12:38,205 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 464 statements into 1 equivalence classes.
[2025-03-16 14:12:38,211 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 464 of 464 statements.
[2025-03-16 14:12:38,211 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 14:12:38,212 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 14:12:39,565 INFO  L134       CoverageAnalysis]: Checked inductivity of 547 backedges. 129 proven. 6 refuted. 0 times theorem prover too weak. 412 trivial. 0 not checked.
[2025-03-16 14:12:39,565 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 14:12:39,565 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860617836]
[2025-03-16 14:12:39,565 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860617836] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-16 14:12:39,565 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1796424305]
[2025-03-16 14:12:39,565 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 14:12:39,566 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-16 14:12:39,566 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-16 14:12:39,567 INFO  L229       MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-16 14:12:39,569 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process
[2025-03-16 14:12:39,674 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 464 statements into 1 equivalence classes.
[2025-03-16 14:12:39,779 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 464 of 464 statements.
[2025-03-16 14:12:39,779 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 14:12:39,779 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 14:12:39,782 INFO  L256         TraceCheckSpWp]: Trace formula consists of 776 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-03-16 14:12:39,789 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-16 14:12:39,924 INFO  L134       CoverageAnalysis]: Checked inductivity of 547 backedges. 492 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked.
[2025-03-16 14:12:39,924 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-16 14:12:39,924 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1796424305] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 14:12:39,924 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-16 14:12:39,924 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6
[2025-03-16 14:12:39,924 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326233762]
[2025-03-16 14:12:39,924 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 14:12:39,925 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 14:12:39,925 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 14:12:39,925 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 14:12:39,925 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-03-16 14:12:39,925 INFO  L87              Difference]: Start difference. First operand 63071 states and 69133 transitions. Second operand  has 3 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 0 states have call successors, (0), 0 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-16 14:12:40,657 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 14:12:40,658 INFO  L93              Difference]: Finished difference Result 126145 states and 138271 transitions.
[2025-03-16 14:12:40,658 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 14:12:40,658 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 0 states have call successors, (0), 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 464
[2025-03-16 14:12:40,658 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 14:12:40,734 INFO  L225             Difference]: With dead ends: 126145
[2025-03-16 14:12:40,734 INFO  L226             Difference]: Without dead ends: 63075
[2025-03-16 14:12:40,775 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 467 GetRequests, 463 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-03-16 14:12:40,776 INFO  L435           NwaCegarLoop]: 89 mSDtfsCounter, 120 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 636 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-16 14:12:40,776 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 104 Invalid, 636 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-16 14:12:40,815 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 63075 states.
[2025-03-16 14:12:41,484 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 63075 to 62255.
[2025-03-16 14:12:41,533 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 62255 states, 62254 states have (on average 1.0875927651235262) internal successors, (67707), 62254 states have internal predecessors, (67707), 0 states have call successors, (0), 0 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-16 14:12:41,616 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 62255 states to 62255 states and 67707 transitions.
[2025-03-16 14:12:41,618 INFO  L78                 Accepts]: Start accepts. Automaton has 62255 states and 67707 transitions. Word has length 464
[2025-03-16 14:12:41,618 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 14:12:41,618 INFO  L471      AbstractCegarLoop]: Abstraction has 62255 states and 67707 transitions.
[2025-03-16 14:12:41,618 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 0 states have call successors, (0), 0 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-16 14:12:41,618 INFO  L276                IsEmpty]: Start isEmpty. Operand 62255 states and 67707 transitions.
[2025-03-16 14:12:41,664 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 482
[2025-03-16 14:12:41,664 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 14:12:41,664 INFO  L218           NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-03-16 14:12:41,671 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0
[2025-03-16 14:12:41,865 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15
[2025-03-16 14:12:41,865 INFO  L396      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 14:12:41,866 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 14:12:41,866 INFO  L85        PathProgramCache]: Analyzing trace with hash 341477264, now seen corresponding path program 1 times
[2025-03-16 14:12:41,866 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 14:12:41,866 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764770264]
[2025-03-16 14:12:41,866 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 14:12:41,866 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 14:12:41,938 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 481 statements into 1 equivalence classes.
[2025-03-16 14:12:41,948 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 481 of 481 statements.
[2025-03-16 14:12:41,948 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 14:12:41,948 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 14:12:43,132 INFO  L134       CoverageAnalysis]: Checked inductivity of 780 backedges. 200 proven. 6 refuted. 0 times theorem prover too weak. 574 trivial. 0 not checked.
[2025-03-16 14:12:43,132 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 14:12:43,132 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764770264]
[2025-03-16 14:12:43,132 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764770264] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-16 14:12:43,132 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [169326164]
[2025-03-16 14:12:43,132 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 14:12:43,132 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-16 14:12:43,132 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-16 14:12:43,134 INFO  L229       MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-16 14:12:43,135 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process
[2025-03-16 14:12:43,210 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 481 statements into 1 equivalence classes.
[2025-03-16 14:12:43,311 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 481 of 481 statements.
[2025-03-16 14:12:43,312 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 14:12:43,312 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 14:12:43,316 INFO  L256         TraceCheckSpWp]: Trace formula consists of 875 conjuncts, 5 conjuncts are in the unsatisfiable core
[2025-03-16 14:12:43,321 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-16 14:12:43,703 INFO  L134       CoverageAnalysis]: Checked inductivity of 780 backedges. 705 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked.
[2025-03-16 14:12:43,703 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-16 14:12:43,703 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [169326164] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 14:12:43,703 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-16 14:12:43,704 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 8
[2025-03-16 14:12:43,704 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357162240]
[2025-03-16 14:12:43,704 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 14:12:43,704 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-16 14:12:43,704 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 14:12:43,704 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-16 14:12:43,704 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2025-03-16 14:12:43,704 INFO  L87              Difference]: Start difference. First operand 62255 states and 67707 transitions. Second operand  has 5 states, 5 states have (on average 81.8) internal successors, (409), 5 states have internal predecessors, (409), 0 states have call successors, (0), 0 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-16 14:12:44,766 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 14:12:44,766 INFO  L93              Difference]: Finished difference Result 184104 states and 200507 transitions.
[2025-03-16 14:12:44,766 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-16 14:12:44,766 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 81.8) internal successors, (409), 5 states have internal predecessors, (409), 0 states have call successors, (0), 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 481
[2025-03-16 14:12:44,767 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 14:12:44,904 INFO  L225             Difference]: With dead ends: 184104
[2025-03-16 14:12:44,904 INFO  L226             Difference]: Without dead ends: 121850
[2025-03-16 14:12:44,954 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 484 GetRequests, 478 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2025-03-16 14:12:44,954 INFO  L435           NwaCegarLoop]: 45 mSDtfsCounter, 1126 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 787 mSolverCounterSat, 279 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1126 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 1066 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 279 IncrementalHoareTripleChecker+Valid, 787 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-16 14:12:44,954 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1126 Valid, 479 Invalid, 1066 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [279 Valid, 787 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-16 14:12:45,035 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 121850 states.
[2025-03-16 14:12:46,184 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 121850 to 116152.
[2025-03-16 14:12:46,255 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 116152 states, 116151 states have (on average 1.088410775628277) internal successors, (126420), 116151 states have internal predecessors, (126420), 0 states have call successors, (0), 0 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-16 14:12:46,376 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 116152 states to 116152 states and 126420 transitions.
[2025-03-16 14:12:46,378 INFO  L78                 Accepts]: Start accepts. Automaton has 116152 states and 126420 transitions. Word has length 481
[2025-03-16 14:12:46,378 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 14:12:46,378 INFO  L471      AbstractCegarLoop]: Abstraction has 116152 states and 126420 transitions.
[2025-03-16 14:12:46,379 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 81.8) internal successors, (409), 5 states have internal predecessors, (409), 0 states have call successors, (0), 0 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-16 14:12:46,379 INFO  L276                IsEmpty]: Start isEmpty. Operand 116152 states and 126420 transitions.
[2025-03-16 14:12:46,425 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 496
[2025-03-16 14:12:46,425 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 14:12:46,425 INFO  L218           NwaCegarLoop]: trace histogram [8, 8, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:12:46,432 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0
[2025-03-16 14:12:46,625 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-16 14:12:46,626 INFO  L396      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 14:12:46,626 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 14:12:46,626 INFO  L85        PathProgramCache]: Analyzing trace with hash -2115268684, now seen corresponding path program 1 times
[2025-03-16 14:12:46,626 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 14:12:46,626 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526891203]
[2025-03-16 14:12:46,626 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 14:12:46,626 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 14:12:46,670 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 495 statements into 1 equivalence classes.
[2025-03-16 14:12:46,680 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 495 of 495 statements.
[2025-03-16 14:12:46,680 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 14:12:46,680 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 14:12:47,142 INFO  L134       CoverageAnalysis]: Checked inductivity of 880 backedges. 349 proven. 0 refuted. 0 times theorem prover too weak. 531 trivial. 0 not checked.
[2025-03-16 14:12:47,142 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 14:12:47,142 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526891203]
[2025-03-16 14:12:47,142 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526891203] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 14:12:47,142 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 14:12:47,142 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-16 14:12:47,142 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694039635]
[2025-03-16 14:12:47,142 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 14:12:47,143 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-16 14:12:47,143 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 14:12:47,144 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-16 14:12:47,144 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-16 14:12:47,144 INFO  L87              Difference]: Start difference. First operand 116152 states and 126420 transitions. Second operand  has 4 states, 4 states have (on average 67.0) internal successors, (268), 3 states have internal predecessors, (268), 0 states have call successors, (0), 0 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-16 14:12:48,650 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 14:12:48,650 INFO  L93              Difference]: Finished difference Result 264443 states and 287793 transitions.
[2025-03-16 14:12:48,650 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-16 14:12:48,650 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 67.0) internal successors, (268), 3 states have internal predecessors, (268), 0 states have call successors, (0), 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 495
[2025-03-16 14:12:48,650 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 14:12:48,814 INFO  L225             Difference]: With dead ends: 264443
[2025-03-16 14:12:48,814 INFO  L226             Difference]: Without dead ends: 148292
[2025-03-16 14:12:48,879 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-16 14:12:48,879 INFO  L435           NwaCegarLoop]: 61 mSDtfsCounter, 347 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 1129 mSolverCounterSat, 180 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 1309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 180 IncrementalHoareTripleChecker+Valid, 1129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-03-16 14:12:48,880 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 90 Invalid, 1309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [180 Valid, 1129 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-03-16 14:12:48,977 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 148292 states.
[2025-03-16 14:12:50,367 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 148292 to 136046.
[2025-03-16 14:12:50,461 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 136046 states, 136045 states have (on average 1.0741445845124775) internal successors, (146132), 136045 states have internal predecessors, (146132), 0 states have call successors, (0), 0 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-16 14:12:50,597 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 136046 states to 136046 states and 146132 transitions.
[2025-03-16 14:12:50,600 INFO  L78                 Accepts]: Start accepts. Automaton has 136046 states and 146132 transitions. Word has length 495
[2025-03-16 14:12:50,600 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 14:12:50,600 INFO  L471      AbstractCegarLoop]: Abstraction has 136046 states and 146132 transitions.
[2025-03-16 14:12:50,600 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 67.0) internal successors, (268), 3 states have internal predecessors, (268), 0 states have call successors, (0), 0 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-16 14:12:50,600 INFO  L276                IsEmpty]: Start isEmpty. Operand 136046 states and 146132 transitions.
[2025-03-16 14:12:50,659 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 584
[2025-03-16 14:12:50,659 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 14:12:50,659 INFO  L218           NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:12:50,659 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2025-03-16 14:12:50,660 INFO  L396      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 14:12:50,660 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 14:12:50,660 INFO  L85        PathProgramCache]: Analyzing trace with hash 853282312, now seen corresponding path program 1 times
[2025-03-16 14:12:50,660 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 14:12:50,660 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157377340]
[2025-03-16 14:12:50,660 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 14:12:50,660 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 14:12:50,714 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 583 statements into 1 equivalence classes.
[2025-03-16 14:12:50,721 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 583 of 583 statements.
[2025-03-16 14:12:50,722 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 14:12:50,722 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 14:12:52,684 INFO  L134       CoverageAnalysis]: Checked inductivity of 1043 backedges. 203 proven. 6 refuted. 0 times theorem prover too weak. 834 trivial. 0 not checked.
[2025-03-16 14:12:52,684 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 14:12:52,684 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157377340]
[2025-03-16 14:12:52,684 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157377340] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-16 14:12:52,684 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1283146735]
[2025-03-16 14:12:52,684 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 14:12:52,684 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-16 14:12:52,684 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-16 14:12:52,686 INFO  L229       MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-16 14:12:52,688 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process
[2025-03-16 14:12:52,771 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 583 statements into 1 equivalence classes.
[2025-03-16 14:12:52,891 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 583 of 583 statements.
[2025-03-16 14:12:52,891 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 14:12:52,891 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 14:12:52,894 INFO  L256         TraceCheckSpWp]: Trace formula consists of 977 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-03-16 14:12:52,899 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-16 14:12:52,986 INFO  L134       CoverageAnalysis]: Checked inductivity of 1043 backedges. 787 proven. 0 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked.
[2025-03-16 14:12:52,986 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-16 14:12:52,986 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1283146735] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 14:12:52,986 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-16 14:12:52,986 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6
[2025-03-16 14:12:52,986 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550765713]
[2025-03-16 14:12:52,986 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 14:12:52,986 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 14:12:52,986 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 14:12:52,987 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 14:12:52,987 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-03-16 14:12:52,987 INFO  L87              Difference]: Start difference. First operand 136046 states and 146132 transitions. Second operand  has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 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-16 14:12:54,097 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 14:12:54,098 INFO  L93              Difference]: Finished difference Result 378647 states and 407046 transitions.
[2025-03-16 14:12:54,098 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 14:12:54,098 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 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 583
[2025-03-16 14:12:54,098 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 14:12:54,423 INFO  L225             Difference]: With dead ends: 378647
[2025-03-16 14:12:54,423 INFO  L226             Difference]: Without dead ends: 242602
[2025-03-16 14:12:54,512 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 586 GetRequests, 582 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-03-16 14:12:54,512 INFO  L435           NwaCegarLoop]: 582 mSDtfsCounter, 221 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 810 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-16 14:12:54,512 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 810 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-16 14:12:54,689 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 242602 states.
[2025-03-16 14:12:57,105 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 242602 to 237525.
[2025-03-16 14:12:57,261 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 237525 states, 237524 states have (on average 1.0678289351812869) internal successors, (253635), 237524 states have internal predecessors, (253635), 0 states have call successors, (0), 0 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-16 14:12:57,787 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 237525 states to 237525 states and 253635 transitions.
[2025-03-16 14:12:57,791 INFO  L78                 Accepts]: Start accepts. Automaton has 237525 states and 253635 transitions. Word has length 583
[2025-03-16 14:12:57,791 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 14:12:57,791 INFO  L471      AbstractCegarLoop]: Abstraction has 237525 states and 253635 transitions.
[2025-03-16 14:12:57,791 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 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-16 14:12:57,791 INFO  L276                IsEmpty]: Start isEmpty. Operand 237525 states and 253635 transitions.
[2025-03-16 14:12:57,881 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 592
[2025-03-16 14:12:57,882 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 14:12:57,882 INFO  L218           NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 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, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:12:57,889 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0
[2025-03-16 14:12:58,082 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-16 14:12:58,083 INFO  L396      AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 14:12:58,083 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 14:12:58,083 INFO  L85        PathProgramCache]: Analyzing trace with hash 588620509, now seen corresponding path program 1 times
[2025-03-16 14:12:58,083 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 14:12:58,083 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308577207]
[2025-03-16 14:12:58,083 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 14:12:58,083 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 14:12:58,134 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 591 statements into 1 equivalence classes.
[2025-03-16 14:12:58,142 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 591 of 591 statements.
[2025-03-16 14:12:58,142 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 14:12:58,142 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 14:12:59,925 INFO  L134       CoverageAnalysis]: Checked inductivity of 1491 backedges. 277 proven. 6 refuted. 0 times theorem prover too weak. 1208 trivial. 0 not checked.
[2025-03-16 14:12:59,926 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 14:12:59,926 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308577207]
[2025-03-16 14:12:59,926 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308577207] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-16 14:12:59,926 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1814768600]
[2025-03-16 14:12:59,926 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 14:12:59,926 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-16 14:12:59,926 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-16 14:12:59,928 INFO  L229       MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-16 14:12:59,928 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process
[2025-03-16 14:13:00,017 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 591 statements into 1 equivalence classes.
[2025-03-16 14:13:00,135 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 591 of 591 statements.
[2025-03-16 14:13:00,135 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 14:13:00,135 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 14:13:00,139 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1066 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-03-16 14:13:00,143 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-16 14:13:00,283 INFO  L134       CoverageAnalysis]: Checked inductivity of 1491 backedges. 1113 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked.
[2025-03-16 14:13:00,283 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-16 14:13:00,283 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1814768600] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 14:13:00,283 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-16 14:13:00,283 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6
[2025-03-16 14:13:00,284 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987470271]
[2025-03-16 14:13:00,284 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 14:13:00,284 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 14:13:00,284 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 14:13:00,284 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 14:13:00,284 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-03-16 14:13:00,284 INFO  L87              Difference]: Start difference. First operand 237525 states and 253635 transitions. Second operand  has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 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-16 14:13:01,681 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 14:13:01,681 INFO  L93              Difference]: Finished difference Result 472017 states and 504094 transitions.
[2025-03-16 14:13:01,682 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 14:13:01,682 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 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 591
[2025-03-16 14:13:01,682 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 14:13:01,956 INFO  L225             Difference]: With dead ends: 472017
[2025-03-16 14:13:01,957 INFO  L226             Difference]: Without dead ends: 234493
[2025-03-16 14:13:02,056 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 594 GetRequests, 590 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-03-16 14:13:02,056 INFO  L435           NwaCegarLoop]: 99 mSDtfsCounter, 162 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 582 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-16 14:13:02,056 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 115 Invalid, 655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 582 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-16 14:13:02,218 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 234493 states.
[2025-03-16 14:13:04,351 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 234493 to 225122.
[2025-03-16 14:13:04,488 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 225122 states, 225121 states have (on average 1.0604297244592908) internal successors, (238725), 225121 states have internal predecessors, (238725), 0 states have call successors, (0), 0 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-16 14:13:04,792 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 225122 states to 225122 states and 238725 transitions.
[2025-03-16 14:13:04,796 INFO  L78                 Accepts]: Start accepts. Automaton has 225122 states and 238725 transitions. Word has length 591
[2025-03-16 14:13:04,796 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 14:13:04,796 INFO  L471      AbstractCegarLoop]: Abstraction has 225122 states and 238725 transitions.
[2025-03-16 14:13:04,796 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 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-16 14:13:04,796 INFO  L276                IsEmpty]: Start isEmpty. Operand 225122 states and 238725 transitions.
[2025-03-16 14:13:05,257 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 593
[2025-03-16 14:13:05,257 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 14:13:05,257 INFO  L218           NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-16 14:13:05,264 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0
[2025-03-16 14:13:05,458 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-16 14:13:05,458 INFO  L396      AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 14:13:05,458 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 14:13:05,458 INFO  L85        PathProgramCache]: Analyzing trace with hash 1164162139, now seen corresponding path program 1 times
[2025-03-16 14:13:05,459 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 14:13:05,459 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537511501]
[2025-03-16 14:13:05,459 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 14:13:05,459 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 14:13:05,512 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 592 statements into 1 equivalence classes.
[2025-03-16 14:13:05,520 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 592 of 592 statements.
[2025-03-16 14:13:05,520 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 14:13:05,520 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 14:13:06,902 INFO  L134       CoverageAnalysis]: Checked inductivity of 1052 backedges. 203 proven. 6 refuted. 0 times theorem prover too weak. 843 trivial. 0 not checked.
[2025-03-16 14:13:06,903 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 14:13:06,903 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537511501]
[2025-03-16 14:13:06,903 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537511501] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-16 14:13:06,903 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1175676030]
[2025-03-16 14:13:06,903 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 14:13:06,903 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-16 14:13:06,903 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-16 14:13:06,906 INFO  L229       MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-16 14:13:06,907 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process
[2025-03-16 14:13:07,007 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 592 statements into 1 equivalence classes.
[2025-03-16 14:13:07,130 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 592 of 592 statements.
[2025-03-16 14:13:07,131 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 14:13:07,131 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 14:13:07,135 INFO  L256         TraceCheckSpWp]: Trace formula consists of 991 conjuncts, 3 conjuncts are in the unsatisfiable core
[2025-03-16 14:13:07,139 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-16 14:13:07,233 INFO  L134       CoverageAnalysis]: Checked inductivity of 1052 backedges. 813 proven. 0 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked.
[2025-03-16 14:13:07,233 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-16 14:13:07,233 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1175676030] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 14:13:07,233 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-16 14:13:07,234 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6
[2025-03-16 14:13:07,234 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782699457]
[2025-03-16 14:13:07,234 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 14:13:07,234 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 14:13:07,234 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 14:13:07,234 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 14:13:07,234 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-03-16 14:13:07,235 INFO  L87              Difference]: Start difference. First operand 225122 states and 238725 transitions. Second operand  has 3 states, 3 states have (on average 143.0) internal successors, (429), 3 states have internal predecessors, (429), 0 states have call successors, (0), 0 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-16 14:13:08,519 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 14:13:08,519 INFO  L93              Difference]: Finished difference Result 560631 states and 594332 transitions.
[2025-03-16 14:13:08,520 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 14:13:08,520 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 143.0) internal successors, (429), 3 states have internal predecessors, (429), 0 states have call successors, (0), 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 592
[2025-03-16 14:13:08,520 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 14:13:09,190 INFO  L225             Difference]: With dead ends: 560631
[2025-03-16 14:13:09,191 INFO  L226             Difference]: Without dead ends: 333886
[2025-03-16 14:13:09,259 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 595 GetRequests, 591 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-03-16 14:13:09,260 INFO  L435           NwaCegarLoop]: 616 mSDtfsCounter, 167 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 879 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-16 14:13:09,260 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 879 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-16 14:13:09,460 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 333886 states.