./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem18_label46.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/Problem18_label46.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 2a68bea7fd32ae89c685bcf877550bbd817c11891e4cf8a49181c142fa0679e6
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-8fc3dc6-m
[2025-03-16 15:26:03,495 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-03-16 15:26:03,545 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2025-03-16 15:26:03,548 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-03-16 15:26:03,549 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-03-16 15:26:03,565 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-03-16 15:26:03,566 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-03-16 15:26:03,566 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-03-16 15:26:03,566 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-03-16 15:26:03,566 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-03-16 15:26:03,567 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-03-16 15:26:03,567 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-03-16 15:26:03,567 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-03-16 15:26:03,567 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-03-16 15:26:03,567 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-03-16 15:26:03,568 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-03-16 15:26:03,568 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-03-16 15:26:03,569 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-03-16 15:26:03,569 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-03-16 15:26:03,569 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-03-16 15:26:03,569 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-03-16 15:26:03,569 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-03-16 15:26:03,569 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-03-16 15:26:03,569 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-03-16 15:26:03,569 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-03-16 15:26:03,569 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-03-16 15:26:03,569 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-03-16 15:26:03,569 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-03-16 15:26:03,569 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-03-16 15:26:03,569 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-03-16 15:26:03,569 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-03-16 15:26:03,569 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-03-16 15:26:03,569 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-16 15:26:03,569 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-03-16 15:26:03,569 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-03-16 15:26:03,569 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-03-16 15:26:03,569 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-03-16 15:26:03,570 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-03-16 15:26:03,570 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-03-16 15:26:03,570 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-03-16 15:26:03,570 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-03-16 15:26:03,570 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-03-16 15:26:03,570 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-03-16 15:26:03,570 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 -> 2a68bea7fd32ae89c685bcf877550bbd817c11891e4cf8a49181c142fa0679e6
[2025-03-16 15:26:03,801 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-03-16 15:26:03,809 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-03-16 15:26:03,811 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-03-16 15:26:03,812 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-03-16 15:26:03,812 INFO  L274        PluginConnector]: CDTParser initialized
[2025-03-16 15:26:03,813 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem18_label46.c
[2025-03-16 15:26:04,962 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9cafc1506/0dcfc46830fe4fbeace5e8398336337e/FLAGf07eae594
[2025-03-16 15:26:05,290 INFO  L384              CDTParser]: Found 1 translation units.
[2025-03-16 15:26:05,291 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem18_label46.c
[2025-03-16 15:26:05,315 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9cafc1506/0dcfc46830fe4fbeace5e8398336337e/FLAGf07eae594
[2025-03-16 15:26:05,535 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9cafc1506/0dcfc46830fe4fbeace5e8398336337e
[2025-03-16 15:26:05,536 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-03-16 15:26:05,537 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-03-16 15:26:05,538 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-03-16 15:26:05,538 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-03-16 15:26:05,541 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-03-16 15:26:05,542 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:26:05" (1/1) ...
[2025-03-16 15:26:05,542 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51acba19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:26:05, skipping insertion in model container
[2025-03-16 15:26:05,542 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:26:05" (1/1) ...
[2025-03-16 15:26:05,599 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-03-16 15:26:05,734 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/Problem18_label46.c[3974,3987]
[2025-03-16 15:26:06,062 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-16 15:26:06,074 INFO  L200         MainTranslator]: Completed pre-run
[2025-03-16 15:26:06,093 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/Problem18_label46.c[3974,3987]
[2025-03-16 15:26:06,288 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-16 15:26:06,304 INFO  L204         MainTranslator]: Completed translation
[2025-03-16 15:26:06,305 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:26:06 WrapperNode
[2025-03-16 15:26:06,305 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-03-16 15:26:06,306 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-03-16 15:26:06,306 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-03-16 15:26:06,306 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-03-16 15:26:06,310 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:26:06" (1/1) ...
[2025-03-16 15:26:06,345 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:26:06" (1/1) ...
[2025-03-16 15:26:06,511 INFO  L138                Inliner]: procedures = 16, calls = 10, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 4132
[2025-03-16 15:26:06,511 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-03-16 15:26:06,512 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-03-16 15:26:06,512 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-03-16 15:26:06,512 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-03-16 15:26:06,518 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:26:06" (1/1) ...
[2025-03-16 15:26:06,519 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:26:06" (1/1) ...
[2025-03-16 15:26:06,543 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:26:06" (1/1) ...
[2025-03-16 15:26:06,602 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 15:26:06,604 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:26:06" (1/1) ...
[2025-03-16 15:26:06,604 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:26:06" (1/1) ...
[2025-03-16 15:26:06,657 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:26:06" (1/1) ...
[2025-03-16 15:26:06,670 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:26:06" (1/1) ...
[2025-03-16 15:26:06,682 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:26:06" (1/1) ...
[2025-03-16 15:26:06,726 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:26:06" (1/1) ...
[2025-03-16 15:26:06,746 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-03-16 15:26:06,748 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-03-16 15:26:06,748 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-03-16 15:26:06,748 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-03-16 15:26:06,749 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:26:06" (1/1) ...
[2025-03-16 15:26:06,753 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-16 15:26:06,762 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-16 15:26:06,774 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 15:26:06,779 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 15:26:06,793 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-03-16 15:26:06,794 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-03-16 15:26:06,794 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-03-16 15:26:06,794 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-03-16 15:26:06,847 INFO  L256             CfgBuilder]: Building ICFG
[2025-03-16 15:26:06,848 INFO  L286             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-03-16 15:26:09,297 INFO  L1322  $ProcedureCfgBuilder]: dead code at ProgramPoint L1647: havoc calculate_output_#t~ret8#1;
[2025-03-16 15:26:09,297 INFO  L1322  $ProcedureCfgBuilder]: dead code at ProgramPoint L3060: havoc calculate_output2_#t~ret9#1;
[2025-03-16 15:26:09,441 INFO  L?                        ?]: Removed 639 outVars from TransFormulas that were not future-live.
[2025-03-16 15:26:09,441 INFO  L307             CfgBuilder]: Performing block encoding
[2025-03-16 15:26:09,467 INFO  L331             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-03-16 15:26:09,469 INFO  L336             CfgBuilder]: Removed 0 assume(true) statements.
[2025-03-16 15:26:09,469 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:26:09 BoogieIcfgContainer
[2025-03-16 15:26:09,469 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-03-16 15:26:09,473 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-03-16 15:26:09,473 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-03-16 15:26:09,476 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-03-16 15:26:09,476 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 03:26:05" (1/3) ...
[2025-03-16 15:26:09,476 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e73b5e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:26:09, skipping insertion in model container
[2025-03-16 15:26:09,477 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:26:06" (2/3) ...
[2025-03-16 15:26:09,477 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e73b5e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:26:09, skipping insertion in model container
[2025-03-16 15:26:09,477 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:26:09" (3/3) ...
[2025-03-16 15:26:09,477 INFO  L128   eAbstractionObserver]: Analyzing ICFG Problem18_label46.c
[2025-03-16 15:26:09,487 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-03-16 15:26:09,492 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG Problem18_label46.c that has 1 procedures, 696 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-03-16 15:26:09,557 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-03-16 15:26:09,567 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;@169aeab4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-03-16 15:26:09,568 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-03-16 15:26:09,573 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 696 states, 694 states have (on average 1.9913544668587897) internal successors, (1382), 695 states have internal predecessors, (1382), 0 states have call successors, (0), 0 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 15:26:09,578 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 36
[2025-03-16 15:26:09,579 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 15:26:09,579 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]
[2025-03-16 15:26:09,579 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 15:26:09,583 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 15:26:09,584 INFO  L85        PathProgramCache]: Analyzing trace with hash -1658166619, now seen corresponding path program 1 times
[2025-03-16 15:26:09,589 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 15:26:09,590 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160322571]
[2025-03-16 15:26:09,590 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 15:26:09,591 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 15:26:09,640 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes.
[2025-03-16 15:26:09,652 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements.
[2025-03-16 15:26:09,653 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 15:26:09,654 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 15:26:09,694 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 15:26:09,694 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 15:26:09,695 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160322571]
[2025-03-16 15:26:09,696 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160322571] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 15:26:09,696 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 15:26:09,696 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-16 15:26:09,697 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340611460]
[2025-03-16 15:26:09,698 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 15:26:09,700 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2025-03-16 15:26:09,701 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 15:26:09,712 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2025-03-16 15:26:09,713 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-03-16 15:26:09,716 INFO  L87              Difference]: Start difference. First operand  has 696 states, 694 states have (on average 1.9913544668587897) internal successors, (1382), 695 states have internal predecessors, (1382), 0 states have call successors, (0), 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 17.5) internal successors, (35), 2 states have internal predecessors, (35), 0 states have call successors, (0), 0 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 15:26:09,781 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 15:26:09,782 INFO  L93              Difference]: Finished difference Result 1391 states and 2763 transitions.
[2025-03-16 15:26:09,782 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2025-03-16 15:26:09,784 INFO  L78                 Accepts]: Start accepts. Automaton has  has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 0 states have call successors, (0), 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 35
[2025-03-16 15:26:09,785 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 15:26:09,793 INFO  L225             Difference]: With dead ends: 1391
[2025-03-16 15:26:09,793 INFO  L226             Difference]: Without dead ends: 693
[2025-03-16 15:26:09,796 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 15:26:09,798 INFO  L435           NwaCegarLoop]: 1320 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, 1320 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 15:26:09,800 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1320 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-16 15:26:09,813 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 693 states.
[2025-03-16 15:26:09,845 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 693.
[2025-03-16 15:26:09,847 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 693 states, 692 states have (on average 1.903179190751445) internal successors, (1317), 692 states have internal predecessors, (1317), 0 states have call successors, (0), 0 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 15:26:09,856 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 693 states and 1317 transitions.
[2025-03-16 15:26:09,857 INFO  L78                 Accepts]: Start accepts. Automaton has 693 states and 1317 transitions. Word has length 35
[2025-03-16 15:26:09,857 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 15:26:09,857 INFO  L471      AbstractCegarLoop]: Abstraction has 693 states and 1317 transitions.
[2025-03-16 15:26:09,858 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 0 states have call successors, (0), 0 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 15:26:09,858 INFO  L276                IsEmpty]: Start isEmpty. Operand 693 states and 1317 transitions.
[2025-03-16 15:26:09,858 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 36
[2025-03-16 15:26:09,859 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 15:26:09,859 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]
[2025-03-16 15:26:09,859 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2025-03-16 15:26:09,859 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 15:26:09,860 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 15:26:09,860 INFO  L85        PathProgramCache]: Analyzing trace with hash -337478783, now seen corresponding path program 1 times
[2025-03-16 15:26:09,860 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 15:26:09,860 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767524235]
[2025-03-16 15:26:09,860 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 15:26:09,861 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 15:26:09,867 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes.
[2025-03-16 15:26:09,892 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements.
[2025-03-16 15:26:09,892 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 15:26:09,892 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 15:26:10,006 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 15:26:10,008 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 15:26:10,008 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767524235]
[2025-03-16 15:26:10,008 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767524235] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 15:26:10,008 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 15:26:10,008 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-16 15:26:10,008 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196526233]
[2025-03-16 15:26:10,008 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 15:26:10,009 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 15:26:10,009 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 15:26:10,009 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 15:26:10,009 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 15:26:10,009 INFO  L87              Difference]: Start difference. First operand 693 states and 1317 transitions. Second operand  has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 2 states have internal predecessors, (35), 0 states have call successors, (0), 0 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 15:26:12,257 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 15:26:12,257 INFO  L93              Difference]: Finished difference Result 2075 states and 3948 transitions.
[2025-03-16 15:26:12,258 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 15:26:12,258 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 2 states have internal predecessors, (35), 0 states have call successors, (0), 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 35
[2025-03-16 15:26:12,258 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 15:26:12,263 INFO  L225             Difference]: With dead ends: 2075
[2025-03-16 15:26:12,263 INFO  L226             Difference]: Without dead ends: 1383
[2025-03-16 15:26:12,264 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 15:26:12,265 INFO  L435           NwaCegarLoop]: 430 mSDtfsCounter, 740 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1993 mSolverCounterSat, 673 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 740 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 2666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 673 IncrementalHoareTripleChecker+Valid, 1993 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time
[2025-03-16 15:26:12,265 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [740 Valid, 436 Invalid, 2666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [673 Valid, 1993 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time]
[2025-03-16 15:26:12,266 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1383 states.
[2025-03-16 15:26:12,286 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1383 to 1383.
[2025-03-16 15:26:12,288 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1383 states, 1382 states have (on average 1.5998552821997105) internal successors, (2211), 1382 states have internal predecessors, (2211), 0 states have call successors, (0), 0 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 15:26:12,291 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1383 states to 1383 states and 2211 transitions.
[2025-03-16 15:26:12,291 INFO  L78                 Accepts]: Start accepts. Automaton has 1383 states and 2211 transitions. Word has length 35
[2025-03-16 15:26:12,292 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 15:26:12,292 INFO  L471      AbstractCegarLoop]: Abstraction has 1383 states and 2211 transitions.
[2025-03-16 15:26:12,292 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 2 states have internal predecessors, (35), 0 states have call successors, (0), 0 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 15:26:12,292 INFO  L276                IsEmpty]: Start isEmpty. Operand 1383 states and 2211 transitions.
[2025-03-16 15:26:12,293 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 101
[2025-03-16 15:26:12,293 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 15:26:12,294 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:26:12,294 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-03-16 15:26:12,294 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 15:26:12,294 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 15:26:12,294 INFO  L85        PathProgramCache]: Analyzing trace with hash 469389044, now seen corresponding path program 1 times
[2025-03-16 15:26:12,295 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 15:26:12,295 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426137626]
[2025-03-16 15:26:12,295 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 15:26:12,295 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 15:26:12,314 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes.
[2025-03-16 15:26:12,341 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements.
[2025-03-16 15:26:12,344 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 15:26:12,344 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 15:26:12,469 INFO  L134       CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-16 15:26:12,469 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 15:26:12,469 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426137626]
[2025-03-16 15:26:12,469 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426137626] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 15:26:12,469 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 15:26:12,469 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-16 15:26:12,469 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116483076]
[2025-03-16 15:26:12,469 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 15:26:12,470 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 15:26:12,470 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 15:26:12,470 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 15:26:12,470 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 15:26:12,471 INFO  L87              Difference]: Start difference. First operand 1383 states and 2211 transitions. Second operand  has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 15:26:14,485 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 15:26:14,486 INFO  L93              Difference]: Finished difference Result 4145 states and 6630 transitions.
[2025-03-16 15:26:14,486 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 15:26:14,487 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100
[2025-03-16 15:26:14,487 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 15:26:14,495 INFO  L225             Difference]: With dead ends: 4145
[2025-03-16 15:26:14,495 INFO  L226             Difference]: Without dead ends: 2763
[2025-03-16 15:26:14,497 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 15:26:14,498 INFO  L435           NwaCegarLoop]: 523 mSDtfsCounter, 714 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1701 mSolverCounterSat, 918 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 714 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 2619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 918 IncrementalHoareTripleChecker+Valid, 1701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time
[2025-03-16 15:26:14,498 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [714 Valid, 528 Invalid, 2619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [918 Valid, 1701 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time]
[2025-03-16 15:26:14,500 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2763 states.
[2025-03-16 15:26:14,528 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2763 to 2763.
[2025-03-16 15:26:14,532 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2763 states, 2762 states have (on average 1.3504706734250542) internal successors, (3730), 2762 states have internal predecessors, (3730), 0 states have call successors, (0), 0 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 15:26:14,537 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2763 states to 2763 states and 3730 transitions.
[2025-03-16 15:26:14,538 INFO  L78                 Accepts]: Start accepts. Automaton has 2763 states and 3730 transitions. Word has length 100
[2025-03-16 15:26:14,539 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 15:26:14,539 INFO  L471      AbstractCegarLoop]: Abstraction has 2763 states and 3730 transitions.
[2025-03-16 15:26:14,540 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 15:26:14,540 INFO  L276                IsEmpty]: Start isEmpty. Operand 2763 states and 3730 transitions.
[2025-03-16 15:26:14,543 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 219
[2025-03-16 15:26:14,544 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 15:26:14,544 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-03-16 15:26:14,544 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-03-16 15:26:14,545 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 15:26:14,545 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 15:26:14,545 INFO  L85        PathProgramCache]: Analyzing trace with hash 1711096676, now seen corresponding path program 1 times
[2025-03-16 15:26:14,545 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 15:26:14,545 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899843778]
[2025-03-16 15:26:14,545 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 15:26:14,545 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 15:26:14,593 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes.
[2025-03-16 15:26:14,616 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements.
[2025-03-16 15:26:14,618 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 15:26:14,618 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 15:26:15,085 INFO  L134       CoverageAnalysis]: Checked inductivity of 131 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked.
[2025-03-16 15:26:15,087 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 15:26:15,087 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899843778]
[2025-03-16 15:26:15,087 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899843778] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 15:26:15,087 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 15:26:15,087 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-16 15:26:15,087 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886245265]
[2025-03-16 15:26:15,087 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 15:26:15,088 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-16 15:26:15,088 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 15:26:15,088 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-16 15:26:15,089 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-16 15:26:15,089 INFO  L87              Difference]: Start difference. First operand 2763 states and 3730 transitions. Second operand  has 4 states, 4 states have (on average 46.25) internal successors, (185), 3 states have internal predecessors, (185), 0 states have call successors, (0), 0 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 15:26:17,626 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 15:26:17,626 INFO  L93              Difference]: Finished difference Result 7595 states and 9793 transitions.
[2025-03-16 15:26:17,626 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-16 15:26:17,626 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 46.25) internal successors, (185), 3 states have internal predecessors, (185), 0 states have call successors, (0), 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 218
[2025-03-16 15:26:17,627 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 15:26:17,637 INFO  L225             Difference]: With dead ends: 7595
[2025-03-16 15:26:17,637 INFO  L226             Difference]: Without dead ends: 4833
[2025-03-16 15:26:17,639 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-03-16 15:26:17,640 INFO  L435           NwaCegarLoop]: 623 mSDtfsCounter, 1872 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 4348 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1872 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 4465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 4348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time
[2025-03-16 15:26:17,640 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1872 Valid, 640 Invalid, 4465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 4348 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time]
[2025-03-16 15:26:17,643 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 4833 states.
[2025-03-16 15:26:17,682 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 4833 to 4143.
[2025-03-16 15:26:17,687 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 4143 states, 4142 states have (on average 1.269917914051183) internal successors, (5260), 4142 states have internal predecessors, (5260), 0 states have call successors, (0), 0 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 15:26:17,693 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4143 states to 4143 states and 5260 transitions.
[2025-03-16 15:26:17,693 INFO  L78                 Accepts]: Start accepts. Automaton has 4143 states and 5260 transitions. Word has length 218
[2025-03-16 15:26:17,694 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 15:26:17,694 INFO  L471      AbstractCegarLoop]: Abstraction has 4143 states and 5260 transitions.
[2025-03-16 15:26:17,694 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 46.25) internal successors, (185), 3 states have internal predecessors, (185), 0 states have call successors, (0), 0 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 15:26:17,695 INFO  L276                IsEmpty]: Start isEmpty. Operand 4143 states and 5260 transitions.
[2025-03-16 15:26:17,699 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 335
[2025-03-16 15:26:17,699 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 15:26:17,700 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:26:17,700 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-03-16 15:26:17,700 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 15:26:17,701 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 15:26:17,701 INFO  L85        PathProgramCache]: Analyzing trace with hash -1482104841, now seen corresponding path program 1 times
[2025-03-16 15:26:17,701 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 15:26:17,701 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437239653]
[2025-03-16 15:26:17,701 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 15:26:17,701 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 15:26:17,732 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 334 statements into 1 equivalence classes.
[2025-03-16 15:26:17,762 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 334 of 334 statements.
[2025-03-16 15:26:17,762 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 15:26:17,763 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 15:26:18,109 INFO  L134       CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-16 15:26:18,109 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 15:26:18,109 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437239653]
[2025-03-16 15:26:18,109 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437239653] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-16 15:26:18,109 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [685056117]
[2025-03-16 15:26:18,109 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 15:26:18,110 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-16 15:26:18,110 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-16 15:26:18,111 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 15:26:18,113 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 15:26:18,157 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 334 statements into 1 equivalence classes.
[2025-03-16 15:26:18,203 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 334 of 334 statements.
[2025-03-16 15:26:18,203 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 15:26:18,203 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 15:26:18,206 INFO  L256         TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-03-16 15:26:18,213 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-16 15:26:18,549 INFO  L134       CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked.
[2025-03-16 15:26:18,550 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-16 15:26:18,550 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [685056117] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 15:26:18,550 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-16 15:26:18,550 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4
[2025-03-16 15:26:18,550 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912774294]
[2025-03-16 15:26:18,550 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 15:26:18,551 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 15:26:18,551 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 15:26:18,551 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 15:26:18,551 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-16 15:26:18,552 INFO  L87              Difference]: Start difference. First operand 4143 states and 5260 transitions. Second operand  has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 2 states have internal predecessors, (302), 0 states have call successors, (0), 0 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 15:26:20,315 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 15:26:20,316 INFO  L93              Difference]: Finished difference Result 12425 states and 15777 transitions.
[2025-03-16 15:26:20,316 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 15:26:20,320 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 2 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 334
[2025-03-16 15:26:20,320 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 15:26:20,338 INFO  L225             Difference]: With dead ends: 12425
[2025-03-16 15:26:20,339 INFO  L226             Difference]: Without dead ends: 8283
[2025-03-16 15:26:20,343 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 333 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 15:26:20,345 INFO  L435           NwaCegarLoop]: 543 mSDtfsCounter, 398 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2331 mSolverCounterSat, 457 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 549 SdHoareTripleChecker+Invalid, 2788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 457 IncrementalHoareTripleChecker+Valid, 2331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time
[2025-03-16 15:26:20,345 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [398 Valid, 549 Invalid, 2788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [457 Valid, 2331 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time]
[2025-03-16 15:26:20,352 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 8283 states.
[2025-03-16 15:26:20,413 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 8283 to 6903.
[2025-03-16 15:26:20,420 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 6903 states, 6902 states have (on average 1.2358736598087512) internal successors, (8530), 6902 states have internal predecessors, (8530), 0 states have call successors, (0), 0 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 15:26:20,432 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6903 states to 6903 states and 8530 transitions.
[2025-03-16 15:26:20,432 INFO  L78                 Accepts]: Start accepts. Automaton has 6903 states and 8530 transitions. Word has length 334
[2025-03-16 15:26:20,435 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 15:26:20,436 INFO  L471      AbstractCegarLoop]: Abstraction has 6903 states and 8530 transitions.
[2025-03-16 15:26:20,436 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 2 states have internal predecessors, (302), 0 states have call successors, (0), 0 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 15:26:20,436 INFO  L276                IsEmpty]: Start isEmpty. Operand 6903 states and 8530 transitions.
[2025-03-16 15:26:20,440 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 405
[2025-03-16 15:26:20,440 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 15:26:20,440 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:26:20,447 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2025-03-16 15:26:20,645 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-16 15:26:20,645 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 15:26:20,646 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 15:26:20,646 INFO  L85        PathProgramCache]: Analyzing trace with hash 1872505002, now seen corresponding path program 1 times
[2025-03-16 15:26:20,646 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 15:26:20,646 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198203906]
[2025-03-16 15:26:20,646 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 15:26:20,646 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 15:26:20,671 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 404 statements into 1 equivalence classes.
[2025-03-16 15:26:20,687 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 404 of 404 statements.
[2025-03-16 15:26:20,688 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 15:26:20,688 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 15:26:21,029 INFO  L134       CoverageAnalysis]: Checked inductivity of 355 backedges. 303 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked.
[2025-03-16 15:26:21,030 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 15:26:21,031 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198203906]
[2025-03-16 15:26:21,031 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198203906] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 15:26:21,031 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 15:26:21,031 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-16 15:26:21,031 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38739953]
[2025-03-16 15:26:21,031 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 15:26:21,032 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-16 15:26:21,032 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 15:26:21,032 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-16 15:26:21,032 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-16 15:26:21,033 INFO  L87              Difference]: Start difference. First operand 6903 states and 8530 transitions. Second operand  has 4 states, 4 states have (on average 88.5) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 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 15:26:22,907 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 15:26:22,907 INFO  L93              Difference]: Finished difference Result 15238 states and 18534 transitions.
[2025-03-16 15:26:22,907 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-16 15:26:22,907 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 88.5) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 404
[2025-03-16 15:26:22,908 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 15:26:22,923 INFO  L225             Difference]: With dead ends: 15238
[2025-03-16 15:26:22,924 INFO  L226             Difference]: Without dead ends: 8283
[2025-03-16 15:26:22,927 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 15:26:22,927 INFO  L435           NwaCegarLoop]: 624 mSDtfsCounter, 513 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 3037 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 513 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 3239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 3037 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time
[2025-03-16 15:26:22,928 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [513 Valid, 638 Invalid, 3239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 3037 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time]
[2025-03-16 15:26:22,932 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 8283 states.
[2025-03-16 15:26:22,994 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 8283 to 8283.
[2025-03-16 15:26:23,004 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 8283 states, 8282 states have (on average 1.15431055300652) internal successors, (9560), 8282 states have internal predecessors, (9560), 0 states have call successors, (0), 0 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 15:26:23,019 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8283 states to 8283 states and 9560 transitions.
[2025-03-16 15:26:23,019 INFO  L78                 Accepts]: Start accepts. Automaton has 8283 states and 9560 transitions. Word has length 404
[2025-03-16 15:26:23,019 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 15:26:23,019 INFO  L471      AbstractCegarLoop]: Abstraction has 8283 states and 9560 transitions.
[2025-03-16 15:26:23,020 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 88.5) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 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 15:26:23,020 INFO  L276                IsEmpty]: Start isEmpty. Operand 8283 states and 9560 transitions.
[2025-03-16 15:26:23,025 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 420
[2025-03-16 15:26:23,025 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 15:26:23,026 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:26:23,026 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-03-16 15:26:23,026 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 15:26:23,027 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 15:26:23,027 INFO  L85        PathProgramCache]: Analyzing trace with hash 951814476, now seen corresponding path program 1 times
[2025-03-16 15:26:23,027 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 15:26:23,027 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289756073]
[2025-03-16 15:26:23,027 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 15:26:23,027 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 15:26:23,052 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 419 statements into 1 equivalence classes.
[2025-03-16 15:26:23,070 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 419 of 419 statements.
[2025-03-16 15:26:23,070 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 15:26:23,070 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 15:26:23,247 INFO  L134       CoverageAnalysis]: Checked inductivity of 151 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked.
[2025-03-16 15:26:23,247 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 15:26:23,247 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289756073]
[2025-03-16 15:26:23,248 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289756073] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 15:26:23,248 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 15:26:23,248 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-16 15:26:23,248 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027129287]
[2025-03-16 15:26:23,248 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 15:26:23,248 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 15:26:23,248 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 15:26:23,249 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 15:26:23,249 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 15:26:23,249 INFO  L87              Difference]: Start difference. First operand 8283 states and 9560 transitions. Second operand  has 3 states, 3 states have (on average 112.0) internal successors, (336), 2 states have internal predecessors, (336), 0 states have call successors, (0), 0 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 15:26:24,661 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 15:26:24,661 INFO  L93              Difference]: Finished difference Result 20015 states and 22948 transitions.
[2025-03-16 15:26:24,661 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 15:26:24,662 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 112.0) internal successors, (336), 2 states have internal predecessors, (336), 0 states have call successors, (0), 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 419
[2025-03-16 15:26:24,662 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 15:26:24,682 INFO  L225             Difference]: With dead ends: 20015
[2025-03-16 15:26:24,683 INFO  L226             Difference]: Without dead ends: 11733
[2025-03-16 15:26:24,689 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 15:26:24,690 INFO  L435           NwaCegarLoop]: 71 mSDtfsCounter, 466 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1791 mSolverCounterSat, 517 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 2308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 517 IncrementalHoareTripleChecker+Valid, 1791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time
[2025-03-16 15:26:24,690 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [466 Valid, 76 Invalid, 2308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [517 Valid, 1791 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time]
[2025-03-16 15:26:24,696 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 11733 states.
[2025-03-16 15:26:24,769 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 11733 to 11733.
[2025-03-16 15:26:24,783 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 11733 states, 11732 states have (on average 1.1191612683259462) internal successors, (13130), 11732 states have internal predecessors, (13130), 0 states have call successors, (0), 0 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 15:26:24,799 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11733 states to 11733 states and 13130 transitions.
[2025-03-16 15:26:24,799 INFO  L78                 Accepts]: Start accepts. Automaton has 11733 states and 13130 transitions. Word has length 419
[2025-03-16 15:26:24,800 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 15:26:24,801 INFO  L471      AbstractCegarLoop]: Abstraction has 11733 states and 13130 transitions.
[2025-03-16 15:26:24,801 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 112.0) internal successors, (336), 2 states have internal predecessors, (336), 0 states have call successors, (0), 0 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 15:26:24,801 INFO  L276                IsEmpty]: Start isEmpty. Operand 11733 states and 13130 transitions.
[2025-03-16 15:26:24,804 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 428
[2025-03-16 15:26:24,804 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 15:26:24,805 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:26:24,805 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-03-16 15:26:24,805 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 15:26:24,805 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 15:26:24,806 INFO  L85        PathProgramCache]: Analyzing trace with hash -1816272968, now seen corresponding path program 1 times
[2025-03-16 15:26:24,806 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 15:26:24,806 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505324692]
[2025-03-16 15:26:24,806 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 15:26:24,806 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 15:26:24,836 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 427 statements into 1 equivalence classes.
[2025-03-16 15:26:24,851 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 427 of 427 statements.
[2025-03-16 15:26:24,852 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 15:26:24,852 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 15:26:25,160 INFO  L134       CoverageAnalysis]: Checked inductivity of 159 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-16 15:26:25,161 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 15:26:25,161 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505324692]
[2025-03-16 15:26:25,161 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505324692] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 15:26:25,161 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 15:26:25,161 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-16 15:26:25,161 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403628056]
[2025-03-16 15:26:25,161 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 15:26:25,162 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 15:26:25,162 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 15:26:25,162 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 15:26:25,162 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 15:26:25,163 INFO  L87              Difference]: Start difference. First operand 11733 states and 13130 transitions. Second operand  has 3 states, 3 states have (on average 142.33333333333334) internal successors, (427), 3 states have internal predecessors, (427), 0 states have call successors, (0), 0 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 15:26:26,612 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 15:26:26,613 INFO  L93              Difference]: Finished difference Result 32435 states and 36565 transitions.
[2025-03-16 15:26:26,614 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 15:26:26,614 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 142.33333333333334) internal successors, (427), 3 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 427
[2025-03-16 15:26:26,615 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 15:26:26,643 INFO  L225             Difference]: With dead ends: 32435
[2025-03-16 15:26:26,644 INFO  L226             Difference]: Without dead ends: 20703
[2025-03-16 15:26:26,654 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 15:26:26,655 INFO  L435           NwaCegarLoop]: 971 mSDtfsCounter, 601 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1955 mSolverCounterSat, 349 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 601 SdHoareTripleChecker+Valid, 976 SdHoareTripleChecker+Invalid, 2304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 349 IncrementalHoareTripleChecker+Valid, 1955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time
[2025-03-16 15:26:26,655 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [601 Valid, 976 Invalid, 2304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [349 Valid, 1955 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time]
[2025-03-16 15:26:26,672 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 20703 states.
[2025-03-16 15:26:26,852 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 20703 to 20703.
[2025-03-16 15:26:26,867 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 20703 states, 20702 states have (on average 1.0932277074678776) internal successors, (22632), 20702 states have internal predecessors, (22632), 0 states have call successors, (0), 0 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 15:26:26,891 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 20703 states to 20703 states and 22632 transitions.
[2025-03-16 15:26:26,892 INFO  L78                 Accepts]: Start accepts. Automaton has 20703 states and 22632 transitions. Word has length 427
[2025-03-16 15:26:26,892 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 15:26:26,892 INFO  L471      AbstractCegarLoop]: Abstraction has 20703 states and 22632 transitions.
[2025-03-16 15:26:26,893 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 142.33333333333334) internal successors, (427), 3 states have internal predecessors, (427), 0 states have call successors, (0), 0 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 15:26:26,893 INFO  L276                IsEmpty]: Start isEmpty. Operand 20703 states and 22632 transitions.
[2025-03-16 15:26:26,899 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 435
[2025-03-16 15:26:26,899 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 15:26:26,900 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:26:26,900 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-03-16 15:26:26,900 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 15:26:26,901 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 15:26:26,901 INFO  L85        PathProgramCache]: Analyzing trace with hash -1732770505, now seen corresponding path program 1 times
[2025-03-16 15:26:26,901 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 15:26:26,902 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571865613]
[2025-03-16 15:26:26,902 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 15:26:26,902 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 15:26:26,939 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 434 statements into 1 equivalence classes.
[2025-03-16 15:26:26,962 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 434 of 434 statements.
[2025-03-16 15:26:26,962 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 15:26:26,962 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 15:26:27,107 INFO  L134       CoverageAnalysis]: Checked inductivity of 159 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked.
[2025-03-16 15:26:27,107 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 15:26:27,107 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571865613]
[2025-03-16 15:26:27,107 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571865613] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 15:26:27,107 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 15:26:27,107 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-16 15:26:27,107 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460549790]
[2025-03-16 15:26:27,107 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 15:26:27,107 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 15:26:27,107 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 15:26:27,108 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 15:26:27,108 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 15:26:27,108 INFO  L87              Difference]: Start difference. First operand 20703 states and 22632 transitions. Second operand  has 3 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 0 states have call successors, (0), 0 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 15:26:28,855 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 15:26:28,855 INFO  L93              Difference]: Finished difference Result 48305 states and 53265 transitions.
[2025-03-16 15:26:28,855 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 15:26:28,855 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 0 states have call successors, (0), 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 434
[2025-03-16 15:26:28,856 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 15:26:28,891 INFO  L225             Difference]: With dead ends: 48305
[2025-03-16 15:26:28,891 INFO  L226             Difference]: Without dead ends: 27603
[2025-03-16 15:26:28,904 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 15:26:28,904 INFO  L435           NwaCegarLoop]: 1110 mSDtfsCounter, 664 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1874 mSolverCounterSat, 495 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 664 SdHoareTripleChecker+Valid, 1116 SdHoareTripleChecker+Invalid, 2369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 495 IncrementalHoareTripleChecker+Valid, 1874 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time
[2025-03-16 15:26:28,905 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [664 Valid, 1116 Invalid, 2369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [495 Valid, 1874 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time]
[2025-03-16 15:26:28,923 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 27603 states.
[2025-03-16 15:26:29,087 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 27603 to 26913.
[2025-03-16 15:26:29,107 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 26913 states, 26912 states have (on average 1.0879161712247325) internal successors, (29278), 26912 states have internal predecessors, (29278), 0 states have call successors, (0), 0 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 15:26:29,132 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 26913 states to 26913 states and 29278 transitions.
[2025-03-16 15:26:29,132 INFO  L78                 Accepts]: Start accepts. Automaton has 26913 states and 29278 transitions. Word has length 434
[2025-03-16 15:26:29,133 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 15:26:29,133 INFO  L471      AbstractCegarLoop]: Abstraction has 26913 states and 29278 transitions.
[2025-03-16 15:26:29,133 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 0 states have call successors, (0), 0 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 15:26:29,133 INFO  L276                IsEmpty]: Start isEmpty. Operand 26913 states and 29278 transitions.
[2025-03-16 15:26:29,135 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 460
[2025-03-16 15:26:29,135 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 15:26:29,135 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-16 15:26:29,135 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-03-16 15:26:29,136 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 15:26:29,136 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 15:26:29,136 INFO  L85        PathProgramCache]: Analyzing trace with hash -1883410328, now seen corresponding path program 1 times
[2025-03-16 15:26:29,136 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 15:26:29,136 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106010013]
[2025-03-16 15:26:29,136 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 15:26:29,136 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 15:26:29,161 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 459 statements into 1 equivalence classes.
[2025-03-16 15:26:29,175 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 459 of 459 statements.
[2025-03-16 15:26:29,175 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 15:26:29,176 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 15:26:29,648 INFO  L134       CoverageAnalysis]: Checked inductivity of 184 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked.
[2025-03-16 15:26:29,648 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 15:26:29,648 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106010013]
[2025-03-16 15:26:29,648 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106010013] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 15:26:29,648 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 15:26:29,648 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-16 15:26:29,649 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809849764]
[2025-03-16 15:26:29,649 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 15:26:29,649 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 15:26:29,649 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 15:26:29,650 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 15:26:29,650 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 15:26:29,650 INFO  L87              Difference]: Start difference. First operand 26913 states and 29278 transitions. Second operand  has 3 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 0 states have call successors, (0), 0 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 15:26:31,032 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 15:26:31,032 INFO  L93              Difference]: Finished difference Result 53825 states and 58555 transitions.
[2025-03-16 15:26:31,032 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 15:26:31,032 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 0 states have call successors, (0), 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 459
[2025-03-16 15:26:31,033 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 15:26:31,062 INFO  L225             Difference]: With dead ends: 53825
[2025-03-16 15:26:31,062 INFO  L226             Difference]: Without dead ends: 26913
[2025-03-16 15:26:31,080 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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 15:26:31,081 INFO  L435           NwaCegarLoop]: 772 mSDtfsCounter, 761 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1974 mSolverCounterSat, 191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 761 SdHoareTripleChecker+Valid, 778 SdHoareTripleChecker+Invalid, 2165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 1974 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time
[2025-03-16 15:26:31,081 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [761 Valid, 778 Invalid, 2165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 1974 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time]
[2025-03-16 15:26:31,097 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 26913 states.
[2025-03-16 15:26:31,352 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 26913 to 26913.
[2025-03-16 15:26:31,375 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 26913 states, 26912 states have (on average 1.0729785969084424) internal successors, (28876), 26912 states have internal predecessors, (28876), 0 states have call successors, (0), 0 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 15:26:31,410 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 26913 states to 26913 states and 28876 transitions.
[2025-03-16 15:26:31,410 INFO  L78                 Accepts]: Start accepts. Automaton has 26913 states and 28876 transitions. Word has length 459
[2025-03-16 15:26:31,412 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 15:26:31,412 INFO  L471      AbstractCegarLoop]: Abstraction has 26913 states and 28876 transitions.
[2025-03-16 15:26:31,412 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 0 states have call successors, (0), 0 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 15:26:31,412 INFO  L276                IsEmpty]: Start isEmpty. Operand 26913 states and 28876 transitions.
[2025-03-16 15:26:31,419 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 578
[2025-03-16 15:26:31,419 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 15:26:31,420 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:26:31,420 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-03-16 15:26:31,420 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 15:26:31,421 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 15:26:31,421 INFO  L85        PathProgramCache]: Analyzing trace with hash -1216066865, now seen corresponding path program 1 times
[2025-03-16 15:26:31,421 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 15:26:31,421 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630482617]
[2025-03-16 15:26:31,421 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 15:26:31,421 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 15:26:31,465 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 577 statements into 1 equivalence classes.
[2025-03-16 15:26:31,492 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 577 of 577 statements.
[2025-03-16 15:26:31,493 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 15:26:31,493 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 15:26:31,766 INFO  L134       CoverageAnalysis]: Checked inductivity of 595 backedges. 377 proven. 0 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked.
[2025-03-16 15:26:31,766 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 15:26:31,766 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630482617]
[2025-03-16 15:26:31,766 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630482617] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 15:26:31,766 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 15:26:31,767 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-16 15:26:31,767 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672546277]
[2025-03-16 15:26:31,767 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 15:26:31,767 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 15:26:31,767 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 15:26:31,768 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 15:26:31,768 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 15:26:31,768 INFO  L87              Difference]: Start difference. First operand 26913 states and 28876 transitions. Second operand  has 3 states, 3 states have (on average 142.33333333333334) internal successors, (427), 3 states have internal predecessors, (427), 0 states have call successors, (0), 0 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 15:26:33,442 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 15:26:33,442 INFO  L93              Difference]: Finished difference Result 59345 states and 64127 transitions.
[2025-03-16 15:26:33,442 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 15:26:33,442 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 142.33333333333334) internal successors, (427), 3 states have internal predecessors, (427), 0 states have call successors, (0), 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 577
[2025-03-16 15:26:33,442 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 15:26:33,473 INFO  L225             Difference]: With dead ends: 59345
[2025-03-16 15:26:33,474 INFO  L226             Difference]: Without dead ends: 32433
[2025-03-16 15:26:33,483 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 15:26:33,484 INFO  L435           NwaCegarLoop]: 412 mSDtfsCounter, 602 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2070 mSolverCounterSat, 287 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 602 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 2357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 287 IncrementalHoareTripleChecker+Valid, 2070 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time
[2025-03-16 15:26:33,484 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [602 Valid, 418 Invalid, 2357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [287 Valid, 2070 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time]
[2025-03-16 15:26:33,503 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 32433 states.
[2025-03-16 15:26:33,683 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 32433 to 31743.
[2025-03-16 15:26:33,705 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 31743 states, 31742 states have (on average 1.0726482263247432) internal successors, (34048), 31742 states have internal predecessors, (34048), 0 states have call successors, (0), 0 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 15:26:33,733 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 31743 states to 31743 states and 34048 transitions.
[2025-03-16 15:26:33,733 INFO  L78                 Accepts]: Start accepts. Automaton has 31743 states and 34048 transitions. Word has length 577
[2025-03-16 15:26:33,734 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 15:26:33,734 INFO  L471      AbstractCegarLoop]: Abstraction has 31743 states and 34048 transitions.
[2025-03-16 15:26:33,734 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 142.33333333333334) internal successors, (427), 3 states have internal predecessors, (427), 0 states have call successors, (0), 0 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 15:26:33,734 INFO  L276                IsEmpty]: Start isEmpty. Operand 31743 states and 34048 transitions.
[2025-03-16 15:26:33,742 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1105
[2025-03-16 15:26:33,743 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 15:26:33,743 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:26:33,743 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-03-16 15:26:33,743 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 15:26:33,744 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 15:26:33,744 INFO  L85        PathProgramCache]: Analyzing trace with hash 991019983, now seen corresponding path program 1 times
[2025-03-16 15:26:33,744 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 15:26:33,744 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752522063]
[2025-03-16 15:26:33,744 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 15:26:33,744 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 15:26:33,798 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1104 statements into 1 equivalence classes.
[2025-03-16 15:26:33,828 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1104 of 1104 statements.
[2025-03-16 15:26:33,828 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 15:26:33,828 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 15:26:34,941 INFO  L134       CoverageAnalysis]: Checked inductivity of 1227 backedges. 530 proven. 612 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked.
[2025-03-16 15:26:34,942 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 15:26:34,942 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752522063]
[2025-03-16 15:26:34,942 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752522063] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-16 15:26:34,942 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1363020974]
[2025-03-16 15:26:34,942 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 15:26:34,942 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-16 15:26:34,942 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-16 15:26:34,944 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 15:26:34,946 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 15:26:35,024 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1104 statements into 1 equivalence classes.
[2025-03-16 15:26:35,148 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1104 of 1104 statements.
[2025-03-16 15:26:35,149 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 15:26:35,149 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 15:26:35,154 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1294 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-03-16 15:26:35,170 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-16 15:26:35,266 INFO  L134       CoverageAnalysis]: Checked inductivity of 1227 backedges. 504 proven. 0 refuted. 0 times theorem prover too weak. 723 trivial. 0 not checked.
[2025-03-16 15:26:35,266 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-16 15:26:35,266 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1363020974] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 15:26:35,267 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-16 15:26:35,267 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9
[2025-03-16 15:26:35,267 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493006263]
[2025-03-16 15:26:35,267 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 15:26:35,268 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 15:26:35,268 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 15:26:35,268 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 15:26:35,268 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72
[2025-03-16 15:26:35,269 INFO  L87              Difference]: Start difference. First operand 31743 states and 34048 transitions. Second operand  has 3 states, 3 states have (on average 212.66666666666666) internal successors, (638), 3 states have internal predecessors, (638), 0 states have call successors, (0), 0 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 15:26:36,817 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 15:26:36,817 INFO  L93              Difference]: Finished difference Result 71075 states and 77003 transitions.
[2025-03-16 15:26:36,818 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 15:26:36,818 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 212.66666666666666) internal successors, (638), 3 states have internal predecessors, (638), 0 states have call successors, (0), 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 1104
[2025-03-16 15:26:36,819 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 15:26:36,856 INFO  L225             Difference]: With dead ends: 71075
[2025-03-16 15:26:36,856 INFO  L226             Difference]: Without dead ends: 39333
[2025-03-16 15:26:36,872 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 1111 GetRequests, 1104 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72
[2025-03-16 15:26:36,872 INFO  L435           NwaCegarLoop]: 159 mSDtfsCounter, 698 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1821 mSolverCounterSat, 481 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 698 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 2302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 481 IncrementalHoareTripleChecker+Valid, 1821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time
[2025-03-16 15:26:36,873 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [698 Valid, 164 Invalid, 2302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [481 Valid, 1821 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time]
[2025-03-16 15:26:36,899 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 39333 states.
[2025-03-16 15:26:37,226 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 39333 to 39333.
[2025-03-16 15:26:37,251 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 39333 states, 39332 states have (on average 1.0739092850605105) internal successors, (42239), 39332 states have internal predecessors, (42239), 0 states have call successors, (0), 0 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 15:26:37,299 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 39333 states to 39333 states and 42239 transitions.
[2025-03-16 15:26:37,300 INFO  L78                 Accepts]: Start accepts. Automaton has 39333 states and 42239 transitions. Word has length 1104
[2025-03-16 15:26:37,301 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 15:26:37,301 INFO  L471      AbstractCegarLoop]: Abstraction has 39333 states and 42239 transitions.
[2025-03-16 15:26:37,301 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 212.66666666666666) internal successors, (638), 3 states have internal predecessors, (638), 0 states have call successors, (0), 0 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 15:26:37,301 INFO  L276                IsEmpty]: Start isEmpty. Operand 39333 states and 42239 transitions.
[2025-03-16 15:26:37,316 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1111
[2025-03-16 15:26:37,316 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 15:26:37,317 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:26:37,324 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 15:26:37,517 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,SelfDestructingSolverStorable11
[2025-03-16 15:26:37,518 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 15:26:37,518 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 15:26:37,518 INFO  L85        PathProgramCache]: Analyzing trace with hash -2034767296, now seen corresponding path program 1 times
[2025-03-16 15:26:37,518 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 15:26:37,518 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364721209]
[2025-03-16 15:26:37,519 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 15:26:37,519 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 15:26:37,603 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1110 statements into 1 equivalence classes.
[2025-03-16 15:26:37,649 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1110 of 1110 statements.
[2025-03-16 15:26:37,650 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 15:26:37,650 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 15:26:38,630 INFO  L134       CoverageAnalysis]: Checked inductivity of 1242 backedges. 430 proven. 555 refuted. 0 times theorem prover too weak. 257 trivial. 0 not checked.
[2025-03-16 15:26:38,630 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 15:26:38,630 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364721209]
[2025-03-16 15:26:38,630 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364721209] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-16 15:26:38,631 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [405927476]
[2025-03-16 15:26:38,631 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 15:26:38,631 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-16 15:26:38,631 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-16 15:26:38,633 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 15:26:38,634 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 15:26:38,711 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1110 statements into 1 equivalence classes.
[2025-03-16 15:26:38,850 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1110 of 1110 statements.
[2025-03-16 15:26:38,850 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 15:26:38,850 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 15:26:38,854 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1302 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-03-16 15:26:38,862 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-16 15:26:38,958 INFO  L134       CoverageAnalysis]: Checked inductivity of 1242 backedges. 519 proven. 0 refuted. 0 times theorem prover too weak. 723 trivial. 0 not checked.
[2025-03-16 15:26:38,958 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-16 15:26:38,958 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [405927476] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 15:26:38,958 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-16 15:26:38,958 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7
[2025-03-16 15:26:38,959 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99227269]
[2025-03-16 15:26:38,959 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 15:26:38,961 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 15:26:38,961 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 15:26:38,961 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 15:26:38,961 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2025-03-16 15:26:38,962 INFO  L87              Difference]: Start difference. First operand 39333 states and 42239 transitions. Second operand  has 3 states, 3 states have (on average 214.66666666666666) internal successors, (644), 3 states have internal predecessors, (644), 0 states have call successors, (0), 0 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 15:26:40,460 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 15:26:40,460 INFO  L93              Difference]: Finished difference Result 92465 states and 99931 transitions.
[2025-03-16 15:26:40,461 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 15:26:40,461 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 214.66666666666666) internal successors, (644), 3 states have internal predecessors, (644), 0 states have call successors, (0), 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 1110
[2025-03-16 15:26:40,462 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 15:26:40,511 INFO  L225             Difference]: With dead ends: 92465
[2025-03-16 15:26:40,512 INFO  L226             Difference]: Without dead ends: 46923
[2025-03-16 15:26:40,538 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 1115 GetRequests, 1110 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2025-03-16 15:26:40,538 INFO  L435           NwaCegarLoop]: 967 mSDtfsCounter, 647 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1703 mSolverCounterSat, 568 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 647 SdHoareTripleChecker+Valid, 973 SdHoareTripleChecker+Invalid, 2271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 568 IncrementalHoareTripleChecker+Valid, 1703 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time
[2025-03-16 15:26:40,538 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [647 Valid, 973 Invalid, 2271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [568 Valid, 1703 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time]
[2025-03-16 15:26:40,570 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 46923 states.
[2025-03-16 15:26:40,883 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 46923 to 44163.
[2025-03-16 15:26:40,911 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 44163 states, 44162 states have (on average 1.0473936868801232) internal successors, (46255), 44162 states have internal predecessors, (46255), 0 states have call successors, (0), 0 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 15:26:40,945 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 44163 states to 44163 states and 46255 transitions.
[2025-03-16 15:26:40,945 INFO  L78                 Accepts]: Start accepts. Automaton has 44163 states and 46255 transitions. Word has length 1110
[2025-03-16 15:26:40,946 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 15:26:40,946 INFO  L471      AbstractCegarLoop]: Abstraction has 44163 states and 46255 transitions.
[2025-03-16 15:26:40,946 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 214.66666666666666) internal successors, (644), 3 states have internal predecessors, (644), 0 states have call successors, (0), 0 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 15:26:40,946 INFO  L276                IsEmpty]: Start isEmpty. Operand 44163 states and 46255 transitions.
[2025-03-16 15:26:40,963 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1323
[2025-03-16 15:26:40,963 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 15:26:40,963 INFO  L218           NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:26:40,970 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2025-03-16 15:26:41,164 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-16 15:26:41,165 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 15:26:41,165 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 15:26:41,166 INFO  L85        PathProgramCache]: Analyzing trace with hash -860441179, now seen corresponding path program 1 times
[2025-03-16 15:26:41,166 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 15:26:41,166 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222565422]
[2025-03-16 15:26:41,166 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 15:26:41,166 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 15:26:41,222 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1322 statements into 1 equivalence classes.
[2025-03-16 15:26:41,250 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1322 of 1322 statements.
[2025-03-16 15:26:41,250 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 15:26:41,250 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 15:26:42,059 INFO  L134       CoverageAnalysis]: Checked inductivity of 2026 backedges. 1342 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked.
[2025-03-16 15:26:42,059 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 15:26:42,059 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222565422]
[2025-03-16 15:26:42,059 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222565422] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 15:26:42,059 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 15:26:42,059 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-16 15:26:42,060 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450873638]
[2025-03-16 15:26:42,060 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 15:26:42,060 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-16 15:26:42,060 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 15:26:42,061 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-16 15:26:42,061 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-16 15:26:42,061 INFO  L87              Difference]: Start difference. First operand 44163 states and 46255 transitions. Second operand  has 4 states, 4 states have (on average 198.5) internal successors, (794), 3 states have internal predecessors, (794), 0 states have call successors, (0), 0 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 15:26:43,800 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 15:26:43,801 INFO  L93              Difference]: Finished difference Result 88325 states and 92509 transitions.
[2025-03-16 15:26:43,801 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-16 15:26:43,801 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 198.5) internal successors, (794), 3 states have internal predecessors, (794), 0 states have call successors, (0), 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 1322
[2025-03-16 15:26:43,802 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 15:26:43,844 INFO  L225             Difference]: With dead ends: 88325
[2025-03-16 15:26:43,844 INFO  L226             Difference]: Without dead ends: 44853
[2025-03-16 15:26:43,869 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 15:26:43,869 INFO  L435           NwaCegarLoop]: 73 mSDtfsCounter, 975 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 2690 mSolverCounterSat, 285 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 975 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 2975 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 285 IncrementalHoareTripleChecker+Valid, 2690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time
[2025-03-16 15:26:43,869 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [975 Valid, 84 Invalid, 2975 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [285 Valid, 2690 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time]
[2025-03-16 15:26:43,897 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 44853 states.
[2025-03-16 15:26:44,113 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 44853 to 44163.
[2025-03-16 15:26:44,139 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 44163 states, 44162 states have (on average 1.0471898917621485) internal successors, (46246), 44162 states have internal predecessors, (46246), 0 states have call successors, (0), 0 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 15:26:44,172 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 44163 states to 44163 states and 46246 transitions.
[2025-03-16 15:26:44,172 INFO  L78                 Accepts]: Start accepts. Automaton has 44163 states and 46246 transitions. Word has length 1322
[2025-03-16 15:26:44,173 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 15:26:44,173 INFO  L471      AbstractCegarLoop]: Abstraction has 44163 states and 46246 transitions.
[2025-03-16 15:26:44,173 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 198.5) internal successors, (794), 3 states have internal predecessors, (794), 0 states have call successors, (0), 0 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 15:26:44,173 INFO  L276                IsEmpty]: Start isEmpty. Operand 44163 states and 46246 transitions.
[2025-03-16 15:26:44,189 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1344
[2025-03-16 15:26:44,189 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 15:26:44,189 INFO  L218           NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:26:44,190 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2025-03-16 15:26:44,190 INFO  L396      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 15:26:44,190 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 15:26:44,190 INFO  L85        PathProgramCache]: Analyzing trace with hash 714489597, now seen corresponding path program 1 times
[2025-03-16 15:26:44,190 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 15:26:44,190 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85812230]
[2025-03-16 15:26:44,191 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 15:26:44,191 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 15:26:44,298 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1343 statements into 1 equivalence classes.
[2025-03-16 15:26:44,332 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1343 of 1343 statements.
[2025-03-16 15:26:44,332 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 15:26:44,332 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 15:26:44,744 INFO  L134       CoverageAnalysis]: Checked inductivity of 1993 backedges. 1236 proven. 0 refuted. 0 times theorem prover too weak. 757 trivial. 0 not checked.
[2025-03-16 15:26:44,744 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 15:26:44,745 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85812230]
[2025-03-16 15:26:44,745 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85812230] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 15:26:44,745 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 15:26:44,745 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-16 15:26:44,745 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142426123]
[2025-03-16 15:26:44,745 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 15:26:44,746 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 15:26:44,746 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 15:26:44,746 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 15:26:44,746 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 15:26:44,746 INFO  L87              Difference]: Start difference. First operand 44163 states and 46246 transitions. Second operand  has 3 states, 3 states have (on average 281.3333333333333) internal successors, (844), 3 states have internal predecessors, (844), 0 states have call successors, (0), 0 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 15:26:46,105 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 15:26:46,105 INFO  L93              Difference]: Finished difference Result 96605 states and 101587 transitions.
[2025-03-16 15:26:46,105 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 15:26:46,105 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 281.3333333333333) internal successors, (844), 3 states have internal predecessors, (844), 0 states have call successors, (0), 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 1343
[2025-03-16 15:26:46,106 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 15:26:46,158 INFO  L225             Difference]: With dead ends: 96605
[2025-03-16 15:26:46,158 INFO  L226             Difference]: Without dead ends: 53133
[2025-03-16 15:26:46,185 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 15:26:46,185 INFO  L435           NwaCegarLoop]: 945 mSDtfsCounter, 455 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1759 mSolverCounterSat, 217 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 455 SdHoareTripleChecker+Valid, 951 SdHoareTripleChecker+Invalid, 1976 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 217 IncrementalHoareTripleChecker+Valid, 1759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time
[2025-03-16 15:26:46,185 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [455 Valid, 951 Invalid, 1976 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [217 Valid, 1759 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2025-03-16 15:26:46,216 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 53133 states.
[2025-03-16 15:26:46,634 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 53133 to 53133.
[2025-03-16 15:26:46,672 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 53133 states, 53132 states have (on average 1.0446999924715803) internal successors, (55507), 53132 states have internal predecessors, (55507), 0 states have call successors, (0), 0 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 15:26:46,735 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 53133 states to 53133 states and 55507 transitions.
[2025-03-16 15:26:46,736 INFO  L78                 Accepts]: Start accepts. Automaton has 53133 states and 55507 transitions. Word has length 1343
[2025-03-16 15:26:46,736 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 15:26:46,736 INFO  L471      AbstractCegarLoop]: Abstraction has 53133 states and 55507 transitions.
[2025-03-16 15:26:46,737 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 281.3333333333333) internal successors, (844), 3 states have internal predecessors, (844), 0 states have call successors, (0), 0 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 15:26:46,737 INFO  L276                IsEmpty]: Start isEmpty. Operand 53133 states and 55507 transitions.
[2025-03-16 15:26:46,765 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1388
[2025-03-16 15:26:46,765 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 15:26:46,766 INFO  L218           NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:26:46,766 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2025-03-16 15:26:46,766 INFO  L396      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 15:26:46,767 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 15:26:46,767 INFO  L85        PathProgramCache]: Analyzing trace with hash 1765523275, now seen corresponding path program 1 times
[2025-03-16 15:26:46,767 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 15:26:46,767 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084301820]
[2025-03-16 15:26:46,767 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 15:26:46,767 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 15:26:46,862 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1387 statements into 1 equivalence classes.
[2025-03-16 15:26:46,916 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1387 of 1387 statements.
[2025-03-16 15:26:46,916 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 15:26:46,916 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 15:26:47,448 INFO  L134       CoverageAnalysis]: Checked inductivity of 2518 backedges. 1612 proven. 0 refuted. 0 times theorem prover too weak. 906 trivial. 0 not checked.
[2025-03-16 15:26:47,448 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 15:26:47,449 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084301820]
[2025-03-16 15:26:47,449 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084301820] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 15:26:47,449 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 15:26:47,449 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-16 15:26:47,449 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747499307]
[2025-03-16 15:26:47,449 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 15:26:47,449 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 15:26:47,449 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 15:26:47,450 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 15:26:47,450 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 15:26:47,450 INFO  L87              Difference]: Start difference. First operand 53133 states and 55507 transitions. Second operand  has 3 states, 3 states have (on average 253.33333333333334) internal successors, (760), 3 states have internal predecessors, (760), 0 states have call successors, (0), 0 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 15:26:48,735 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 15:26:48,735 INFO  L93              Difference]: Finished difference Result 113855 states and 119141 transitions.
[2025-03-16 15:26:48,736 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 15:26:48,736 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 253.33333333333334) internal successors, (760), 3 states have internal predecessors, (760), 0 states have call successors, (0), 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 1387
[2025-03-16 15:26:48,737 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 15:26:48,799 INFO  L225             Difference]: With dead ends: 113855
[2025-03-16 15:26:48,800 INFO  L226             Difference]: Without dead ends: 61413
[2025-03-16 15:26:48,830 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 15:26:48,831 INFO  L435           NwaCegarLoop]: 930 mSDtfsCounter, 550 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1666 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 550 SdHoareTripleChecker+Valid, 936 SdHoareTripleChecker+Invalid, 1788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 1666 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time
[2025-03-16 15:26:48,831 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [550 Valid, 936 Invalid, 1788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 1666 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time]
[2025-03-16 15:26:48,871 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 61413 states.
[2025-03-16 15:26:49,313 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 61413 to 60723.
[2025-03-16 15:26:49,344 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 60723 states, 60722 states have (on average 1.0427522150126807) internal successors, (63318), 60722 states have internal predecessors, (63318), 0 states have call successors, (0), 0 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 15:26:49,395 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 60723 states to 60723 states and 63318 transitions.
[2025-03-16 15:26:49,396 INFO  L78                 Accepts]: Start accepts. Automaton has 60723 states and 63318 transitions. Word has length 1387
[2025-03-16 15:26:49,397 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 15:26:49,397 INFO  L471      AbstractCegarLoop]: Abstraction has 60723 states and 63318 transitions.
[2025-03-16 15:26:49,397 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 253.33333333333334) internal successors, (760), 3 states have internal predecessors, (760), 0 states have call successors, (0), 0 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 15:26:49,397 INFO  L276                IsEmpty]: Start isEmpty. Operand 60723 states and 63318 transitions.
[2025-03-16 15:26:49,417 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1440
[2025-03-16 15:26:49,418 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 15:26:49,418 INFO  L218           NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:26:49,418 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2025-03-16 15:26:49,418 INFO  L396      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 15:26:49,419 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 15:26:49,419 INFO  L85        PathProgramCache]: Analyzing trace with hash 834526977, now seen corresponding path program 1 times
[2025-03-16 15:26:49,419 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 15:26:49,419 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887360992]
[2025-03-16 15:26:49,419 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 15:26:49,419 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 15:26:49,477 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1439 statements into 1 equivalence classes.
[2025-03-16 15:26:49,514 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1439 of 1439 statements.
[2025-03-16 15:26:49,515 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 15:26:49,515 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 15:26:49,940 INFO  L134       CoverageAnalysis]: Checked inductivity of 2888 backedges. 1794 proven. 0 refuted. 0 times theorem prover too weak. 1094 trivial. 0 not checked.
[2025-03-16 15:26:49,941 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 15:26:49,941 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887360992]
[2025-03-16 15:26:49,941 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887360992] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 15:26:49,941 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 15:26:49,941 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-16 15:26:49,941 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737000340]
[2025-03-16 15:26:49,941 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 15:26:49,942 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 15:26:49,942 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 15:26:49,942 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 15:26:49,942 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 15:26:49,943 INFO  L87              Difference]: Start difference. First operand 60723 states and 63318 transitions. Second operand  has 3 states, 3 states have (on average 269.0) internal successors, (807), 3 states have internal predecessors, (807), 0 states have call successors, (0), 0 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 15:26:51,297 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 15:26:51,297 INFO  L93              Difference]: Finished difference Result 120755 states and 125944 transitions.
[2025-03-16 15:26:51,297 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 15:26:51,297 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 269.0) internal successors, (807), 3 states have internal predecessors, (807), 0 states have call successors, (0), 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 1439
[2025-03-16 15:26:51,298 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 15:26:51,357 INFO  L225             Difference]: With dead ends: 120755
[2025-03-16 15:26:51,357 INFO  L226             Difference]: Without dead ends: 60723
[2025-03-16 15:26:51,386 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 15:26:51,386 INFO  L435           NwaCegarLoop]: 919 mSDtfsCounter, 524 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1650 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 524 SdHoareTripleChecker+Valid, 925 SdHoareTripleChecker+Invalid, 1778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 1650 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time
[2025-03-16 15:26:51,386 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [524 Valid, 925 Invalid, 1778 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 1650 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time]
[2025-03-16 15:26:51,422 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 60723 states.
[2025-03-16 15:26:51,743 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 60723 to 60723.
[2025-03-16 15:26:51,783 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 60723 states, 60722 states have (on average 1.0381080992062186) internal successors, (63036), 60722 states have internal predecessors, (63036), 0 states have call successors, (0), 0 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 15:26:51,833 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 60723 states to 60723 states and 63036 transitions.
[2025-03-16 15:26:51,833 INFO  L78                 Accepts]: Start accepts. Automaton has 60723 states and 63036 transitions. Word has length 1439
[2025-03-16 15:26:51,834 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 15:26:51,834 INFO  L471      AbstractCegarLoop]: Abstraction has 60723 states and 63036 transitions.
[2025-03-16 15:26:51,834 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 269.0) internal successors, (807), 3 states have internal predecessors, (807), 0 states have call successors, (0), 0 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 15:26:51,834 INFO  L276                IsEmpty]: Start isEmpty. Operand 60723 states and 63036 transitions.
[2025-03-16 15:26:51,853 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1452
[2025-03-16 15:26:51,853 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 15:26:51,853 INFO  L218           NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:26:51,853 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2025-03-16 15:26:51,853 INFO  L396      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 15:26:51,854 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 15:26:51,854 INFO  L85        PathProgramCache]: Analyzing trace with hash -286954970, now seen corresponding path program 1 times
[2025-03-16 15:26:51,854 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 15:26:51,854 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846222426]
[2025-03-16 15:26:51,854 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 15:26:51,854 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 15:26:51,907 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1451 statements into 1 equivalence classes.
[2025-03-16 15:26:51,943 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1451 of 1451 statements.
[2025-03-16 15:26:51,943 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 15:26:51,943 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 15:26:54,643 INFO  L134       CoverageAnalysis]: Checked inductivity of 2697 backedges. 740 proven. 0 refuted. 0 times theorem prover too weak. 1957 trivial. 0 not checked.
[2025-03-16 15:26:54,647 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 15:26:54,647 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846222426]
[2025-03-16 15:26:54,647 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846222426] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 15:26:54,647 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 15:26:54,647 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-16 15:26:54,647 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456132369]
[2025-03-16 15:26:54,647 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 15:26:54,648 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 15:26:54,648 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 15:26:54,648 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 15:26:54,648 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 15:26:54,648 INFO  L87              Difference]: Start difference. First operand 60723 states and 63036 transitions. Second operand  has 3 states, 3 states have (on average 213.33333333333334) internal successors, (640), 3 states have internal predecessors, (640), 0 states have call successors, (0), 0 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 15:26:56,042 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 15:26:56,042 INFO  L93              Difference]: Finished difference Result 122135 states and 126778 transitions.
[2025-03-16 15:26:56,042 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 15:26:56,042 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 213.33333333333334) internal successors, (640), 3 states have internal predecessors, (640), 0 states have call successors, (0), 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 1451
[2025-03-16 15:26:56,043 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 15:26:56,104 INFO  L225             Difference]: With dead ends: 122135
[2025-03-16 15:26:56,104 INFO  L226             Difference]: Without dead ends: 61413
[2025-03-16 15:26:56,139 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 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 15:26:56,139 INFO  L435           NwaCegarLoop]: 751 mSDtfsCounter, 645 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1664 mSolverCounterSat, 240 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 645 SdHoareTripleChecker+Valid, 756 SdHoareTripleChecker+Invalid, 1904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 240 IncrementalHoareTripleChecker+Valid, 1664 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time
[2025-03-16 15:26:56,139 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [645 Valid, 756 Invalid, 1904 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [240 Valid, 1664 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time]
[2025-03-16 15:26:56,173 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 61413 states.
[2025-03-16 15:26:56,539 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 61413 to 61413.
[2025-03-16 15:26:56,580 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 61413 states, 61412 states have (on average 1.032827460431186) internal successors, (63428), 61412 states have internal predecessors, (63428), 0 states have call successors, (0), 0 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 15:26:56,631 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 61413 states to 61413 states and 63428 transitions.
[2025-03-16 15:26:56,632 INFO  L78                 Accepts]: Start accepts. Automaton has 61413 states and 63428 transitions. Word has length 1451
[2025-03-16 15:26:56,632 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 15:26:56,632 INFO  L471      AbstractCegarLoop]: Abstraction has 61413 states and 63428 transitions.
[2025-03-16 15:26:56,632 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 213.33333333333334) internal successors, (640), 3 states have internal predecessors, (640), 0 states have call successors, (0), 0 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 15:26:56,633 INFO  L276                IsEmpty]: Start isEmpty. Operand 61413 states and 63428 transitions.
[2025-03-16 15:26:56,653 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1506
[2025-03-16 15:26:56,653 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 15:26:56,654 INFO  L218           NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:26:56,654 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2025-03-16 15:26:56,654 INFO  L396      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 15:26:56,654 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 15:26:56,655 INFO  L85        PathProgramCache]: Analyzing trace with hash 457646043, now seen corresponding path program 1 times
[2025-03-16 15:26:56,655 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 15:26:56,655 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679856417]
[2025-03-16 15:26:56,655 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 15:26:56,655 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 15:26:56,715 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1505 statements into 1 equivalence classes.
[2025-03-16 15:26:56,754 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1505 of 1505 statements.
[2025-03-16 15:26:56,754 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 15:26:56,754 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 15:26:57,349 INFO  L134       CoverageAnalysis]: Checked inductivity of 3157 backedges. 1636 proven. 0 refuted. 0 times theorem prover too weak. 1521 trivial. 0 not checked.
[2025-03-16 15:26:57,349 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 15:26:57,349 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679856417]
[2025-03-16 15:26:57,349 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679856417] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 15:26:57,349 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 15:26:57,349 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-16 15:26:57,349 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32264061]
[2025-03-16 15:26:57,349 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 15:26:57,350 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 15:26:57,350 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 15:26:57,350 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 15:26:57,351 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 15:26:57,351 INFO  L87              Difference]: Start difference. First operand 61413 states and 63428 transitions. Second operand  has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 0 states have call successors, (0), 0 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 15:26:58,771 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 15:26:58,771 INFO  L93              Difference]: Finished difference Result 122133 states and 126163 transitions.
[2025-03-16 15:26:58,771 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 15:26:58,771 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 0 states have call successors, (0), 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 1505
[2025-03-16 15:26:58,772 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 15:26:58,772 INFO  L225             Difference]: With dead ends: 122133
[2025-03-16 15:26:58,772 INFO  L226             Difference]: Without dead ends: 0
[2025-03-16 15:26:58,810 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 15:26:58,811 INFO  L435           NwaCegarLoop]: 938 mSDtfsCounter, 625 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1779 mSolverCounterSat, 218 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 625 SdHoareTripleChecker+Valid, 943 SdHoareTripleChecker+Invalid, 1997 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 218 IncrementalHoareTripleChecker+Valid, 1779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time
[2025-03-16 15:26:58,811 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [625 Valid, 943 Invalid, 1997 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [218 Valid, 1779 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time]
[2025-03-16 15:26:58,811 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2025-03-16 15:26:58,811 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2025-03-16 15:26:58,811 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 15:26:58,811 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2025-03-16 15:26:58,812 INFO  L78                 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1505
[2025-03-16 15:26:58,812 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 15:26:58,812 INFO  L471      AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2025-03-16 15:26:58,812 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 0 states have call successors, (0), 0 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 15:26:58,812 INFO  L276                IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2025-03-16 15:26:58,812 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2025-03-16 15:26:58,815 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2025-03-16 15:26:58,815 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2025-03-16 15:26:58,817 INFO  L422         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-16 15:26:58,819 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.
[2025-03-16 15:26:59,944 INFO  L170   ceAbstractionStarter]: Computing trace abstraction results
[2025-03-16 15:26:59,958 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 03:26:59 BoogieIcfgContainer
[2025-03-16 15:26:59,959 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2025-03-16 15:26:59,960 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2025-03-16 15:26:59,960 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2025-03-16 15:26:59,960 INFO  L274        PluginConnector]: Witness Printer initialized
[2025-03-16 15:26:59,961 INFO  L184        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:26:09" (3/4) ...
[2025-03-16 15:26:59,963 INFO  L146         WitnessPrinter]: Generating witness for correct program
[2025-03-16 15:27:00,000 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges
[2025-03-16 15:27:00,003 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges
[2025-03-16 15:27:00,007 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges
[2025-03-16 15:27:00,010 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges
[2025-03-16 15:27:00,230 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml
[2025-03-16 15:27:00,231 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml
[2025-03-16 15:27:00,231 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2025-03-16 15:27:00,232 INFO  L158              Benchmark]: Toolchain (without parser) took 54694.21ms. Allocated memory was 167.8MB in the beginning and 620.8MB in the end (delta: 453.0MB). Free memory was 118.2MB in the beginning and 147.0MB in the end (delta: -28.7MB). Peak memory consumption was 420.9MB. Max. memory is 16.1GB.
[2025-03-16 15:27:00,232 INFO  L158              Benchmark]: CDTParser took 0.22ms. Allocated memory is still 192.9MB. Free memory is still 118.4MB. There was no memory consumed. Max. memory is 16.1GB.
[2025-03-16 15:27:00,232 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 767.26ms. Allocated memory is still 167.8MB. Free memory was 118.2MB in the beginning and 86.2MB in the end (delta: 32.1MB). Peak memory consumption was 101.6MB. Max. memory is 16.1GB.
[2025-03-16 15:27:00,233 INFO  L158              Benchmark]: Boogie Procedure Inliner took 205.29ms. Allocated memory is still 167.8MB. Free memory was 86.2MB in the beginning and 98.3MB in the end (delta: -12.1MB). Peak memory consumption was 38.4MB. Max. memory is 16.1GB.
[2025-03-16 15:27:00,233 INFO  L158              Benchmark]: Boogie Preprocessor took 234.89ms. Allocated memory is still 167.8MB. Free memory was 98.3MB in the beginning and 88.4MB in the end (delta: 9.9MB). Peak memory consumption was 69.3MB. Max. memory is 16.1GB.
[2025-03-16 15:27:00,233 INFO  L158              Benchmark]: IcfgBuilder took 2721.64ms. Allocated memory was 167.8MB in the beginning and 335.5MB in the end (delta: 167.8MB). Free memory was 87.4MB in the beginning and 200.6MB in the end (delta: -113.2MB). Peak memory consumption was 205.2MB. Max. memory is 16.1GB.
[2025-03-16 15:27:00,234 INFO  L158              Benchmark]: TraceAbstraction took 50486.23ms. Allocated memory was 335.5MB in the beginning and 620.8MB in the end (delta: 285.2MB). Free memory was 200.6MB in the beginning and 192.9MB in the end (delta: 7.8MB). Peak memory consumption was 685.3MB. Max. memory is 16.1GB.
[2025-03-16 15:27:00,234 INFO  L158              Benchmark]: Witness Printer took 270.93ms. Allocated memory is still 620.8MB. Free memory was 192.9MB in the beginning and 147.0MB in the end (delta: 45.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB.
[2025-03-16 15:27:00,235 INFO  L338   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 0.22ms. Allocated memory is still 192.9MB. Free memory is still 118.4MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 767.26ms. Allocated memory is still 167.8MB. Free memory was 118.2MB in the beginning and 86.2MB in the end (delta: 32.1MB). Peak memory consumption was 101.6MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 205.29ms. Allocated memory is still 167.8MB. Free memory was 86.2MB in the beginning and 98.3MB in the end (delta: -12.1MB). Peak memory consumption was 38.4MB. Max. memory is 16.1GB.
 * Boogie Preprocessor took 234.89ms. Allocated memory is still 167.8MB. Free memory was 98.3MB in the beginning and 88.4MB in the end (delta: 9.9MB). Peak memory consumption was 69.3MB. Max. memory is 16.1GB.
 * IcfgBuilder took 2721.64ms. Allocated memory was 167.8MB in the beginning and 335.5MB in the end (delta: 167.8MB). Free memory was 87.4MB in the beginning and 200.6MB in the end (delta: -113.2MB). Peak memory consumption was 205.2MB. Max. memory is 16.1GB.
 * TraceAbstraction took 50486.23ms. Allocated memory was 335.5MB in the beginning and 620.8MB in the end (delta: 285.2MB). Free memory was 200.6MB in the beginning and 192.9MB in the end (delta: 7.8MB). Peak memory consumption was 685.3MB. Max. memory is 16.1GB.
 * Witness Printer took 270.93ms. Allocated memory is still 620.8MB. Free memory was 192.9MB in the beginning and 147.0MB in the end (delta: 45.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: ErrorAutomatonStatistics
    NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0
  - PositiveResult [Line: 127]: a call to reach_error is unreachable
    For all program executions holds that a call to reach_error is unreachable at this location
  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 1 procedures, 696 locations, 1382 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 49.3s, OverallIterations: 19, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 30.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 12450 SdHoareTripleChecker+Valid, 26.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 12450 mSDsluCounter, 13207 SdHoareTripleChecker+Invalid, 21.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 126 mSDsCounter, 6465 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 37806 IncrementalHoareTripleChecker+Invalid, 44271 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6465 mSolverCounterUnsat, 13081 mSDtfsCounter, 37806 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2619 GetRequests, 2585 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=61413occurred in iteration=18, InterpolantAutomatonStates: 59, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.7s AutomataMinimizationTime, 19 MinimizatonAttempts, 7590 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 10.9s InterpolantComputationTime, 16651 NumberOfCodeBlocks, 16651 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 16629 ConstructedInterpolants, 0 QuantifiedInterpolants, 41026 SizeOfPredicates, 0 NumberOfNonLiveVariables, 3012 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 22 InterpolantComputations, 19 PerfectInterpolantSequences, 20850/22050 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available
  - AllSpecificationsHoldResult: All specifications hold
    1 specifications checked. All of them hold
  - InvariantResult [Line: 4269]: Location Invariant
    Derived location invariant: (((((((((((((((a24 <= 3) && (a18 == 9)) || (((a15 != 4) && (a18 == 10)) && (a15 <= 5))) || ((a18 == 11) && (a24 <= 3))) || (((a15 != 4) && (a18 == 10)) && (a24 <= 3))) || ((a18 <= 8) && (a24 <= 3))) || (((3 <= a24) && (a15 <= 4)) && (a18 == 12))) || (((a15 == 4) && (a18 == 10)) && (a3 <= 99))) || ((a18 <= 8) && (a15 <= 5))) || ((a15 <= 4) && (a24 <= 1))) || (((3 <= a24) && (a15 <= 4)) && (a18 == 10))) || (((a15 != 4) && (a24 <= 3)) && (a18 == 12))) || (((a18 == 12) && (a15 <= 5)) && (a3 <= 99))) || ((a18 == 11) && (a15 <= 5))) || ((a15 <= 4) && (a18 == 9)))
RESULT: Ultimate proved your program to be correct!
[2025-03-16 15:27:00,251 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0
Received shutdown request...
--- End real Ultimate output ---

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